Adaptive [Phi00c]. Adaptors [Bec02e, PW00]. Adding [Sta01]. Adventures [Sch00a]. Advice [Me
AccelePort Xr 920 主机适配器商品说明书
RJ-45 Pin AssignmentRefer to the CD-ROM for more detailed cabling information.What Next?At this point the hardware installation for your AccelePort Xr 920 hostadapter is complete. However, since the adapter must have softwaredownloaded to its RAM before it becomes functional, you must nextinstall the software drivers for your operating system.•Read the instruction booklet for the CD-ROM that came with youradapter for instructions on installing software.•View the on-line documentation on the CD-ROM for more informa-tion about AccelePort products.The Digi logo and AccelePort are registered trademarks of Digi International. Xr 920,4r 920, and 8r 920 are trademarks of Digi International.All other brand and product names are trademarks of their respective holders.© Digi International Inc., 1998All Rights ReservedInformation in this document is subject to change without notice and does not represent acommitment on the part of Digi International.Digi provides this document “as is”, without warranty of any kind, either expressed orimplied, including, but not limited to, the implied warranties of fitness or merchantabilityfor a particular purpose. Digi may make improvements and/or changes in this manual or inthe product(s) and/or the program(s) described in this manual at any time.This product could include technical inaccuracies or typographical errors. Changes are peri-odically made to the information herein; these changes may be incorporated in new editionsof the publication.AccelePort Xr 920 Family:4r 920 and 8r 920ISA Host AdaptersEIA-232HardwareInstallation Guide IntroductionAn AccelePort® Xr 920™ host adapter easily expands the number of EIA-232 ports available on your computer, allowing you to cable addi-tional peripheral devices, such as modems, terminals or serial printers, directly to your computer.As shown in the figure below, an Xr 920 host adapter has one connector to which a special Digi connector assembly is attached to provide the peripheral port connections. There are three different connector assembly options available from Digi to use with an Xr 920 host adapter: an RJ-45 Connector Box, a DB-25 Connector Box, or a DB-25 Cable Assembly.Figure 17. Example 4r 920 host adapter with connector assemblies This installation guide describes how to plan your setup and install AccelePort Xr 920 host adapter hardware.Signal Description PinRI Ring Indicator1DSR Data Set Ready 2 †RTS Request T o Send3GND Chassis Ground4TxD T ransmitted Data5RxD Received Data6SG Signal Ground7CTS Clear T o Send8DTR Data T erminal Ready9DCD Data Carrier Detect10† Pin 2 can be configured for DCD (through Digisoftware) if you want to connect using an 8 pinconnector91000736 AStep One: Plan your setupAn AccelePort Xr 920 adapter can be set up in a variety of ways. Before you start your installation, be sure of the following:Number of components. You can connect up to four peripherals to an AccelePort 4r 920 and up to eight peripherals to an AccelePort 8r 920 host adapter.Location of components. You can locate peripherals a distance from the adapter, but you must be sure that the cables you use to make the connection are properly constructed. To achieve the greatest reliabil-ity over distance, cables should be:•Shielded, low capacitance, and preferably designed specifically for serial data transmission.•Grounded at both ends of the cable.•Routed away from noise sources such as generators, motors and fluorescent lights.Cable Connections. Before beginning the installation, be sure that you have one of the Digi connector assemblies illustrated in Figure 1. You will also need a cable for each peripheral that you will be attaching to the connector assembly. The connector type that you need at either end of the peripheral cable depends on the type of Digi connector assembly that you use and the connector on the peripheral.Digi connector assemblies are available with RJ-45 or DB-25 connec-tors. You will need to be sure that you have cables of the correctlength and with the right connectors to properly attach the devices you want to use.Additional information about the AccelePort 4r 920 and 8r 920, such as specifications and cabling details, is provided on the CD-ROM that is packaged with the host adapter.Step Two: Install the Xr 920 ISA host adapterBefore installing the Xr 920 host adapter, you should do the following:•Check system resources for a free I/O port address. The Xr 920adapter uses four bytes of address space on the I/O bus of the com-puter into which you are installing it.•Wear an ESD wrist strap to ground yourself while handling theadapter. If one is not available, discharge static electricity from yourbody by touching an unpainted metal surface, such as the computer’schassis, prior to handling the adapter.•Record the adapter serial number, which will enable Digi to provideyou with better service, should the need arise. The serial number labelhas this general format: S/N: (S) XXX XXXXX•Unplug power from the PC.Figure 18. Xr 920 ISA host adapter1.Set the I/O port address of the adapter to one of the followingaddresses using the DIP switch at the location indicated in Figure 18:2.Remove the computer’s cover.3.Locate an available ISA slot in your computer and remove the slotplate.4.Insert the adapter into the slot and screw the endplate to the computerchassis. The endplate must be screwed into the computer chassis toremain in compliance with Part 15 of FCC rules.5.Replace the computer’s cover.6.Attach the 78-pin end of a Digi connector assembly to the connectoron the adapter.Step Three: Install peripheral cablingYou can connect modems, terminals, serial printers (or any other standardEIA-232 device to be controlled by applications on the computer) to anAccelePort Xr 920 host adapter by installing a cable between the periph-eral and the Digi connector assembly.On the peripheral end of the cable, the connector you use depends on therequirements of the peripheral. The Digi end of the cable must fit eitheran RJ-45 or DB-25 connector, depending on the Digi connector assemblyyou have.The pin assignments for each type of connector used on the connectorassemblies are as follows:DB-25 Pin AssignmentsI/Oaddress1234104-107h up up down down114-117h up down up down124-127h up down down down204-207h down up up down224-227h down up down down304-307h down down up down324-327h down down downdownSignal Description PinGND Chassis Ground1*TxD T ransmitted Data2RxD Received Data3RTS Request T o Send4CTS Clear T o Send5DSR Data Set Ready6SG Signal Ground7DCD Data Carrier Detect8DTR Data T erminal Ready20RI Ring Indicator22* Chassis Ground is also available on theconnector shell。
adaptec Adaptec 6系列和5Z系列 RAID控制卡的零维护缓存保护
零维护缓存保护简报降低数据中心运营成本，最大限度保护缓存数据产品要点低运营成本– 没有电池相关的安装、监控、维护、弃置或者更换成本停电情况下不会丢失数据– 取代锂电池零维护缓存保护– 无需监测电池充电情况– 更换电池过程中不需要关闭系统– 无限期地保护数据 -“在电池电量耗尽之前”不需要急于重启系统– 保存数据长达数年之久RAID缓存即时保护– 充电只需要几分钟时间，而不是几小时– 环境优化RAID性能环保– 无毒电池废弃处理– 配合Adaptec智能电源管理功能打造行业“最绿色”解决方案- 遵从简化的 IATA 规则完全集成在5Z系列RAID控制上并作为6系列的附件套件IDC预计，在四年时间内一步IT设备的运营成本将增长到原始采购成本的4倍。
Adaptec 6系列和5Z系列RAID控制卡采用了零维护缓存保护（Zero-Maintenance CacheProtection，ZMCP）功能，最大限度保护缓存数据，大幅削减成本并减少了复杂、杂乱和昂贵的锂电池对环境的影响，同时提高了缓存保护和缓存性能。
为什么你需要缓存保护随着用户持续关注针对快速增加的数据集进行的容量利用率优化，RAID 5和RAID 6在企业级存储系统中的运用继续增长着。
然而，除非启用了所有可用缓存，否则系统无法实现最佳性能。
不过，启用控制卡缓存之后，数据被保存在控制卡的内存中，并有可能在系统断电的情况下丢失。
防止这种情况发生的最常见保护措施就是使用一个直接安装在控制卡上的电池备份单元（BBU）来备份控制卡缓存。
这种电池是维护板载缓存数据，直到恢复对电池备份单元的供电。
电池备份单元的第二个使用方法就是配合Adaptec 6系列、5Z系列、5系列和2系列RAID控制卡产品系列所提供的Adaptec智能电源管理功能（Intelligent Power Management）。
为了让控制卡降低硬盘转速或者完全停转，硬盘中必须是没有任何I/O活动的。
Adaptec
Adaptec™ 39320A/U320 SCSI RAID 0 或 1 用户指南简介硬件安装BIOS RAID 配置与管理Windows 操作系统驱动程序安装SCSI 电缆和连接器Adaptec U320 SCSI RAID 0 或 1 规格Adaptec U320 SCSI RAID 0 或 1 故障排除Adaptec U320 SCSI RAID 管制信息Adaptec U320 SCSI RAID 词汇表注、注意和小心注：“注”表示可以帮助您更好地使用计算机系统的重要信息。
注意： “注意”表示可能会损坏硬件或导致数据丢失，并告诉您如何避免此类问题。
小心： “小心”表示有可能造成财产损失、人身伤害或死亡。
本文件中的信息如有更改，恕不另行通知。
© 2004 Dell Inc. 保留所有权利。
未经 Dell Inc. 书面许可，严禁以任何形式进行复制。
本文中使用的商标：Dell、DELL 徽标和 Dell OpenManage 是 Dell Inc. 的商标；Intel、Pentium 和Celeron 是 Intel Corporation 的注册商标；Microsoft 和 Windows 是 Microsoft Corporation 的注册商标。
Red Hat 是 Red Hat, Inc. 的注册商标。
本文中述及的其他商标和产品名称是指拥有相应商标和名称的公司或其制造的产品。
Dell Inc. 对本公司的商标和产品名称之外的其他商标和产品名称不拥有任何专利权。
型号：Adaptec U320 SCSI RAID 0 或 1March 2005 P/N WC617 Rev. A00达 640 MB/秒（总吞吐量）。
Adaptec U320 SCSI RAID 0 or 1 控制器具有下列特性：两个独立的可启动 SCSI 通道每个通道上各有 15 个多功能设备混合使用 LVD 和 SE 设备，相关性能会降低。
Elevator dictionary(电梯名词中英对照)
蒸压轻质混凝土 9
算法规则系统 校正 校正样板 校正 校正量规
alkali
碱
all-computer-controlled
计算机全控的
allocation
分配,分派
allocation of landing call
amplification
放大
11
amplification stage
放大等级
amplifier
放大器
amplifying tube
放大管
amplitude
幅度
analogue(analog)
模拟
analog adder
模拟加法器
analog computer
模拟计算机
analog speed card analog-digital converter analysis analysis mode anchor bolt anchorage angle bar angle guide angle iron angle iron frame
防腐蚀漆 防蠕动 抗摩擦轴承 防干扰 防捣乱装置 反向制动 反相电流
anti-rebound of compensation rope
device
补偿绳防跳装置
14
anti-residual
防剩磁
anti-resonance
抗谐振
anti-reversion device
防反转装置
anti-rust
access switch access way accessibility accessible accessible space accessory accident accident insurance accident prevention accidental contact accidental operation accordion door accumulation
电器电子辞汇英语翻译
模拟数字转换器模数转换器 a d converter 缓冲存储器 abbreviated code快速呼唤 abbreviated dialing象差 aberration?异样辉光放电 abnormal glow discharge 异样反射 abnormal reflections磨耗 abrasion?磨粉 abrasive dust磨料喷射加工 abrasive jet machining? 磨料喷射蝶 abrasive jet trimming磨蚀剂 abrasive paste?研磨蝶 abrasive trimming磨料 abrasive?急剧退化 abrupt degradation突变异质结 abrupt heterojunction 突变结 abrupt junction绝对亮度阈absolute threshold of luminance吸收功率 absorbed power吸收剂 absorber?吸收能力 absorbing capacity?吸收电路 absorbing circuit吸收层 absorbing layer吸收媒质 absorbing medium?吸收跃迁 absorbing transition吸收带 absorption band吸收长度 absorption length吸收线 absorption line吸收损失 absorption loss?吸收测定 absorption measurement吸收灯 absorption modulation吸收点 absorption point吸收电阻 absorption resistance 吸收 absorption?对接 abutment joint?截割水晶片 ac cut quartz ac加速老化 accelerated aging?加速粒子 accelerated particle 加速实验 accelerated test?加速阳极 accelerating anode加速周期 accelerating cycle?加速电极 accelerating electrode 加速栅极 accelerating grid加速缝 accelerating slit加速管 accelerating tube?加速波 accelerating wave? 带电粒子加速acceleration of charged particles加速空间 acceleration space加速电压 acceleration voltage?加重 accentuation较佳对照度 acceptable contrast ratio受主 acceptor受汁子 acceptor atom受中心 acceptor center受周度 acceptor density受钟质 acceptor impurity受周级 acceptor level受滞半导体 acceptor type semiconductor存取码 access code访问方式 access method适应性第 accommodation第系数 accommodation coefficient? 积存层 accumulation layer再生精准度 accuracy in reproduction 精准定位 accurate positioning改良型专用射极耦合逻辑 ace消色差区 achromatc region消色差透镜 achromatic lens?消色差阈值 achromatic threshold针状结晶 acicular crystal酸侵蚀 acid etch橡实管 acorn tube吸声系数 acoustic absorptivity?滤声器 acoustic filter?声频 acoustic frequency? 声像 acoustic image声阻抗 acoustic impedance?声迷路 acoustic labyrinth声动录音机acoustic manipulated recorder声面波 acoustic surface waves声能转换器 acoustic transducer声学处置 acoustic treatment音波 acoustic wave表面声波振荡器 acoustic wave oscillator声延时线 acoustical delay line受钟质 acceptor impurity受周级 acceptor level受滞半导体 acceptor type semiconductor存取码 access code访问方式 access method适应性第 accommodation第系数 accommodation coefficient? 积存层 accumulation layer再生精准度 accuracy in reproduction 精准定位 accurate positioning改良型专用射极耦合逻辑 ace消色差区 achromatc region消色差透镜 achromatic lens?消色差阈值 achromatic threshold针状结晶 acicular crystal酸侵蚀 acid etch橡实管 acorn tube吸声系数 acoustic absorptivity?滤声器 acoustic filter?声频 acoustic frequency? 声像 acoustic image声阻抗 acoustic impedance?声迷路 acoustic labyrinth声动录音机acoustic manipulated recorder声面波 acoustic surface waves声能转换器 acoustic transducer声学处置 acoustic treatment音波 acoustic wave表面声波振荡器 acoustic wave oscillator声延时线 acoustical delay line酌半径 action radius?活化阴板 activated cathode活化分子 activated molecule?激活能 activation energy?激活 activation?有源区 active area有效分量 active component踊跃干扰 active counter measures 活性粉尘 active dust有源元件 active element有源元件组 active element group 活性纤维 active fiber有源滤波器 active filter织制导 active guidance织寻的制导 active homing guidance 有源激光元件 active laser element 激光皮捉质 active laser substance 活性液体 active liquid有源波模同步 active mode locking 有源寄生元件 active parasitics有源 q 开关 active q switching有源备份 active redundancy有源中继器 active repeater有源四端网络的反射损耗 active return loss有源卫星转发器active satellite repeater有源衬底 active substrate有源衬底蝶 active substrate trimming传动机构 actuator?锐度 acuity适应性均衡器 adaptability equalizer适应 adaptation?套筒式联轴器 adapter coupling转接器 adapter?自适应相关器 adaptive correlator自适应增量灯 adaptive delta modulation自适应接收机 adaptive receiver吸附原子 adatom爱德考克天线 adcock antenna爱德考克测向仪 adcock direction finder附加元件 add ons加色法混合 additive color mixture加色法合成 additive color synthesis加色法系统 additive color system基色的相加混合additive mixing of primaries加色法原色 additive primaires印刷电路的添加技术additive printed circuit technique加色法 additive process? 寻址系统 addressing system附着 adherence?粘着强度 adhesion strength?粘合剂 adhesive粘合剂涂敷 adhesive coating芯片粘附 adhesive die attachment胶粘密封 adhesive sealing粘合带 adhesive tape邻道伴音载波 adjacent audio carrier相邻信道 adjacent channel邻信道衰减 adjacent channel attenuation邻信道干扰adjacent channel interference邻频道抑制器 adjacent channel rejector相邻信道选择性adjacent channel selectivity相邻线路 adjacent lines邻信道图象载波 adjacent picture carrier相邻图象载波距离adjacent picture carrier spacing邻频道图象载波陷波器 adjacent picture carrier trap可单减器 adjustable attenuator可堤路 adjustable short可敌值金属氧化物半导体adjustable threshold mos蝶 adjustment?导纳矩阵 admittance matrix导纳 admittance?混合物 admixture?吸附质 adsorbate吸附剂 adsorbent?吸附层 adsorption layer? 吸附 adsorption?低劣半导体材料adulterated semiconductor material超前角 advance angle?改良型低功耗肖特基晶体管晶体管逻辑电路 advanced low power schottky ttl改良型自对准多晶硅栅工艺advanced polysilicon self aligned process改良型肖特基晶体管逻辑电路advanced schottky transistor logic改良型肖特基晶体管晶体管逻辑电路 advanced schottky ttl天线阵 aerial array天线衰减器 aerial attenuator天线电缆 aerial cable天线电容 aerial capacity天线扼力 aerial choke天线电路 aerial circuit天线藕合 aerial coupling天线藕合线圈 aerial coupling coil 天线电流 aerial current天线效率 aerial efficiency天线鼓励 aerial excitation天线馈电 aerial feed天线馈线 aerial feeder天线阻抗 aerial impedance天线电感 aerial inductance天线引入线 aerial lead in透镜天线 aerial lens天线损耗 aerial loss天线噪声 aerial noise天线功率 aerial power 天线辐射电阻aerial radiation resistance天线电抗 aerial reactance天线电阻 aerial resistance天线系统 aerial system天线接头 aerial terminal天线杆 aerial tower?天线党电容器 aerial tuning capacitor天线党线圈 aerial tuning coil天线 aerial?航空电子学的 aeroelectronic航空电子学 aeroelectronics?无线电报 aerogram导航电台 aeronautical station飞机天线 aeroplane antenna飞机反射的干扰信号 aeroplane flutter俄歇电子能谱学 aes音频 af?亲合力 affinity?后加速 after acceleration余晖 afterglow余像 afterimage后处置 aftertreatment?老化条件 ageing condition老化 ageing?集聚 aggregate?雪崩注入 ai雪崩注入二极管 aid半自动跟踪 aided tracking雪崩感生徙动 aim空气隔离型单片集成电路 aimic 空气轴承台 air bearing stage间隙 air clearance?空气冷却式激光器 air cooled laser空对地通信 air ground communication空气隔离 air isolation空气隔离型集成电路air isolation integrated circuit空气隔离型集成工艺air isolation process漏气 air leak?空气氧化物隔离 air oxide isolation空中位置指示器 air position indicator吹气清洗 air purge侦查海面舰艇的飞机监视雷达air to surface vessel radar风动传送设备 air track飞机无线电信标 airborne beacon空传污染 airborne contamination机载雷达 airborne radar机载电视接收机airborne television receiver拦截飞机雷达aircraft interception radar飞机电台 aircraft station机场信标 airport beacon机场危险信标 airport danger beacon机场交通操纵 airport traffic control气密接合 airtight joint报警信号 alarm signal?反射率测量 albedo measurement反照率 albedo?自动逻辑设计 ald 阿尔福德环形天线 alford loop antenna 铝栅 alg算法 algorithm?对准器 aligner对准精度 alignment accuracy对准误差 alignment error蝶用激光器 alignment laser对准标记 alignment mark定位锁 alignment pin?周密对准 alignment registration校准要求 alignment requirements定位 alignment?碱金属锑化物 alkali antimonide无碱环境 alkali free environment由碱可除光刻胶alkaline strippable resist全波段电视党器 all band tv tuner全扩散型集成电路all diffused integrated circuit交直两用接收机 all mains receiver全天候雷达 all weather radar分派器 allotter?允许能带 allowed band?允许能级 allowed level允许线 allowed line允许跃迁 allowed transition合金薄膜 alloy film合金结 alloy junction合金结晶体管 alloy junction transistor合金晶体管 alloy transistor合金 alloy? 合金接触 alloyed contact合金型二极管 alloyed diode合金区域 alloyed region接字母顺序的 alpha抗射线性 alpha immunity粒子轰击 alpha particle bombardment粒子爱惜 alpha particle protection粒子辐射灵敏度alpha radiation sensitivity粒子闪烁计数器alpha scintillation counter字符印字管 alphanumeric printing tube管 alphatron?更替路由 alternate route隔行扫描 alternate scanning交流 alternating current交菱量 alternating current measurement交羚阻 alternating current resistance超导交流 alternating supercurrent高度计 altimeter?高度指示器 altitude indicator?算术与逻辑部件 alu氧化铝陶瓷板划线alumina ceramic scribing氧化铝管壳 alumina package氧化铝 alumina?铝金属化 aluminizing铝硅酸盐玻璃 aluminosilicate glass铝线热压焊 aluminum bonding氧化铝陶瓷 aluminum oxide ceramics铝尖峰形成 aluminum spiking氧化物阶梯的铝覆盖aluminum step coverage铝线热压焊接 aluminum wire bond爹收音机 am receiver爹接收 am reception爹 am?爱好者 amateur业余波段 amateur band业余无线电台 amateur radio station 环境空气监测器 ambient air monitor 周围环境 ambient enviroment环境湿度 ambient humidity环境压力 ambient pressure?周围介质温度 ambient temperature 非单值性 ambiguity?双极性扩散 ambipolar diffusion?氨微波激射器氨脉泽 ammonia maser铵分子束频率标准ammonium molecular beam frequency standard无定形化 amorphization非晶态晶态转变amorphous crystalline transition对非晶半导体离子注入amorphous implantation非晶半导体 amorphous semiconductor非晶半导体掐amorphous semiconductor device非晶形状态 amorphous state?无定形结构 amorphous structure?信息量 amount of information?放大系数 amplification constant?放大谱线宽 amplification linewidth放大 amplification? 放大屁频带 amplifier band放大齐声 amplifier noise放大级 amplifier stage放大器 amplifier?放大速弟 amplifying klystron放大跃迁 amplifying transition放大管 amplifying tube特高频功率放大管 amplitron幅度校正 amplitude correction?鉴幅器 amplitude discriminator?振幅失真 amplitude distortion?振幅误差校正 amplitude error correction振幅偏移 amplitude excursion振幅频率失真amplitude frequency distortion振幅频率响应amplitude frequencyresponse?限幅歧路 amplitude limiter circuit限幅器 amplitude limiter?爹发射机amplitude modulated transmitter爹甚高频发射机 amplitude modulated vhf transmitter爹监视器 amplitude modulation monitor爹噪声 amplitude modulation noise爹抑制 amplitude modulation suppression爹器 amplitude modulator视频信号振幅 amplitude of videosignal视频信号振幅范围amplitude range of videosignal振幅特性曲线 amplitude response?振幅稳固激光器amplitude stabilized laser 酌距离 amplitude?模拟阵列 analog array模拟集成电路 analog chip模拟运算机 analog computer?模拟数字网络 analog digital network 模拟电子学 analog electronics模拟信息 analog information模拟微电子学 analog microelectronics 模拟灯 analog modulation模拟网络 analog network模拟移相器 analog phase shifter模拟记录 analog recording模拟信号 analog signal?模拟开关 analog switch模拟的 analogue模拟放大器 analogue amplifier模拟计算 analogue computation模拟式乘法运算器 analogue multiplier 分析器 analyzer?与电路 and circuit?与元件 and element或非门 and nor gate 与与操作 and operation与或电路 and or circuit无回声室 anechoic room磨角 angle lap角灯 angle modulation?射束偏转角 angle of beam deflection 发散角 angle of divergence仰角 angle of elevation? 槽倾斜角 angle of groove inclination入射角 angle of incidence?倾斜角 angle of inclination?光入射角 angle of light incidence辐射角 angle of radiation角度数字变换器 angle to digit converter角跟踪 angle tracking倾斜离子注入 angled ion implantation角散布 angular distribution?角分辨率 angular resolution?阴离子互换尸 anion resin阴离子 anion?蛤异性侵蚀 anisotropic etch蛤异性侵蚀断面图anisotropic etch profile蛤异性侵蚀性质anisotropic etchproperty蛤异性侵蚀剂 anisotropic etchant 蛤异性材料 anisotropic material? 蛤异性 anisotropy?退火炉 annealer?退火杂质活化 annealing activation 退火覆盖层 annealing cap热处置 annealing?广播员 announcer环形锯片 annular blade环形接触 annular contact环形锯片切割 annular cutting环状电阻器 annular resistor 环状旋转接头 annular rotary joint 环形锯 annular saw环状裂缝 annular slot阳极特性 anode characteristic阳极暗区 anode dark space阳极检波 anode detection屏极耗散 anode dissipation阳极效率 anode efficiency阳极电解侵蚀 anode etching屏极输出器 anode follower阳辉光 anode glow阳极栅极电容 anode grid capacity 屏极负载 anode load阳极中和 anode neutralization阳极氧化 anode oxidation阳极射线 anode rays屏极检波 anode rectification阳极电阻 anode resistance阳极溅射 anode sputtering?阳极寄生振荡抑制器 anode stopper 阳极电源 anode supply阳极端子 anode terminal阳极电压 anode voltage阳极 anode?阳极的 anodic阳极处置 anodization 异样晶体生长 anomalous crystal growth应答塞绳 answering cord应答装置 answering device应答塞 answering plug天线放大器 antenna amplifier天线电容器 antenna capacitor天线转换开关 antenna change over switch天线接线 antenna connection天线耦合电容器 antenna coupling condenser天线效应 antenna effect天线元件 antenna element天线电动势 antenna emf天线输入阻抗 antenna feed impedance天线场强增益 antenna field gain天线接地开关 antenna grounding switch平均地表面上天线高度 antenna height above average terrain天线引线 antenna lead天线插座 antenna socket天线仰角 antenna tilt防撞雷达 anti collision device消感网络 anti induction network抗氧化层 anti oxidation layer天线收发转换开关 anti transmit receive switch 对阴极 anticathode?预报信号 anticipating signal反符合电路 anticoincidence circuit 抗衰落犬线 antifading antenna抗衰落装置 antifading device反铁电体 antiferroelectric阻厄电路 antihunt circuit抗干扰接收机 antijam receiver抗干扰装置 antijamming unit锑 antimony?抗噪声 antinoise反雷达 antiradar反雷达导弹 antiradar missile反雷达学 antiradiolocation反卫星导弹 antisatellite missile防静电剂 antistatic agent防静电设备 antistatic aids防静电组装 antistatic assembly防静电袋 antistatic bag防静电手套 antistatic gloves防静电掩模底版 antistatic mask blank防静电台 antistatic station防静电表面处置 antistatic surface treatment防静电工具 antistatic tool反斯托克斯线 antistockes line收发开关盒 antitrans mit receive box常压化学汽相淀积 apcvd非党天线 aperiodic antenna非周期电路 aperiodic circuit 张角 aperture angle孔径失真补偿 aperture compensation 孔径耦合 aperture coupling孔径失真 aperture distortion孔径均衡 aperture equalization针孔透镜 aperture lens孔径损失 aperture loss多孔障板 aperture mask孔镜 aperture mirror孔径光阑 aperture stop口径 aperture?外观检查 appearance inspection?苹果彩色显象管 apple tube敷料器 applicator应用全息照相术 applied holography 进场信标 approach beacon进场治理 approach control进场指挥雷达 approach control radar 水清洗器 aqueous cleaner水处置 aqueous processing电弧阴极 arc cathode弧光灯鼓励 arc lamp pumping电弧等离子体 arc plasma弧 arc? 逆弧 arcback构造 architecture?电弧放电 arcing显光管 arcotron区域码 area code面积型成像机 area imager氩激光器 argon laser?氩 argon?运算装置 arithmetical unit?盗丹振荡器 armstrong oscillator 排列 arrangement?阵列 array阵列式芯片 array chip阵列集成电路 array device阵列布图 array layout阵列逻辑 array logic存贮企列 array memory阵列图象形成 array patterning阵列间距 array pitch阵列处置 array processing阵列结构 array structure输入电流 arrival current掺砷发射极 arsenic doped emitter掺砷外延层 arsenic doped epi砷搀杂 arsenic doping涂布的砷溶液 arsenic spin on solution 砷 arsenic? 砷化物 arsenide可听清楚度 articulation?假天线 artificial aerial人工老化 artificial ageing?仿真天线 artificial antenna黑电平测试信号 artificial black signal 仿真延迟线 artificial delay line假回波 artificial echo人造电子眼 artificial electronic eye 仿真全息图 artificial hologram仿置线 artificial line版图检查工具 artwork checking tool原图设计 artwork design图形发生 artwork generation 图形发生器 artwork generator 原图制备刀 artwork knife照相底图 artwork master原图 artwork?超声波水下探测器 asdic长宽比 aspect ratio?微观粗糙度 asperity汇编程序;装配器 assembler组装错误 assembly defect装配图 assembly drawing?装配设备 assembly equipment 装配夹具 assembly fixture? 装配室 assembly room 组装台 assembly station?组装成品率 assembly yield组装 assembly?分派频率 assigned frequency交莲磁 assistating current magnetic biasing相联存储器 associative memory非稳固电路 astable circuit非稳态多谐振荡器 astable multivibrator 像散现象 astigmatism天文电子学 astrionics天体电子学 astronics天体脉泽 astronomical maser天文航海 astronomical navigation非对称振幅灯 asymmetric amplitude modulation不对称边带传送 asymmetric sideband transmission不对称偏转 asymmetrical deflection异先操作 asynchronous operation异步应答方式 asynchronous response mode异步传输 asynchronous transmission切割晶体 at cut crystal at自动测试设备 ate大气模型 atmosphere model 大气 atmosphere?大气吸收带 atmospheric absorption band 大气吸收 atmospheric absorption?大气衰减 atmospheric attenuation大气波导 atmospheric duct大气电场 atmospheric electric field大气波导管 atmospheric guide大气压激光器 atmospheric pressure laser大气透射带 atmospheric transmission band大气透射系数 atmospheric transmittance 大气窗 atmospheric window?大气干扰 atmospherics原子吸收分光光度法 atomic absorption spectrophotometry原子束频率标准 atomic beam frequency standard原子束激光器 atomic beam laser原子钟 atomic clock?原子发射光谱仪 Atomic Emission Spectrometer AES原子频率标准 atomic frequency standard原子氢 atomic hydrogen原子型杂质 atomic impurity原子电离 atomic ionization原子激光器 atomic laser原子谱线宽度 atomic linewidth原子核 atomic nucleus?原子时标准 atomic time standard自动测试系统 ats可达清楚度 attainable resolution衰减常数 attenuation constant? 衰减器 attenuation pad?衰减 attenuation?听觉的 audio声频放大器 audio amplifier伴音载波 audio carrier伴音中心频率 audio center frequency伴音通道 audio channel声频放大 audio frequency amplification 音几回带 audio frequency band音频扼力 audio frequency choke音频发生器 audio frequency generator音几回率计 audio frequency meter音频峰值限幅器 audio frequency peak limiter音频变压器 audio frequency transformer音频电平指示器 audio level indicator音频混频器 audio mixer音频回音装置 audio output unit音频范围 audio range音频信号 audio signal音几回谱 audio spectrum音几回谱分析器 audio spectrum analyzer声道 audio track音频发射机 audio transmitter听力图 audiogram 听力计 audiometer测听技术 audiometry三极检波管 audion检查 audit?听能听能 audition俄歇电子发射 auger electron emission 俄歇电子 auger electron?俄歇微探针 auger microprobe俄歇复合 auger recombination俄歇能谱仪 auger spectrometer俄歇跃迁 auger transition无线电导航有声信标 aural radio range 收听 aural reception伴音发射机 aural transmitter南极光 aurora australis北极光 aurora borealis极光 aurora?故障 autage确认 authentication自动加速 autoacceleration自动补偿器 autocompensator自动操纵 autocontrol?自相关数 autocorrelation?自差接收法 autocyne reception 自搀杂 autodoping自差 autodyne 自拍接收机 autodyne receiver自动标引 autoindexing自动掩模对准器 automask aligner自动设计 automated design?自动应答装置 automatic answering device对照度与亮度自动平稳 automatic balance of contrast and brightness自动黑电平电路 automatic black level circuit自动黑电平操纵 automatic black level control自动查验 automatic check?自动色度蝶 automatic chrominancecontrol自动元件装卸装置 automatic componenthandler自动运算机 automatic computer对照度自动蝶 automatic contrast control自动操纵系统 automatic control system?自动消磁 automatic degaussing自动电话互换机 automatic exchange自动聚焦 automatic focusing自动频率操纵特性 automatic frequency control characteristic自动频率操纵 automatic frequency control?自动增益操纵 automatic gain control自偏压 automatic grid bias自动色地制 automatic hue control自动插入 automatic insertion自动布图技术 automatic layout technique 自动行同步 automatic line phasing直接远程拨号 automatic long distance service自动监视器 automatic monitor自动图象稳固操纵 automatic picture stabilization自动定线器 automatic router自动停机 automatic stop?自动副载波平稳操纵 automatic subcarrier balance control自动电报 automatic telegraphy自动电话互换局 automatic telephone exchange自动电话互换系统 automatic telephone switching system自动发射机 automatic transmitter自动党 automatic tuning自动真空淀积系统 automatic vacuum deposition system自动视频杂波限制器 automatic video noise limiter自动白电平操纵 automatic white control汽车收音机 automobile radio汽车电话 automobile telephone自对准 autoregistration辅助阳极 auxiliary anode辅助栅极 auxiliary grid辅助塞孔 auxiliary jack 辅助存储器 auxiliary memory辅助信号 auxiliary signal备份发射机 auxiliary transmitter可用功率 available power雪崩酌 avalanche action雪崩哗 avalanche breakdown雪崩哗电压 avalanche breakdown voltage雪崩二极管 avalanche diode雪崩注入多层栅金属氧化物半导体 avalanche injection stacked gate mos雪崩电离 avalanche ionization雪崩倍增 avalanche multiplication雪崩倍增系数 avalanche multiplication factor雪崩噪声 avalanche noise雪崩光电探测器 avalanche photodetector雪崩光电二极管 avalanche photodiode雪崩晶体管 avalanche transistor雪崩渡越时刻二极管 avalanche transit time diode雪崩渡越时刻二极管振荡器 avalanche transit time oscillator电子雪崩 avalanche?平均亮度 average brightness平均图象电平 average picture level求平均数 averaging?轴向电子感应加速岂荡 axial betatron oscilations轴向侵蚀不均匀性 axial etch nonuniformity轴向通量分米波超高功率四极管 axial flow resnatron轴向注入 axial injection 轴向引线成形设备 axial lead former 轴心线 axial lead?轴向稳固性 axial stability轴向鼓励激光器 axially excited laser 波导管轴 axis of a waveguide方位角精度 azimuth accuracy方位蝶 azimuth adjustment方位角驱动 azimuth drive方位角仰角指示器 azimuth elevation indicator方位角损失 azimuth loss方位角分辨率 azimuth resolution方位角;方位角 azimuth?方位角群聚 azimuthal bunchingDN A及蛋白质的测序和合成仪-- Sequencers and Synthesizers for DNA and Protein。
Cisco Adaptive wIPS Enhanced Local Mode (ELM) 配置和部
Cisco Adaptive wIPS Enhanced Local Mode (ELM) Configuration and Deployment GuideDocument ID: 113027ContentsIntroductionPrerequisitesRequirementsComponents UsedConventionsELM wIPS Alarm FlowDeployment Considerations for ELMELM vs Dedicated MMOn−Channel and Off−Channel PerformanceELM Across WAN LinksCleanAir IntegrationELM Features and BenefitsELM LicensingConfigure ELM with WCSConfiguration from WLCAttacks Detected in ELMTroubleshoot ELMRelated InformationIntroductionThe Cisco Adaptive Wireless Intrusion Prevention System (wIPS) solution adds the Enhanced Local Mode (ELM) feature, allowing administrators to use their deployed access points (APs) to provide comprehensive protection without the need for a separate overlay network (Figure 1). Prior to ELM and in the traditional Adaptive wIPS deployment, dedicated monitor mode (MM) APs are required to provide PCI Compliance needs or protection from unauthorized security access, penetration, and attacks (Figure 2). ELM effectively provides a comparable offering that eases wireless security implementation while lowering CapEx and OpEx costs. This document only focuses on ELM and does not modify any existing wIPS deployment benefits with MM APs.Figure 1 − Enhanced Local Mode AP DeploymentFigure 2 − Top Wireless Security ThreatsPrerequisitesRequirementsThere are no specific requirements for this document. Components UsedELM Required Components and Minimum Code Versions•Wireless LAN Controller (WLC) − Version 7.0.116.xx or later•APs − Version 7.0.116.xx or later•Wireless Control System (WCS) − Version 7.0.172.xx or later•Mobility Services Engine − Version 7.0.201.xx or laterSupporting WLC PlatformsELM is supported on WLC5508, WLC4400, WLC 2106,WLC2504, WiSM−1, and WiSM−2WLC platforms.Supporting APsELM is supported on 11n APs including 3500, 1250, 1260, 1040, and 1140.The information in this document was created from the devices in a specific lab environment. All of the devices used in this document started with a cleared (default) configuration. If your network is live, make sure that you understand the potential impact of any command.ConventionsRefer to Cisco Technical Tips Conventions for more information on document conventions.ELM wIPS Alarm FlowAttacks are only relevant when they occur on trusted infrastructure APs. The ELM APs will detect and communicate to the controller and correlate with the MSE for reporting with WCS management. Figure 3 provides the alarm flow from an administrator's point of view:1.Attack launched against an infrastructure device ("trusted" AP)2.Detected on ELM AP communicated through CAPWAP to WLC3.Passed transparently to MSE via NMSP4.Logged into wIPS Database on MSE Sent to WCS via SNMP trap5.Displayed at WCSFigure 3 − Threat Detection and Alarm FlowDeployment Considerations for ELMCisco recommends that by enabling ELM on every AP on the network meet most customer security needs when a network overlay and/or costs are part of consideration. ELM primary feature operates effectively for on−channel attacks, without any compromise to the performance on data, voice and video clients, and services.ELM vs Dedicated MMFigure 4 provides a general contrast between the standard deployments of wIPS MM APs and ELM. In review, the typical coverage range for both modes suggests:•Dedicated wIPS MM AP typically covers 15,000−35,000 square feet•Client−serving AP will typically cover from 3,000−5,000 square feetFigure 4 − Overlay of MM vs All ELM APsIn the traditional Adaptive wIPS deployment, Cisco recommends a ratio of 1 MM AP to every 5 local mode APs, which may also vary based on network design and expert guidance for best coverage. By considering ELM, the administrator simply enables the ELM software feature for all of the existing APs, effectively adding MM wIPS operations to local data−serving mode AP while maintaining performance.On−Channel and Off−Channel PerformanceA MM AP utilizes 100% of the radio s time for scanning all channels, as it does not serve any WLAN clients. The primary feature for ELM operates effectively for on−channel attacks, without any compromise to the performance on data, voice and video clients and services. The primary difference is in the local mode varying off−channel scanning; depending on the activity, off−channel scanning provides minimal dwell time to gather enough information available to classify and determine attack. An example may be with voice clients that are associated and where AP s RRM scanning is deferred until the voice client is dis−associated to make sure service is not affected. For this consideration, ELM detection during off−channel is considered best effort. Neighboring ELM APs operating on all, country or DCA channels increases effectiveness, hence the recommendation for enabling ELM on every local mode AP for maximum protection coverage. If the requirement is for dedicated scanning on all channels full−time, the recommendation will be to deploy MM APs.These points review differences of local mode and MM APs:•Local Mode AP − Serves WLAN clients with time slicing off−channel scanning, listens for 50ms on each channel, and features configurable scanning for all/country/DCA channels.Monitor Mode AP − Does not serve WLAN clients, dedicated to scanning only, listens for 1.2s on •each channel, and scans all channels.ELM Across WAN LinksCisco has made great efforts in order to optimize features in challenging scenarios, such as deploying ELM APs across low bandwidth WAN links. The ELM feature involves pre−processing in determining attack signatures at the AP and is optimized to work over slow links. As best practices, it is recommended to test and measure the baseline to validate performance with ELM over WAN.CleanAir IntegrationThe ELM feature highly compliments CleanAir operations with similar performance and benefits to deployment of MM APs with these existing CleanAir spectrum−aware benefits:•Dedicated silicon−level RF intelligence•Spectrum−aware, self−healing, and self−optimizing•Non−standard channel threat and interference detection and mitigation•Non Wi−Fi detection such as Bluetooth, microwave, cordless phones, etc.•Detect and locate RF layer DOS attacks such as RF jammersELM Features and Benefits•Adaptive wIPS scanning in data serving local and H−REAP APsProtection without requiring a separate overlay network••Available as a free SW download for existing wIPS customers•Supports PCI compliance for the wireless LANs•Full 802.11 and non−802.11 attack detection•Adds forensics and reporting capabilities•Integrates with existing CUWM and WLAN management•Flexibility to set integrated or dedicated MM APs•Pre−processing at APs minimize data backhaul (that is, works over very low bandwidth links)•Low impact on the serving dataELM LicensingELM wIPS adds a new license to the ordering:•AIR−LM−WIPS−xx − Cisco ELM wIPS License•AIR−WIPS−AP−xx − Cisco Wireless wIPS LicenseAdditional ELM licensing notes:If wIPS MM AP license SKU(s) are already installed, those licenses can also be used for ELM APs.••wIPS licenses and ELM licenses together count towards the platform license limits for wIPS engine;2000 APs on 3310, and 3000 APs on 335x, respectively.•The evaluation license will include 10 APs for wIPS and 10 for ELM for a period of up to 60 days.Prior to ELM, the evaluation license allowed up to 20 wIPS MM APs. Minimum requirement ofsoftware versions supporting ELM must be met.Configure ELM with WCSFigure 5 − Using WCS to Configure ELMFrom WCS, disable both 802.11b/g and 802.11a radios of the AP before enabling E nhanced wIPS Engine.Note: All associated clients will be disconnected, and will not join until the radios are enabled.1. Configure one AP, or use a WCS configuration template for multiple lightweight APs. See Figure 6.Figure 6 − Enable Enhanced wIPS Engine (ELM) sub mode2. Choose Enhanced wIPS Engine , and click Save .Enabling Enhanced wIPS Engine will not cause the AP to reboot.a. H−REAP is supported; enable the same way as for local mode AP.b. Note: If either of the radios of this AP is enabled, WCS will ignore the configuration and throw the error in Figure 7.Figure 7 − WCS Reminder to Disable AP Radios before Enabling ELM3. Configuration success can be verified by observing the change in AP Mode from L ocal orH−REAP to Local/wIPS or H−REAP/wIPS . See Figure 8.Figure 8 − WCS Displaying AP Mode to Include wIPS with Local and/or H−REAP4.Enable the radios that where disabled in Step 1.5. Create the wIPS profile and push it to the controller in order for the configuration to complete.Note: For complete configuration information on wIPS, refer to the Cisco Adaptive wIPSDeployment Guide.6. Configuration from WLCFigure 9 − Configure ELM with WLCChoose an AP from the Wireless tab.Figure 10 − WLC Changing AP sub mode to Include wIPS ELM1.2.From the AP Sub Mode drop−down menu, choose wIPS (Figure 10).3.Apply, and then save the configuration.Note: For ELM functionality to work, MSE and WCS are required with wIPS licensing. Changing the AP sub mode from WLC alone will not enable ELM.Attacks Detected in ELMTable 1 − wIPS Signatures Support MatrixAttacks DetectedELM MMDoS Attack Against APAssociation FloodY YAssociation Table OverflowY YAuthentication FloodY YEAPOL−Start attackY YPS−Poll floodY YProbe request floodN YUnauthenticated associationY YDoS Attack Against InfrastructureCTS floodN YQueensland University of Technology ExploitN YRF jammingY YRTS floodN YVirtual Carrier attackN YDoS Attack Against StationAuthentication−failure attackY YBlock ACK floodN YDe−Auth broadcast floodY YDe−Auth floodY YDis−Assoc broadcast floodY YDis−Assoc floodY YEAPOL−Logoff attackY YFATA−Jack toolY Y Premature EAP−FailureY Y Premature EAP−SuccessY YSecurity Penetration AttacksASLEAP tool detectedY YAirsnarf attackN Y ChopChop attackY YDay−Zero attack by WLAN security anomalyN YDay−Zero attack by device security anomalyN YDevice probing for APsY Y Dictionary attack on EAP methodsY YEAP attack against 802.1x authenticationY YFake APs detectedY YFake DHCP server detectedN YFAST WEP crack tool detectedY Y Fragmentation attackY Y Honeypot AP detectedY Y Hotspotter tool detectedN Y Improper broadcast framesN Y Malformed 802.11 packets detectedY YMan in the middle attackY Y Netstumbler detectedY Y Netstumbler victim detectedY YPSPF violation detectedY YSoft AP or host AP detectedY YSpoofed MAC address detectedY Y Suspicious after−hours traffic detectedY Y Unauthorized association by vendor listN Y Unauthorized association detectedY Y Wellenreiter detectedY YNote: Adding CleanAir will also enable detection of non−802.11 attacks. Figure 11 − WCS wIPS Profile Viewshow alarm list − Issue inside the wIPS console. This command is used to list the alarmscurrently contained within the wIPS service database. The key field is the unique hash keyassigned to the specific alarm. The Type field is the type of alarm. This chart in Figure 13shows a list of alarm IDs and descriptions:Figure 13 − MSE CLI show alarm list CommandwIPS>show alarm listKey Type Src MACLastTime Active First Time−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−89 89 00:00:00:00:00:00 2008/09/0418:19:26 2008/09/07 02:16:58 165631 95 00:00:00:00:00:00 2008/09/0417:18:31 2008/09/04 17:18:31 0198****9900:1A:1E:80:5C:402008/09/0418:19:44 2008/09/04 18:19:44 0The First Time and Last Time fields signify the timestamps when the alarm was detected;these are stored in UTC time. The Active field highlights if the alarm is currently detected.♦ Clear the MSE Database.If you run into a situation where the MSE database is corrupt, or no other troubleshootingmethods will work, it may be best to clear the database and start over.Figure 14 − MSE services Command1. /etc/init.d/msed stop2. Remove the database using the command 'rm/opt/mse/locserver/db/linux/server−eng.db'3. /etc/init.d/msed start♦ • Related InformationCisco Wireless LAN Controller Configuration Guide, Release 7.0.116.0• Cisco Wireless Control System Configuration Guide, Release 7.0.172.0• Technical Support & Documentation − Cisco Systems• Contacts & Feedback | Help | Site Map© 2014 − 2015 Cisco Systems, Inc. All rights reserved. Terms & Conditions | Privacy Statement | Cookie Policy | Trademarks of Cisco Systems, Inc.Updated: Jan 14, 2015Document ID: 113027。
Adaptable
Stud.Cercet.Stiint., Ser.Mat., 16 (2006), SupplementProceedings of ICMI 45, Bacau, Sept.18-20, 2006, pp. 601-616Adaptable processors for knowledge based systemsDumitru TodoroiAbstractAutomatic creation of the first level of adaptable processors is demonstrated. These adaptable processors form the basis of adaptable software and hardware. The first level of adaptable processors forms the basis of industry of adaptable hardware and software tools for Knowledge-Based Society (KBS).The second level of translation complexity adaptable processors present the combinations of the first level of adaptable processors. They are obtained on the basis of extensions Time-Realization methods, Model-Realization methods, and on the basis of adaptable Type-Translation methods. It is demonstrated how to automatically obtain the second level adaptable processors of the Time-Model-Realization type of extensions processing.It is created and algorithmically proved the possibility to obtain automatically the Adaptability Cube’ third level’s of adaptable processors. Using three types of the first level’s adaptable processors and the three types of the second level’s adaptable processors there are obtained the adaptable Processors-Compilersof the third level of translation complexity. These results represent the logic continuation of the results, presented in the communication, concerning the processof automatically obtaining the second levels of translation complexity adaptable processors, and the communication concerning the first level of adaptable processors.1. IntroductionResearch results [ZTod-05, Mic-05] are concerned with the development and implementation of the formal natural language processing adaptable programming tools [Tod-92, Tod-98, DTod-04]. Such tools [Tod-02, Mic-02] will be used in the processes of creation, developing, application, and maintenance of the formal natural language processing computerized Human-Human, Human-Machine, and Machine-Machine intellectual adaptable & environmental interactions. The results, obtained in the process of presented research results, can be put on the basis of initiation of new branch of Hardware and Software industry.Development of the adaptable languages’ and processors’ informational technologies Basis, using the adaptability methods, models, procedures, and algorithms is based on the notion of adaptors.Adaptors are the601meta-linguistics and meta-processors tools which support the flexibility (extension and reduction) of the languages and processors. The general scheme of the Adaptor is presented in Fig. 1.Adaptable language Adaptable processorNew data New actionsExtension definition Extension callFig. 1. ADAPTOR interactions’ scheme.The Adaptors’ component parts support both the process of adaptationof the Adaptable Languages and of the Adaptable Processors as componentparts of Adaptable Systems. Each ADAPTOR is represented by the corresponding EXTENDER and REDUCTOR. The Adaptors permit to define, modify, and use derived Data’, Operations’, Instructions’, and Controls’ elements. This process begins with the Base Adaptable System using the Extension’ representatives of Adaptors. The Reduction’ representatives of Adaptors permit to define and use derived elements of Adaptable Systems beginning with the Developed Adaptable Systems. In both cases Adaptorspermit to obtain special and universal Formal Natural Language Processing Adaptable Systems for Human-Human, Machine-Machine, and Human-Machine computerized Communications of the near future Society.The adaptors are represented in both elementary and composed forms.Each Adaptor is composed from the pragmatic, syntactic, semantic, examples,and environment parts. The linguistic definition general scheme of the Adaptoris presented by Fig. 2._BL_ <element’ pragmatics>_SY_ <element’ syntax>_SE _ <element’ semantics>_CO_ <context of element’ usage>_EX_ <element’ examples call>_EL_Fig. 2. The Adaptor’s component parts.2. Language extensions2.1. Data extensions602603The new data <vector> will be semantically expressed by a lower-level element <ARRAY>. The operational way of defining the data-extension element <vector> is using the following:1. non-terminal notions: <type>, <identif>, <lv> (low-value), <hv> (high-value);2. meta-linguistic symbols: -DBL - , -DSY - , -DES - , -DEX -, -DEL -, -AS -;3. terminal elements: B, C, 10, 1, 200, ARRAY, [, ], -, :, <, >.In this new environment, the new data <vector> is defined using the data adapter-extender as it follows: -DBL - <vector> -DCO - -AS - <type> -DSY - <identif> : VECTOR [<lv>:<hv>] -DSE - ARRAY <identif> [<lv>:<hv>] -DEX - B: VECTOR [-10:10]C: VECTOR [1:200] -DEL -This “i+1”-level element is defined using lower-level elements. Its environment is the same as the environment of other data <type>.2.2. Operation extensionsThe summing operation <sum vector>: that sums two arrays is defined as it follows. The operational environment supposes that are known:1. the sum operation “+”;2. the notions <identif1> and <identif2>;3. the assignment, and the control statements;4. Length function;5. meta-terminals: -OBL -, -OCO -, -AS -, -OSY -, -OSE -, -OEX - , -OEL -;6. terminals: A, M, 1, k, x, y, P, Q, VECTOR, CYCLE, FROM, TO, BYSTEP, DO, ENDCYCLE, RESULT, <, >, [,], (,), +,:, ;, :=, =.In this new environment, the new operation <sum vector> is defined using the operation adapter-extender as it follows: -OBL - <sum vector> -OCO - -AS --OSY --OSE - k : VECTOR [1:A];CYCLE M FROM 1 TO A BYSTEP 1 DOk[M]:= <identif1> [M]+ <identif2 > [M];ENDCYCLE;RESULT k: VECTOR; -OEX - y604P Q-OEL -It is supposed that the <identif1> and <identif2> arrays have the same number of elements.2.3. Statements extensionsTo define a new statement <Lin-Frânt ă>, it is needed the following operational environment:1. array data;2. point, segment and declaration statements;3. Length function;4. Integer type;5. meta-delimiters: -SBL -, -SCO -, -AS -, -SSY -, -SSE -, -SEX -, -SEL - , –KIND -;6. terminal elements: POINT, CYCLE, FROM, TO, BYSTEP, DO, SEGMENT, END -CYCLE, [,], (,), <, >, :, ;, x, y, M, 1, 2, 3, T, S, ARRAY, k, kx, ky, kTX, kTY, P.In this new environment, the new statement <Lin-frânt ă> is defined using the statement adapter-extender as it follows: -SBL - <Lin-frânt ă> -SCO - -AS - <point>, <cycle>, <segment> -SSY - -KIND -:1: BROKEN -LINE (x, y);-KIND - :2: BROKEN -LINE (x: ARRAY [1:H], y: ARRAY[1:H]);-KIND - :3: BROKEN -LINE (x, y: ARRAY; H: INTEGER); -SSE - -KIND -:1: H:= Length (x);-KIND -:1,2,3: POINT (x[1], y[1]);CYCLE k FROM 2 TO H BY STEP 1 DOSEGMENT (x[k], y[k]);END -CYCLE -SEX - BROKEN -LINE (T,S);BROKEN -LINE (kx: ARRAY [1:k], ky:ARRAY [1:k])BROKEN -LINE (kTX, kTY: ARRAY; P:INTEGER) -SEL -It is supposed that the pairs of arrays {x, y}, {T, S}, {kTX, kTY} have the same number of elements.2.4. Cycles extensionsThe operational method of defining the extension-element supposes that the following elements exist:1. Sign function;2. expressions <ep>, <ae1>, <ae2>, <ae3>, <exp2>;6053. statement <statement>, <conditional>,<transfer>, composed, assignment;4. meta-terminals: -CBL -, -CCO -, -AS -, -CSY -, -CSE -, -CEX -, -CEL -, –KIND -;5. terminals: : [,], (,), <,>, +, -, *, :, :=, ≤, 1, 2, H, K, P, M1, M2, S, A, I, C, D, I, SIGH, WHILE, DO, FOR, TO, BY -STEP, IF, THEN, GOTO, BEGIN, END.In this new environment, the new extension <cycle> is defined using the control adapter-extender as it follows: -CBL - <cycle> -CCO - -AS - <statement> -CSY - -KIND -:1: WHILE <exp2> DO <statement>;-KIND - :2: FOR <ep>:= <ae1> TO <ae2> BY -STEP <ae3>DO <statement>; -CSE - -KIND - :1:M1: IF <exp2> THEN BEGIN <statement>; GOTO M1 END; GOTO M3;-KIND - :2:<ep>:= <ae1>;M2: IF (<ep>-<ae2>)* SIGN (<ae2>)≤0 THENBEGIN <statement>; <ep>:=<ep> + <ae3>; GOTOM2 END;M3: ; -CEX - WHILE H<K DO BEGIN S:= S+A[H]; H:=H+P; END;FOR I:=1 TO H BY -STEP 2 DOBEGIN C:= C + A[I]; D:= D + A [I+1] END; -CEL -This new extension is defined in two forms: WHILE-DO and FOR-DO. Their semantics is defined using the lower-level elements: IF-THEN, GOTO, assignment statement and the composed statement BEGIN-END.3. Adaptable languages’ and processors’ system Basis and its sub-systemsDevelopment of the Earley-Todoroi-Micusa (E-T-M) formalism [Mic-02] for adaptable translation interactions, analysis and discussion of its possibility to be implemented in construction and algorithmic proving of automatically creation of adaptable processors of the first, second, and third levels of translation complexity will be done.Evaluation of the Adaptable systems’ Basis and its sub-systems is represented by the DEFINITION, FIXATION, CALLING, and REDUCTION Adaptable sub-systems. The DEFINITION sub-system implements theextension definition. The FIXATION sub-system fixates the extension definition in the Adaptable system. The CALLING sub-system implements the extension call in the Adaptable system. The REDUCTION sub-system creates the individual Adaptable system.The present communication contains results in the development of methods of evaluation of the extensions in definition, fixation, calling, and reduction phases of its existence. These phases are supported and represented by the corresponding definition, fixation, calling, and reduction sub-systems of Adaptable systems’ Basis. This Basis will form the main part of each of the Adaptable Processors. The Adaptable systems’ Basis is represented by the extensible libraries of translation modules, methods, algorithms, and procedures, which will be created on the base of modular programming translation development technology.4. Process of automatically creation of the first level of adaptable processorsAlgorithmic demonstration of lemmas of automatically creation of the first level’s Adaptable Environmental Processors will be done. Discussion about the possibility to be implemented the first level’s Adaptable Processors in the base software and hardware of information technologies development industrial branch will be done.4. 1. Basic level of adaptable processors of extensions’ Layer-Realization typeWe use E-T-M formalisms in order to demonstrate translation interactions with the basic (first) level of translation complexity layer-extension’s realization methods of adaptable processing. The basic (first) level of translation complexity layer-extension’s realization methods of adaptable processing are represented by the Layer-Type adaptable processors, of Time-Type adaptable processors, and of Translation-Type adaptable processors.Processors of extensions’ Layer-Realization type are represented by means of adaptable processors of Level- Level, Level –Direct, and Level - Level -Direct types. Adaptable processors of Level - Level type realize the extensions using « lowering » model from one level of programming adaptable language (LAP) to another until the base level of adaptable programming language is reached (BLAP).Adaptable processors of Level -Direct type « lower » extensions-elements from the source program in LAP. Thus they are directly transformed into a program written in BLAP language.Adaptable processors of Level - Level -Direct type are based on processing translating modules of Level - Level and Level -Direct type.606By means of E-T-M formalisms [4] of adaptable processors translation interactions are demonstrated affirmations-lemmas of automatic creation of Level - Level, Level –Direct, and of Level - Level –Direct types of adaptable processors.These types of adaptable processors forms atomic processing base ofFigure 3. Adaptability cube4. 1.1. Adaptable processors of Level-Level (L-L) typeUsing E-T-M formalism it is represented general scheme of L-L type of(1)In the scheme (1) the program in adaptable language is presented by …Source program, level i”, processor of level-level type is presented by the processor …L-L”, and …Research” defines if the result of translation still contains extensions (Yes/No). As a result it is obtained …Object program in base language”.This L-L processor is presented by a row of extension’s definitions (processors) of the following type (2):607608where i = 0,1,2,...,p-1 (p-number of levels of LAP: adaptable programming language)One of these processors (2) of level-level type translates superior level extensions (i+1) from the (source) adaptable program f, written in LAP: adaptable programming language as a result obtaining the same program f with extensions but only of level i. This L-L processor is written by means of elements of adaptable language of level i. This processor’s work is presentedTherefore in case we have a machine with programming language LEi, then using this adaptable processor-compiler (3), the program f in LEi+1language is transforming in corresponding program f in programming language LEi. Actually this translator is based on a set of definitions of extensions of i+1 level (2) written on the base of programming language of level i (LEi).It is possible to demonstrate the process of obtaining the set of processors (2) using T formalism for translation interactions (Lemma L-L).obtain the following set of processors (4):, where LE i+1 and LE i are the adaptablelanguages of levels i+1 and i, LE 0 is base language and LM-machine language.Proof.First iteration:As a result we have obtained a set (4) of translators-processors of level-level type, which was to be proved.4. 1.2. Adaptable processors of Level-Direct (L-D) typeGeneral scheme of this type of processor is the following:Using this type of adaptable processors any “Source program” in programming adaptable language is translated into an “Object program in base language”.610in order to automatic obtain the following set of adaptable processors (9) of level-direct (L-D) type:where LEi+1 and LEi are adaptable languages of i+1 and i levels, LE 0 is base language, and LM-machine language.4.1.3. Adaptable processors of Level-Level-Direct (L-L-D) typeGeneral schema of this processor type is the following:By means of adaptable processors of L-L type adaptable source program “goes lower” using the level-level translation method until obtaining “object program” in the adaptable language of (intermediary) level j. At the second stage this program is transformed into “object program in base language” using adaptable processors of L-D type.adaptable processorj, j+1,…,p, p-number of levels of adaptable programming language and j>=0) and a set (8) of extensions (i=j-1,j-2,...,0) in order to automatic obtain a set (4) of adaptable processors of L-L type and a set (9) of adaptable processors of L-D type. These two sets (4) and (9) form the necessary set of adaptable processors of L-L-D type.Proof: It is sufficient to use Lemma L-L in order to obtain a row (4) of adaptable L-L Processors written in the machine language LM and further on, Lemma L-D to obtain the adaptable L-D Processors set (9) written in machine language LM. These two sets (4) and (9) form the necessary set of adaptable processors of L-L-D type.Correlation L-L-D: It can be demonstrated that, using Lemma L-L, Lemma L-D and Correlation L-D it can be obtained the set (4) of adaptable processors of L-L type and the set (9) of adaptable processors of L-D type, that together form the set (14) of adaptable processors of L-L-D type:where i=p-1,p-2,...,j, j>=0, p- number of levels of adaptable programming language, for this is sufficient to write only a set (2) of extensions.5. Second complexity degree adaptable processorsOn the basis of translation interactions of the first level of adaptable ambient intelligence processors are obtained [ZTod-03,05] the first ELIM-PTIM types (Table 1), the second ETIM-PTIM types (Table 2), and the third ELIM-ETIM types of second level of adaptable ambient intelligence processors (Table 3).Table 1. The second level of ELIM-PTIM types of adaptable ambientintelligence processors.E-L-I-M \P-T-I-M Level-To-Levelmethod (L - L)Level-To-Basemethod(L - D)Level-Level-Direct method(L – L – D )Adaptable Compilation L-L AdaptableCompilerL-D AdaptableCompilerL-L-DadaptableCompilerAdaptable Interpretation L-L AdaptableInterpreterL-D AdaptableInterpreterL-L-DadaptableInterpreterAdaptable Compilation – Interpretation L-L AdaptableCompiler-InterpreterL-D AdaptableCompiler-InterpreterL-L-DadaptableCompiler-Interpreter611Table 2. The second level of ETIM-PTIM types of adaptable ambientintelligence processors.E-T-I-M \P-T-I-M Pre-processingmethodInter-processingmethodPost-processingmethodAdaptable Compilation Pre-processor-CompilerInter-processor-CompilerPost-processor-CompilerAdaptable Interpretation Pre-processor-InterpreterInter-processor-InterpreterPost-processor-InterpreterAdaptable Compilation – Interpretation Pre-processor-Compiler-InterpreterInter-processor-Compiler-InterpreterPost-processor-Compiler-InterpreterTable 3. The second level of ETIM-ELIM types of adaptable ambientintelligence processors.E-L-I-M \E-T-I-M Level-To-Levelmethod (L - L)Level-To-Base method(L - D)Level-Level-Direct method(L – L – D )Pre-processing method L-L–Pre-processorL-D–Pre-processorL-L–D-Pre-processorInter-processing method L-L-Inter-processorL-D-Inter-processorL-L-D-Inter-processorPost-processing method L-L-Post-processorL-D-Post-processorL-L-D-Post-processor5.1. L-L-Pre-processorsThe L-L-pre-processors realize the extensions from the Adaptable Programming Language (LAP) source program before the realization of the Base Adaptable Programming Language (BAPL) object program elements using Pre-processing realization methods. In this process the extensions are realized by the L-L method of extensions realization. Such combinations of these two methods create the new L-L-Pre-processors type of extensions realization as in Fig. 1, presented using E-T-M formalism of adaptable processors translation interactions:Theorem L-L-Pre-processor: If it done the basis initial adaptable processor (1)612it is sufficient to create the next set of language extensions (2)(for i=1,2,..., p-1, where p is the number of LAP levels of extensions) to obtain the set (3) of Adaptable L-L-Pre-processors - component parts of the Adaptable L-L-Pre-processorIn (1) the LE0 is used for LBAP and LM is for machine language. Proof: The Theorem of proving the automatically obtaining process of the Adaptable L-L-Pre-processor is demonstrated on the basis of Lemma L-L [DTod-03]. This Theorem is demonstrated using the E-T-M formalism for adaptable translation iterations. The Source adaptable programming language program in LAP is layer-layering to the base adaptable programming language Object program in BLAP.6.Third level adaptable preprocessor-L-L-compilerThe Adaptable Third level Preprocessor-N-N-Compiler implement the program f in the Adaptable Programming Language LAP, utilizing the Level-Level method of extension processing, the Pre-processing type of extension processing, and the Adaptable Compilation type of translation:As the result of this Adaptable Processor activity is obtained the object program f in the Base Adaptable Programming Language LBAP.613614Theorem Preprocessor-L-L-compiler : It is sufficient to create the next set of language extensions (1)(for i=0,1,2,..., p-1, where p is the number of LAP levels of extensions) to obtain the set (2) of Adaptable L-L-Preprocessors – component parts of the Adaptable Preprocessor-L-L-Compiler –if it done the basis initial adaptable compiler (3)In (3) the LE0 is used for LBAP and LM- for machine language. Proof : The Theorem of proving to automatically obtaining such Adaptable Preprocessor-L-L-Compiler is demonstrated on the basis of Lemma L-L[DTod-03] and the Theorem Preprocessor-L-L from the [ZTod-03]. In underlined lemma and theorem at the final part LAP is replaced by Source Program and LM is replaced by Object Program. This Theorem is demonstrated using the E-T-M formalism for adaptable translation iteration. Analogically are demonstrated eight other theorems with Third level of translation complexity Adaptable Processors-Compilers.7. ConclusionsThe first part of the paper develops the extensions’ realization technology from the point of view of (1) the extensions’ Time implementation methods (E-T-I-M), (2) the extensions’ Level implementation methods (E-L-I-M), and (3) the Processors’ Type Implementation Methods (P-T-I-M). It is demonstrated the possibility to evaluate the first level’s Adaptable Processors on the base of developed E-T-M formalisms for translation iterations. The creation of the Second level’s [Tod-03] and the Third level’s [Mic-03] of Adaptable Processors are demonstrated in [Tod-03, Mic-03]. Discussion about the possibility to be industrially implemented the Adaptable Environmental Processors of the first, second, and third levels oftranslation complexity in the software and hardware branch of informational technologies development industrial branch is too important. Analysis of the possibility to implement the Formal Natural Language Processing Adaptable Programming Tools [Tod-01,02, Mic-02] in the Interdisciplinary Fundamental Scientific Economic undergraduate and postgraduate institutional and universities courses comprise one more interests in this direction of research and implementation.References[Pun-05] Punie, Y., Delaitre, S., Maghiros, I. & Wright, D. (eds.) - Safeguards in a World of Ambient Intelligence (SWAMI). Dark scenarios on ambient intelligence: Highlighting risks and vulnerabilities. In SWAMI Deliverable D2. A report of the SWAMI consortium to the European Commission under contract 006507, November 2005. http://swami.jrc.es[Rod-04] Rodden, T.; Crabtree, A.; Hemmings, T. et al. - Configuring the ubiquitous home. In Darses, F.; Dieng, R. et al. (Eds.): “Cooperative Systems Design: Scenario-Based Design of Collaborative Systems”. Amsterdam: IOS Press, pp. 227-241.[Tod-05] Todoroi D. - The Theoretical Bases of the first level of Adaptable Processors creation. In Proc. Of The 30th Annual Congress of the ARA, Central Publ. House, Chişinău, 2005, p. 178-181.[ZTod-05] Todoroi, Z. - Some results of the second level of adaptable processors’ construction. In Proc. Of The 30th Annual Congress of the ARA, Central Publ. House, Chişinău, 2005, p. 182-184.[Mic-05] Micusha D. - . Adaptable processors-compilers creation theory : the third level. In Proc. Of The 30th Annual Congress of the ARA, Central Publ. House, Chişinău, 2005, p. 185-187.[DTod-04] Todoroi D., Todoroi Z., Micusa D. - Adaptable processors-compilers’ construction and automation. In Proc. of the 29th Annual Congress of the ARA of Sciences and Arts (ARA), Bochum, Germany, September 7-12, 2004, p. 499-504.[DTod-03]. Todoroi, D. - The Model Type of Extensions Realization of the Adaptability Cube’ First Level of Translation Complexity’ Adaptable Processors. The Sixth International Conference on Economic Informatics IE’03, Romania, Bucharest, May 8-11, 2003, p.113-121.[ZTod-03]. Todoroi Z. - The Second Level Adaptable Processors of the Extensible Time-Models Realization. The Sixth International Conference on Economic Informatics IE’03, Romania, Bucharest, May 8-11, 2003, p. 343-348.[Mic-03]. Micuşa D. - The Adaptability Cube ‘Third Level of Translation Complexity’ Adaptable Processors-Compilers. The Sixth International615Conference on Economic Informatics IE’03, Romania, Bucharest, May 8-11, 2003, p. 93-99.[Tod-02]. Todoroi, D., Todoroi Z. - The Romanian Information Language Multimedia Dictionaries for European Community. Proc. of International Conf. “Globalization and University’ Economics Education”, Vol.2, Iasi, October 24-25, 2002, p. 233-250.[Mic-02]. Micusa, D., Jucan, T., Todoroi D. - The E-T-M formalism for NLP Adaptable Processors’ Interactions. Proc. of International Conf. “Globalization and University’ Economics Education”, Vol.2, Iasi, October 24-25, 2002, p. 200-218.[Tod-01]. Todoroi, D., Todoroi, Z., Micusa, D. - Natural Language Processing based on Computerized Romanian Language. Proc. of International Conf. “E-Business. Theory and Practice”, ASEM, 2001, Chisinau, p.361-368.[Tod-00] Todoroi, D., Nazem, S., Jucan, T., Micusha D. - Future is Past multiplied by the Present: Software development by the Transition to a Full Information Society. Acta Academia, 2000, Chisinau: Evrica, - pp 53-62.[Tod-99] Todoroi, D., Hille, S. J., Mulder, M., Jucan, T., Micusha D., Bernier, R., El-Rewini, H. - The Full Information Society Initial Development Peri od. Acta Academia, 1999, Chisinau: Evrica, -pp 16-28.[Tod-98] Todoroi, D., Nazem, S., Jucan, T., Micusha D. - Transition to a Full Information Society: Stage Development. Working Paper No. 98-2, March,1998, UNO, College of Business Administration, Omaha, Nebraska, USA, - 38 p.[Den-97] Beyond Calculation: The Next Fifty Years of Computing. Edited by Peter J. Denning and Bob Metcalfe, Copernicus, 1997 Springer-Verlag New York, Inc., 350 p.[IFI-94]. Proceedings of the IFIP’94 Congress. Vol 1, 2, 3. Munich, Germany, 1994. – 1347 p.[Tod-92]. Todoroi, D. - Computer Science. The Adaptable Programming. The Basis Conceptions. Ed: ASEM, Chishinau, 1992. - 76 p.[Fif-88]. Fifth Generation Computer Systems 1988. In Proceedings of the International Conference on Fifth Generation Computer Systems 1988. Edited by Institute for New Generation Computer Technology (ICOT). Vol 1, 2. OHM-Springer-Verlag. 1988. - 815 p.[Ers-84]. Ersov. A. P. - The Soviet fifth Generation Computers Project. Science, AS, Novosibirsk Branch, 1984. – 47 p.[Ear-70]. Earley T. and Co. - The formalism for translation interactions. Comm. ACM, 13, 2 (Feb. 1970), pp. 70-81.Academy of Economic Studies of Moldova,e-mail: todoroi@ase.md616。
ADAPTEC++RAID卡使用说明
ADAPTEC RAID卡使用说明Adaptec 160 RAID卡的配置基本相同，此文以Adaptec 2110S RAID卡（Adaptec 160单通道RAID 卡），和Adaptec2200S RAID卡（Adaptec320双通道RAID卡）为例，进行配置说明。
其他Adaptec RAID 卡的配置可以参考此文。
1 硬件安装正确安装RAID卡，请注意有关板、卡安装方法及规则。
将SCSI盘连接在RAID卡的SCSI口上，请注意有关SCSI设备安装方法及规则。
2 初始化RAID卡在完成相关硬件的安装后，打开服务器电源，系统自检待屏幕出现以下提示：Adaptec I2O BIOS V001.41(2001/07/13)Copyright Adaptec Inc.1996-2001 All Rights ReservedHit <CTRL+A> for Adaptec Setup ,Waiting for devices按<CTRL+A>出现Please Wait….Adaptec Setup Utility Will be involed after post3配置RAID卡3.1 Adaptec 2110S RAID卡启动计算机，BIOS显示RAID卡信息，依据信息中的提示按〈CTRL+A〉进入配置RAID卡工具界面如图1所示。
图1按上下箭头键移动亮条至2110S，按回车，进入图2所示的显示RAID卡所连硬盘信息界面。
图23.1.1创建RAID按ALT+R进入配置RAID工具菜单,移动上下箭头键选中Creat功能菜单条进入图3所示的配置界面。
图3在图3中按ENTER键后出现RAID级别,如图4所示.图4在图4中利用TAB键将光标移至OK后回车,进入图5所示的界面.图5图5中显示了RAID卡所连接的硬盘的数量和信息,用户可根据需要利用空格键选择所需硬盘，当选种所需硬盘后进入图6所示的界面.在图6中按TAB键选中Done 后回车,进入图7图7图7中显示RAID已配置完成。
索尼HDR-XR100 80GB HDD高清摄像机说明书
The Sony® HDR-XR100 Handycam® camcorder records stunning, 1920 x 1080 high definition video and crystalclear still photos to a built-in 80GB hard disk drive. Building on the convenience of Face Detection technology, the HDR-XR100 features Smile Shutter™ technology, which can automatically detect smiles and shoot still images, even while recording video.11920 x 1080 high definition video recording:1920 x1080 high definition resolution lets you record your memories inexceptional Sony® Full High Definition quality .2 4 megapixel still image capture:4 megapixel still image capture lets you take high resolution digital photos.80GB hard disk drive:A built-in 80GB hard disk drive can record and store up to almost 32 hours of high definition video footage (HD LP mode), or up to almost 56 hours of standard definition footage(SD LP mode). In addition, “HDD SmartProtection” gives you peace of mind by helping to prevent any recorded video and images from being lost if the camcorder is accidentally dropped.1 Face Detection technology for Video Footage and Digital Still Photos:Made possible by the BIONZ™ image processing engine, Face Detection technology recognizes up to 8 faces anywhere in the frame and by selecting the most prominent, automatically controls focus, exposure, and color to help capture smiling faces brightly and clearly. Face Detection technology also helps make skin tones look natural without affecting other colors in the image. On AVCHD models, thecamcorder allocates encoding bits on detected face areas prior to encoding other parts of the picture, making them sharper and clearer. In still picturemode, Face Detection technology sets the flash level to optimize picture clarity.Smile Shutter™ technology for still and dual capture:Smile Shutter™ technology lets the camcorder automatically take still photos when your subject smiles, even while shooting high definition video. You can also set the sensitivity and choose child, adult, or auto priority.SteadyShot™ image stabilization: SteadyShot™ image stabilizationreduces blur caused by camera shake and vibration, so your images stay crisp and clear.2.7” wide touch panel Clear Photo LCD Plus™ display:2.7” wide (16:9) touch panel Clear Photo LCD Plus™ display providesexcellent viewing clarity with improved resolution (211K pixels). The display rotates up to 270 degrees for multiple viewing angles, as well as provides sharp, detailed images for monitoring or playback. The convenient touch panel allows easy access to menus and additional functionality such as spot focus and spot metering.3 3 Power On by opening LCD display:Power on your camcorder by simply opening the LCD display.Professional-quality Carl Zeiss® Vario-Tessar® LensCarl Zeiss® Vario-Tessar® lenses use highly advanced optics to deliver vivid image brilliance, true-to-life color saturation, and perfect renditions of subtle tones.10X Optical / 120X Digital Zoom:10X optical zoom helps to bring the action close up from far away. In addition, Digital Zoom Interpolation means that digital zooming (up to120X) is clearer, with less distortion than previous types of digital zoom.ADDITIONAL FEATURES1/5” Exmor™ CMOS sensor with ClearVid™ arrayDolby® Digital 5.1ch recording with Built-in Zoom Mic:Dual Record with 2.3MP still image capture:Includes Sony® PMB (Picture Motion Browser) software:Smooth Slow Record:x.v. Color™ technology for superior color:HDMI™ connection output: USB 2.0 interface:Sony Electronics Inc. • 16530 Via Esprillo • S an Diego, CA 92127 • 1.800.222.7669 • w Last Updated: 02/16/20091. 80GB available. Storage capacity may vary. A portion of the memory is used for data management functions.2. This camcorder captures high definition footage in the AVCHD format. DVD media containing AVCHD footage should not be used with DVD based players or recorders, as the DVDplayer/recorder may fail to eject the media and may erase its contents without warning. DVD media containing AVCHD footage must only be played back on a compatible Blu-ray Disc devices, PC with supplied software or PLAYSTATION®3 devices. 3. Viewable area measured diagonally.9. Requires Microsoft Windows XP SP3/ Windows Vista SP1. Not supported by Mac OS. 10. Smooth Slow Record captures 3 seconds of video which play back over 12 seconds.© 2008 Sony Electronics Inc. All rights reserved. Reproduction in whole or in part without written permission is prohibited. Sony, Handycam, Optical SteadyShot, BIONZ, Clear Photo LCD Plus, Smile Shutter, AVCHD, ClearVid, x.v. Color, BRAVIA, Exmor, Memory Stick Duo and the Memory Stick logo are trademarks of Sony. Microsoft, Windows, and Windows Vista are trademarks of MicrosoftCorporation. Blu-ray Disc and it’s logo are trademarks. PLAYSTATION is a registered trademark of Sony Computer Entertainment. Dolby is a registered trademark of Dolby Laboratories. All other trademarks are trademarks of their respective owners.*Logo mentions need to be included if logo shown or listed in copyPlease visit the Dealer Network for more information at/dnSpecificationsGeneralImaging Device: 1/5" Exmor™ CMOS sensorwith ClearVid array Pixel Gross: 2360KRecording Media: 80GB Non-Removeable Hard Disk DriveMemory Stick PRO Duo™ Media (Sold Separately)Recording and Playback Times: 80GB HDD: High Definition: FH = up to 580 min., HQ = up to 1180 min. SP = up to 1440 min., LP = up to 920 min.Standard Definition: HQ = up to 1180 min., SP = up to 1750 min., LP = up to 3360 min. When using 16GB Memory Stick PRO Duo™ Media (sold separately): HighDefinition: FH = up to 110 min., HQ = up to 230 min. SP = up to 280 min., LP = up to 375 min.Standard Definition: HQ = up to 230 min., SP = up to 340 min., LP = up to 655 min. Video Actual: 1430K Pixels (16:9), 1080K Pixels (4:3)Still Actual: 1490K Pixels (16:9), 1990K Pixels (4:3)Processor: BIONZ™ image processor Video Resolution: 1920 x 1080Still Picture Resolution: 4 megapixelAudioRecording Format: Dolby® Digital 5.1 Microphone: Built-in Zoom MicrophoneConvenienceMemory Stick PRO™ Media Compatibility: Memory Stick PRO Duo™ Media (Sold Separately)Still Image Mode(s): JPEG Face Detection: Yes Hybrid: YesQuick On: Power on by LCD Dual Record: 2.3 megapixel Smile Shutter: YesConvenience FeaturesEasy Operation: YesMultiple Language Display: Yes Slide Show Mode: YesScene Mode(s): Auto, Twilight, Candle, Sunrise & Sunset, Fireworks, Landscape, Portrait, Spotlight, Beach, Snow Dynamic Range Optimizer: Yes Fader Effect(s): Black, White Face Index: Yes Film Roll Index: YesPhoto Capture from Movie: Yes x.v.Color™: YesSteadyShot® Image Stabilization: SteadyShot™ image stabilizationWhite Balance: Auto / outdoor / indoor / Onepush (Touch Panel) BRAVIA® Sync™: YesVideoFormat: HD: MPEG4 AVC/H.264; SD: MPEG2 Video Signal: HD: 1920 x 1080/60i; SD: NTSC color, EIA standardsVideo FeaturesPhotoTV HD: YesInputs and OutputsAnalog Audio/Video Output(s): Included (via A/V Remote Terminal)Digital Audio/Video Output(s): HDMI USB Port(s): Hi-speed (2.0 compliant) Component Video (Y/Pb/Pr) Output(s): Supplied (via A/V Remote jack)S-Video Output(s): Sold separately (via A/V Remote jack)HDMI™ Connection Output(s): Yes (mini) Audio/Video Remote Terminal: Video / S Video / Audio / Component Out / RemoteDisplayLCD Screen: 2.7" wide touch panel Clear Photo LCD Plus™ display (211k pixels)HardwareMemory Stick slot: Memory Stick PRO Duo™ MediaManual / Auto Lens Cover: Manual S/S & Zoom button on LCD: YesOptics/Lens35mm Equivalent: 42 - 497mm (16:9), 52 - 608mm (4:3) Aperture: F1.8-2.2Exposure: Yes (Touch Panel) Filter Diameter: 30mmFocal Distance: 3.2 - 32mmFocus: Full range Auto / Manual (Touch Panel)Shutter Speed: Auto (Slow Shutter ON), 1/30 - 1/1000;Auto (Slow Shutter OFF) 1/60 - 1/1000; Scene Selection, 1/2 - 1/1000 Optical Zoom: 10x Digital Zoom: 120xResolution: 4 megapixel stillLens Type: Carl Zeiss® Vario-Tessar® Minimum Illumination: 5 lux(Auto Slow Shutter ON, 1/30 Shutter Speed )PowerPower Consumption: 3.9WBattery Type: InfoLITHIUM® with AccuPower™ Meter System (NP-FH60)Power Requirements: 7.2V (battery pack); 8.4V (AC Adaptor)Service and Warranty InformationLimited Warranty Term: Limited Warranty --- 1 Year Parts; 90 Days LaborSoftware Supplied Software: PMB Ver.4.2.00 Supports Windows 2000 Professional Service Pack4?SP4?, Windows XP Service Pack3?SP3??32bit?Windows Vista Service Pack1?SP1??32bit/64bit?. Not supported by Mac OS.DimensionsWeight: w/o battery: 11oz (330g), w battery: 14.5oz (410g)Measurements: 2 3/4 x 2 3/4 x 5 1/8 inch (69 x 68 x 129mm)Supplied AccessoriesAC adaptor (AC-L200)Rechargable Battery Pack (NP-FH60) Component A/V Cable A/V Connecting CableApplication Software / USB Driver / (CD-ROM) USB CableOptional AccessoriesRechargeable InfoLITHIUM Batteries (NP-FH50/FH70/FH100) Case (LCS-BBDB/R/L)Starter Kit (ACC-ASH6, ACC-HDH6)AC Adaptor/Charger for H series batteries (AC-VQH10)Travel Charger (BC-TRP)Wide Angle Conversion Lens (VCL-HGE07A) HDMI Cable (mini) (VMC-30MHD) Tripod (VCT-80AV)Video Light (HVL-10NH)Underwater Sports Pack (SPK-HCE) GPS Unit (GPS-CS3KA) UPC Code: 027*********。
adaptive
Modeling a tool for the generation of programming environments for adaptive formalismsA.R. Camolesi Departamento de Engenharia de Computação e Sistemas Digitais, Universidade de São Paulo, Brasil Coordenadoria de Informática, Fundação Educacional do Município de Assis, Brasil E-mail: camolesi@.brAbstractThis paper aims to present the logical model that makes up the structure of a tool for the definition of environments for rule-driven adaptive formalisms.1 IntroductionAdaptive applications need resources to adapt themselves to the environment’s momentary needs and to foresee the internal and external demands, thus making up for a complex, robust, and fault-tolerant structure, yet flexible and responsive. Such applications offer modern capacities that are very difficult to be modeled by using present techniques of software development. In order to solve the adaptive applications’ modeling, it was proposed in [1] a generic formalism that allows (underlying) rule-driven non-adaptive devices to be extended to concepts of adaptive mechanisms. Such formalism is based on an Adaptive Mechanism (AM) that involves the kernel of an underlying non-adaptive device (ND). This way, an Adaptive Device (AD) is formally defined by AD = (C, AR, S, c0, A, NA, BA, AA). In this formulation C is the set of all the possible configurations of ND and c0 ∈ C means its initial configuration. S is the set of all possible events that make up AD’s entry chain and set A represents the acceptance configurations for ND. Sets BA and AA are adaptive actions’ sets. NA is a set of all symbols that can be generated with exits by AD, in response to the application of adaptive rules. AR is the set of adaptive rules that define the adaptive behavior of AD and is given by the relationship Ar ⊆ BA × C × S × C × NA × AA in which adaptive actions modify the current set of AR adaptive rules from AD to a new AR set by adding and/or deleting adaptive rules in AR. Based on these definitions, it is proposed in this paper a logical model for the representation of the formalelements shown in [1]. Such model is fundamental to the developing of tools that support a design methodology for adaptive applications. This paper is organized as follows: in section 2, the stages of extensions for adaptive devices and its use will be described. In section 3, the logical representation for adaptive devices is shown, and finally, in section 4, some conclusions and future papers are discussed.2 Stages of extensions for non adaptive rule-driven devices.When extending a formalism of an underlying device to the concepts of adaptive rule-driven mechanisms, a specialist should involve the non adaptive device with an adaptive layer. In order to develop this job, the specialist should possess good knowledge both of the underlying formalism and of the concepts of adaptive mechanisms. On the other hand, a planner that uses a device extended by a specialist does not need a formal knowledge as deep as the one needed by the specialist in extension of devices. The planner needs to know the extended specification language and how to use it in the project of his applications. When extending a non adaptive rule-driven device to support adaptive characteristics there is the need to accomplish 3 stages: the stage of extension of the formal (mathematical) model, the stage of definition of the logical model and the stage of definition of the physical model. Figure 1 illustrates the stages and the existent relationship among them. The stage of extension of the formal model Figure 1(A), offers a view in which a specialist with good mathematical knowledge of underlying formalism accomplishes the conceptual definition of the extended device to the concepts of adaptive mechanisms. In [1] and [2], extensions of underlying devices are presented to the concepts of adaptive devices. In this phase, the junction of the formal concepts of both (underlying and adaptive) formalisms is achieved, thus obtaining a new underlying device extended to concepts of adaptive mechanisms.represented by specification, thus modifying its structure. In [3], a methodology was proposed to give support to the project of adaptive applications by using concepts presented in this paper. In Figure 2, it is shown the design methodology for adaptive applications formed by the following phases: specification phase, transformation specification phase, and validation and specification simulation phase. In the specification phase the application is accomplished by using either a text or a graphic tool. Soon afterwards, the transformation of the produced specification to an intermediate representation (logical model) is accomplished and, based on the obtained representation the planner can inform entry string sequences and evaluate its specification. If mistakes or inconsistencies occur, the planner can make changes in the specification and restart the process.Figure 1. Stages of extension of non adaptive rule-driven devices.After obtaining the adaptive formalism, it is necessary a mapping of its concepts for an intermediate representation, as shown in Figure 1(B). Such stage consists of the definition of the logical structure that represents the formal concepts of the new adaptive device. Such structure is of fundamental importance, because it is part of the information storage structure necessary for the development of tools that will help the planner in designing adaptive applications. In the stage of physical definition, as shown in Figure 1(C), a planner with knowledge of the developed adaptive formalism accomplishes the specification of his application. At this stage, yielded specifications are to be later analyzed and implemented. When performing his work the planner instances the defined objects in the logical stage and he defines the physical elements that represent the behavior of the application. In this phase, it can be observed that the instantiated objects belong to two different classes, i.e., the objects that represent the behavior of the developed application and other objects that represent the adaptive functions and actions responsible for modifications in the behavior of the application in execution. Based on the set of the defined objects in this phase, the presentation, the simulation, the verification and the execution of the projected application are allowed. During the simulation and execution process of specification in the adaptive kernel, adaptive actions can be executed and rules can be added or removed from the behaviorFigure 2. Methodology of Design of Adaptive Applications.The proposed methodology is linked to the need to use tools for helping the planner in the performance of his job. During the specification phase there is the need of a text or graphic tool to aid the planner in the specification of an application. The phase of specification transformation of the application to an intermediate representation can be accomplished in two ways: automatic (generated by the editors at the moment of the edition), or through a translator that makes the transformation process after the specification process. And, finally, tools that allow the visualization, simulation and verification of the projected applications. In this phase, the planner, using an integrated environment informs the values regarding entry chain and submits their specification to the performer of the adaptive kernel. Initially, in case they exist, prior adaptive actions are performed, followed by elementary actions of the underlying device and finally the subsequent adaptive actions. This way, at each step the designer gets a new configuration (state of the system) and a new set of rules (behavior of the application) according to the adaptive actions that wereperformed. The obtained results should be displayed to the user, who can analyze them and, if necessary, make changes and restart the whole process.3 Logical model for adaptive formalismsBased on the concepts shown in [1], a logical model is proposed, so that it allows the construction of tools that help to plan adaptive applications. Such a model is represented by a data structure that gives support to the storage of the intermediate representation and allows the construction of a program that can manage the performance of the resulting specification by using the available facilities from adaptive devices. In [3], a proposal was presented for the logical structuring of the formal definition of the concepts of adaptive devices. Figure 3 shows a diagram of entity relationship of the conceptual model for adaptive devices. Such a diagram is structured by objects of three types: Underlying Kernel (UK), Specification (S) and Adaptive Layer (AL) according to the characteristics they represent. The objects of horizontal hachure (Device, Component Type, Connection Type and Attribute Type) are Underlying Kernel (UK) type and they correspond to the intermediate representation of the basic elements of an underlying device. In this structure, the conceptual elements of the underlying devices formally represented by set C are defined.Figure 3. Diagram of entity relationship intermediate representation.Solid color objects (Project, Attributes, Components, Connections and Variables Environment) are Specification (S) type and aim to represent the specifications yielded by a planner. Each object of this structure corresponds to elements of the formal definition, in which: each rule c that is part of the set of rules NR of an underlying device ND can be represented by the objects in S. The planner, when defining a specification, instances objects of the NS type (elements that constitute the underlying kernel) and defines the behavior of the application. This structure also stores the elements of set A that correspond to the rules of acceptance of an adaptive device and, furthermore, to the information on values ofboth the entry and exit chains in the Variable Environments object. The objects with vertical hachure are Adaptive Layer (AL) type and they aim to provide the necessary resources to support the adaptive layer that involves the underlying kernel. The Adaptive Layer is structured in objects that correspond to the configuration of the adaptive device (Adaptive Action Type), and in objects that correspond to the AR conceptual elements that, in turn, correspond to adaptive functions and actions. When defining the Underlying Kernel of a new device (Petri Nets, Automata, Grammar Free from Context, etc...) the specialist needs to store information related to the name of the device, the creation date and updating, etc… Such information is stored in the Devices object. Information on the types of components (places and transitions of a Petri Net, final states, and non-final states of Automata, etc...) that represent the behavior of an application and that is used by a planner when specifying their application, can be represented by the Component Type object. When specifying a rule that represents the behavior of an application it is necessary to represent the form of the existing connection between its components. The Connection Type object represents the information on the connection type for a device: transition for Automata, Petri Net connections, etc…, while the Attribute Type object contains information on the types of data that are available for attribution to a component of an application behavior. When accomplishing the Specification of an application it is necessary to store information on the description of the specification, on the planner in charge, etc…. Such information is represented by the Projects object. At first, when defining the behavior of a project, one should define the components that constitute the application behavior. Such components are parts of the NR rules and they are represented by the Components object. One can mention the description of the states that constitute a specification of Automata or the description of the places and transitions of a Petri Net, etc… as examples of such components. Following the definition of the components, one defines the rules (set c of the formal representation) that constitute the behavior of an application (formally acted by NR). Such structure establishes the relationship among the defined elements in both Component and Connection Type objects and defines the behavior of an application. The value of each attribute associated to a (Component or Connection) object is represented by the Attributes object. The values of stimulus, and related information to the exit and other necessary information duringexecution are acted by the Environment Variables object. The Adaptive Layer is associated to the elements of specification of an application. This results, at first, in the definition of the information on the type of adaptive action that can occur: consultation action, insert or removal. Such information is stored in the Adaptive Action Type object. When the adaptive mechanism is joined to the underlying kernel it is necessary to define the adaptive functions (the conceptual elements BA and AA) that should be associated to the elements of the Components object. The Adaptive Functions object allows the extension of the underlying kernel to have the features of adaptive mechanisms and it makes the connection between the elements of the underlying kernel and their respective adaptive actions that are represented by the Adaptive Actions object. The Adaptive Actions object represents the set of adaptive actions belonging to AR that has the function of accomplishing changes in the behavior of the projected application. Based on the logical structure, a tool is being developed that will allow a specialist to configure the conceptual elements of a non adaptive device and to accomplish its extension for the adaptive mechanisms. Such tool will also allow a planner, by using a textual language (intermediate representation), to develop the project of their applications. In a second stage other tools will be developed that will allow the specification and display of graphic elements of the extended adaptive devices. The tool development is being made in Java [3] due to the portability and reuse features inherent to this programming language. Figure 3 shows the interface of the tool that is responsible for the definition of the connections of a specification.4 Conclusion.This work aimed to present how to make the extension of a non adaptive device to support the characteristics of adaptive mechanisms. Initially, the general structure of an adaptive mechanism was presented, followed by the stages for the extension of a non adaptive formalism to support the characteristics of adaptive mechanisms. Following, the methodology for the design of adaptive applications was shown by using these concepts. Finally, a logical model was presented for the construction of tools that will give support to a design methodology of adaptive applications. The proposed methodology was used in [2] to modeling of applications that has support the use of graphic interface and tools are being implemented to facilitate specialists and planners in their job with adaptive technology. In relationship the stages of definition of adaptive formalisms several works were accomplished in relation to formal definition and as resulted adaptive formalisms were developed. Such works served as base for the definition of the extension stages for adaptive formalisms and they were to base the proposal of a logical model that it seeks to represent adaptive ruledriven formalisms. The defined logical structure represents the conceptual elements for adaptive formalisms and it constitutes an intermediate representation for the definition of tools that it will support the methodology of design of adaptive applications. As a continuation to this work, it is suggested a deeper study for the validation of the proposed logical model and the definition of a physical model (computational) for the validation of the proposed structure.References[1] Neto J.J.(2001) Adaptive rule-driven devices general formulation and case study, Sixth International Conference on Implementation and Application of Automata, Pretoria-South Africa. [2] Camolesi, A.R. and Neto, J.J. (2004) Modelagem Adaptativa de Aplicações Complexas, XXX Conferencia Latino Americana de Informatica (CLEI), Arequipa, Peru. [3] Camolesi, A.R. e Neto, J.J (2003) An adaptive model for modelling of distributed system, Conference Argentina in la Ciência da Computacion (CACIC), La Plata, Argentina.Figura 4. Interface of an Adaptive Tool System.[4] Programming Language JAVA in (September 2004).。
适配器(Adapter)模式
适配器（Adapter）模式一、适配器（Adapter）模式适配器模式把一个类的接口变换成客户端所期待的另一种接口，从而使原本接口不匹配而无法在一起工作的两个类能够在一起工作。
名称由来这很像变压器（Adapter），变压器把一种电压变换成另一种电压。
美国的生活用电电压是110V，而中国的电压是220V。
如果要在中国使用美国电器，就必须有一个能把220V电压转换成110V电压的变压器。
这个变压器就是一个Adapter。
Adapter模式也很像货物的包装过程：被包装的货物的真实样子被包装所掩盖和改变，因此有人把这种模式叫做包装（Wrapper）模式。
事实上，大家经常写很多这样的Wrapper 类，把已有的一些类包装起来，使之有能满足需要的接口。
适配器模式的两种形式适配器模式有类的适配器模式和对象的适配器模式两种。
我们将分别讨论这两种Adapter 模式。
二、类的Adapter模式的结构：由图中可以看出，Adaptee类没有Request方法，而客户期待这个方法。
为了使客户能够使用Adaptee类，提供一个中间环节，即类Adapter类，Adapter类实现了Target接口，并继承自Adaptee，Adapter类的Request方法重新封装了Adaptee的SpecificRequest 方法，实现了适配的目的。
因为Adapter与Adaptee是继承的关系，所以这决定了这个适配器模式是类的。
该适配器模式所涉及的角色包括：目标（Target）角色：这是客户所期待的接口。
因为C#不支持多继承，所以Target必须是接口，不可以是类。
源（Adaptee）角色：需要适配的类。
适配器（Adapter）角色：把源接口转换成目标接口。
这一角色必须是类。
三、类的Adapter模式示意性实现：下面的程序给出了一个类的Adapter模式的示意性的实现：// Class Adapter pattern -- Structural exampleusing System;// "ITarget"interface ITarget{// Methodsvoid Request();}// "Adaptee"class Adaptee{// Methodspublic void SpecificRequest(){Console.WriteLine("Called SpecificRequest()" );}}// "Adapter"class Adapter : Adaptee, ITarget{// Implements ITarget interfacepublic void Request(){// Possibly do some data manipulation// and then call SpecificRequestthis.SpecificRequest();}}///<summary>/// Client test///</summary>public class Client{public static void Main(string[] args){// Create adapter and place a requestITarget t = new Adapter();t.Request();}}四、对象的Adapter模式的结构：从图中可以看出：客户端需要调用Request方法，而Adaptee没有该方法，为了使客户端能够使用Adaptee类，需要提供一个包装（Wrapper）类Adapter。
游戏处理器王者再临 Intel十一代酷睿桌面处理器
计算机与网络自年初开始，关于Intel第十一代酷睿桌面处理器的消息就层出不穷，尤其是广大的游戏玩家和内容创作者,都在翘首以盼，今天，帮助大家更好地了解一下全新的十一代酷睿桌面处理器的性能表现。
升级全新的CypressCove微架构IPC提升19%全新的Intel酷睿19-11900K和15-11600K处理器的架构代号为RocketLake-S,依旧采用了14nm的制程,单核性能相对于上代产品IPC提升19%,单核心的性能提升对于日常的大部分应用和游戏来讲，能够带来更加高效的处理速度，目前大部分的应用和游戏都是非常吃单核心性能的,这也就是为什么Intel如此注重IPC表现。
另外核心微架构方面,全新的第十一代酷睿桌面级处理器由SkyLake升级为全新的CypressCove架构，让整个处理器的执行效率大幅提升，这一代的处理器还特别引入了AVX-512指令和AI加速技术，全新的AI加速引擎支持Deep Leaning Boost深度学习加速技术以及VNNI矢量神经网络指令集,让CPU在游戏、内容创作和AI学习方面,综合性能全面提升。
同时全新的第十一代酷睿桌面级处理器还集成了全新的IntelXe架构的UHD系列核心显卡，图形处理性能相对于上代提升50%，在30帧的性能下基本可以流畅运行各种网络游戏,对于一般的日常办公和轻度游戏来讲,完全不需要额外搭配高性能的独立显卡。
全新的内存控制器第十一代酷睿处理器升级了最新的内存控制器,从上代的CometLake-S全系支持DDR4-2933MHz内存升级到DDR4-3200MHZ,升级内存频率对于整机的核显性能和游戏性能影响显著，能够有效提升跑分和游戏帧数。
从前的B和H系列主板不支持内存超频，现在的全新的主板均支持内存进一步超频,提升整机的可玩性和性能表现,这点对于大部分的用户来讲，非常有必要。
升级Adaptive Boost Technology充分释放多核睿频性能全新的第十一代酷睿i9处理器支持最新的英特尔Adaptive Boost Technology技术,这样技术能够适时地提高处理器多核睿频频率，就拿i9来讲，处理器的最高可将核心的频率提升到5.3GHz,进而全面提升处理器的性能表现，并且这项技术不提升电压和电流,在规范内进行运行，不算超频,对于普通的用户来讲，这项技术不需要额外进行操作,就能获取更大的性能提升。
TP-Link RE450 扩展器快速安装指南说明书
©2015 T P -L I NK7106505765 R E V 1.1.0LED ExplanationButton Explanation2.4GHz/5GHzOn: The extender is connected to the2.4GHz/5GHz wireless network of your host network.Off: No connection.POWEROn: The extender is on.Blinking: The extender is initializing.Off: The extender is off.Solid blue: The extender is connected to the router, and is in a good location.Solid red: The extender is connected to the router, but is too far away from the router.Blinking: WPS connection is in process.Off: No active connection.(RE)Power button : To turn on or off the extender, press the Power button.LED button : To turn all LEDs on or off, press the LED button.Plug the extender into an electricaloutlet near your router, and wait until the POWER LED is lit and solid blue.Power onEntertainment Adapter Tether app provides a simple, intuitive way to access, manage your extender using your iOS or Android devices.Block network access from specific devicesTurn off the LED at the specific timeChange the basicextended network settings Do initial configuration of your extenderA1. Make sure your computer is connected to the Extended network SSID or connect your computer to the extender using an Ethernet cable.A2. Change the computer’s fixed IP address to “Obtain an IP Address Automatically”.A3. Verify that is correctly entered in the web browser and press Enter .Q3. What should I do if the LED does not change to solid after completingOption ONE?Frequently Asked Questions (FAQ)Q4. How do I restore the extender to its factory default settings?A. While the extender is powered on, press and hold the Reset button until all the LEDs turn on momentarily.Q2. What should I do when the LED is on, but only one band is connected?A. It depends on your router capabilities. If you are connecting to a dual-band router, but only 2.4GHz or 5GHz LED is on, press the WPS button on the router and on the extender again to reconnect the other band.A. You may have entered the incorrect Wi-Fi password of your host network during theconfiguration. Please log into the extender's web-based interface to check the password and try again.Q1. What do I do if I cannot access the extender’s web management page?。
adaptive
Parallel analysis for lightweight network incident detection using nonlinearadaptive systemsRuo Ando,Yoshiyasu TakefujiNational Institute of Information and Communication Technology,4-2-1Nukui-Kitamachi,Koganei,Tokyo184-8795Japanruo@nict.go.jpKeio University,Graduate School of Media and Governance,Endo5322Fujisawa252-8520JapanAbstractThe rapid increasing of security incidents imposes a great burden on Internet users and system administrators. In this paper we discuss a parallel analysis for lightweight network incident detection using nonlinear adaptive sys-tems.We run AID(anomaly intrusion detection)and MID (misuse intrusion detection)systems in parallel.Two de-tectors generate binary output misuse={Y ES/NO} and anomaly={Y ES/NO}.Then,we can determine whether we need to perform network or security operation. We apply clustering algorithm for AID and classification al-gorithm for MID.The nonlinear adaptive system is trained for running MID and AID in parallel.Proposed parallel system is more lightweight and simple to operate even if the number of incident patterns is increased.Experimental results in the case where false positive is frequently caused show that our method is functional with a recognition rate of attacks less than10%,whilefinding the anomaly status. Also,performance evaluation show that proposed system can work with reasonable CPU utilization compared with conventional serial search based system.1Introduction1.1Anomaly and misuse detectionIDS(Intrusion detection system)is kind of alarm de-ployed on computer system and network to detect activity called misuse,that is something unauthorized action such as leaking or compromising.Recent increasing of the number of attacks against computer systems is rapid enough to pare off the effectiveness of human response.More effective,automated and intelligent detection method is researched in manyfields to take some measures for the unseen incidents. Generally,researches are objective to construct a system treating attacks with automatic response.Among attacks, network intrusion includes far-flung activity to threaten the stability or assurance of information stored in the system linked to network.NIDS(Network Intrusion detection sys-tem)works on network to analyze the packets that passing through thefirewall.NIDS monitors traffic of internal and external malicious activity so that administrator of system can take corrective countermeasure.Almost traditional IDS is using signature-based detection methods that collate pat-terns in packet data,and comparing the patterns to dataset of signatures afforded manually by experts.Because signa-ture database is now maintaining by system administrator, these methods is not able tofind unknown types of intrusion unless the new signature is updated to the database.Intru-sion detection techniques are generally classified into two categories:anomaly detection and misuse detection.Mis-use detection is performed by looking for the behavior of a known exploit scenario,which is usually described by a specific sequence or data.Current signature based methods is classified in misuse detection but lacks the scalability to extract features from attacks observed to detect even deriva-tives of conventional incidents by itself.Misuse learning algorithms on labeled data generally cannot detect new in-trusion as it is.In addition,processing labeled data in order tofind variation is usually so expensive.On the other hand, anomaly detection is performed by the inspection for the state that deviates from the baseline or normal state defined before.Profiling algorithms for AID on unlabeled data is frequently causing false positive because the audit data can be very large.And the output of this method is inclined to depend much on the numbers and features of data to train.1.2Increase of IDS signaturesIt is supposed that a large number of service and system will be connected to the internet.And the number of ex-posed security holes,flaws and vulnerabilities is increasing rapidly still now.In addition,crackersfind out the security holes,flaws and exploits code from vast number of program code.Concerning external attacks,it may be almost impos-sible to generate unknown signature of all exploit no matter how much the data mining techniques is progressed in the view of feasibility to training data of vast information of all systems and services connected to the internet.To specify the unknown exploit,we should eventually use the pattern matching method according to the information from trust-worthy sources such as mailing list managed by experts.On the other hand,the signatures of current intrusion detection system is increasing and its managing is becoming so com-plicated that administrators is required to spend much time to learn how to handle rules and maintain databases.Cur-rent IDS checks all internal and external packets and logs part of them according to signature rule set.With the com-plexity of managing signatures,there is matter of concern that increase in the number of signatures unnecessary im-pose the great burden to the system and worse,the improper setting of signature rule set drop the packets of coming at-tacks.1.3Tradeoffs between clustering and clas-sificationThere are two major data mining techniques applied for intrusion detection,clustering or classification.Clustering is the automated,unsupervised process that allows one to group together data into similar characteristics.Classifi-cation is the method to learn to assign data to predefined classes.These two methods are applied for two detec-tion styles as we mentioned before,anomaly detection and misuse detection.Anomaly detection uses clustering algo-rithms because the behavior tofind is unlabeled,with no external information sources.Misuse detection adapts clas-sification algorithm because the activity to analyze requires that detector know how classes are defined.The tradeoff about the accuracy and range of detection exists between clustering and classification.Classification deal with pre-defined data,so it affords detection of weaker signal and figure out accurate recognition.But in some cases,it may be biased by incorrect data to train and it is not able to de-tect new type of attacks in the sense that the attack does not belong to any category defined before.Clustering is not dis-torted by previous knowledge,but therefore needs stronger signal to discover.At the same time it can deal with unla-beled attacks because the training doesn’t specify what the detection system is trying tofind while clustering go too far to perceive the activity that is not included incident affair. 2Proposed systemFigure1shows the comparison of signature-based in-spection and proposed parallel analysis.In signature based IDS such as Snort[24],packet payload is matched after preprocess of IP header.If some signature is matched, the packet is inspected in detail and classified according to database..Then,network administrator can distinguish whether the packet is generated by anomaly event or ma-licious behavior.In this method,as the number of signa-ture is increasing,the system is more heavy and compli-cated to operate.Besides,we cannot know if we should treat the detected event by network or security operation until database transaction is completed.Lower side of Fig-ure1show the proposed parallel analysis method.After preprocess,we run anomaly detector and misuse detector in parallel.Both modules is quantitative analyzer.By set-ting proper threshold,two detectors generate binary output misuse={Y ES/NO}or anomaly={Y ES/NO}.In the case of anomaly=Y ES and misuse=NO,we start countermeasure by network operation.In the case of anomaly=Y ES and misuse=NO,we start counter-measure by security operation.That is,anomaly∧misuse=1→work.operation anomaly∨misuse=1→do.security.operation.By AND or OR operation of binary output from two de-tectors,we can address the tradeoff between clustering and classification.Details about this solution is discussed in sec-tion4.Instead of qualitative specification of attack packet, proposed parallel system is more lightweight and simple to operate.Also,according to numerical output or perfor-mance evaluation in section5,our system is more robust to attack for IDS itself which is serious for network adminis-tration.3Related workOne of the most classic researches of intrusion detec-tion was[1]in1980.Since then,many data mining tech-niques have been proposed for more accurate detection as one activefield[2][3].Anomaly detection to model nor-mal behavior is implemented in the statistical techniques [4][5][6]and machine learning to recognize anomalous user and program[7][8][9].Among anomaly detection tech-niques,clustering is popular and well studied method in this field[10].There could be categorized anomaly detection into two types:profiling-emphasize[11][12][13]and real-time detection aiming type.Misuse detection to discoverparison of serial matching based system and proposed parallel analysis system.After packet preprocess.we run anomaly and misuse detection in parallel.exploitation that is recognized by a specific pattern or se-quence of the events data observed is also performed in the expert systems[14].In[15],discussion is mainly based on how to classify the predefined data.In this paper,we adapt two-stage processing based on neural networks.Early work on the applying neural network for intrusion detection was due to Henning et al[16].Ghosh and Schwartzbard have proposed the application of neural for anomaly and misuse detection.They use artificial neural networks for anomaly detection in order to detect unseen behavior and for misuse detection in order to detect variations of known attacks.In recent years,there are various techniques in applying neural networks.The advantages of neural networks are pointed in the potential to process the limited,incomplete and nonlin-ear data sources by Cannaby[17].Recently,applying SVM (support vector machine)for IDS is well researched.In [18],SVM is applied for anomaly detection.Katherine A Heller et al.applied SVM for anomalous registry accesses in[19].DJ.Wang et al.discuss the efficient optimal probe deployment of distributed IDS in[20].In[21],distributed IDS in MANET is discussed.4Training nonlinear adaptive systems4.1Two stage matrix generationClustering algorithms are applied for learning”nor-mal”or”usual”state of computer network.To output anomaly=YES and misuse=NO in parallel,we need to ap-pend misuse dataset to clustered dataset.Figure2show the two stage signature generation for parallel analysis.Let data[i][j]data for AID and data[k][h]for MID where i,k are the number of class(kinds of aggregated data)and j,h are time(j=h).First,traffic data[i][j]is processed by clustering module.Then,generated matrix and misuse data[k][h]is processed in classification module.In detection,distance of AID and recognition rate of MID is calculated in parallel.4.2Neural networksTo make proposed system lightweight,we apply two neural networks:maximum neural network and functional link network.Two algorithm have been developed for faster convergence and lightweight recognition.Figure2.Two stage matrix generation.Let data[i][j]data for AID and data[k][h]for MID where i,k are the number of class(kinds of aggregated data)and j,h are time(j=h).After clustering,we append misuse dataset[k][h]in classification module.4.2.1Maximum neural networkMaximum neural network is one of the algorithms for unsu-pervised clustering.This paper use a two-dimensional max-imum neural network that has M clusters N neuronsfigur-ing out M*N processing elements.In this algorithm,only one neuron willfire in each cluster and the output of other neurons in the same cluster become zero so that a stable state will always represent a valid solution[22].In discrim-ination analysis,Mahalanobis distance is the useful way of calculating similarity in units of standard deviation from the group mean.In this measurement,thefigured out circum-scribing ellipse formed around the cluster defined the one standard deviation boundary of that group.4.2.2Functional link networkTo assign instances to predefined classes,we use the lightweight classification algorithm called functional link neural network.A standard neural network typically con-tains on lots of simple computational elements or nodes ar-ranged in on or more stages between input and output.The inputs to a node are linearly weighted before the sum before calculating sum by some nonlinear function,which gives to the network its nonlinear approximation ability.If nonlinear processing rules are adapted,the learning rate is often slow and local minimum may case problems.The functional link model eliminates all layers between input and output by us-ing single step of processing is one way to avoid the nonlin-ear learning.The simplicity of the network,the time it takes to complete a model trained by prediction is so fast mea-sured in milliseconds.Another benefit of functional link neural network isflexibility when the learning time is based on the numerous processing elements necessary for com-puting[23].It is known that functional link model could be faster than the other multi-layer learning algorithm in the problem where the convergence is predicted to some extent. 5System outputs and measuring perfor-mance5.1System outputsAs we discussed before,network trouble such as rapid increase of SYN or ICMP packet is not easy to be distin-guished from status caused by malicious activities.Admin-istrators usually inspect many kinds of packetsflow com-prehensively and compare the current status with his ex-perience.We show this kind of event(network trouble by misoperation)is good example for validating the effective-ness of proposed method.Table1shows the dataset for network trouble(rapid un-usual packet increase)by the misoperation.Figure3shows the output of AID,the mahalanobis distance of clusters as profilefigured out by maximum neural network.FigureTable 1.Data set for Network trouble by misoperation.1the number of inward packets2the number of outward packets3the number of inward bytes4the number of outward bytes5the number of SYN packets6the number of port connection7the number of host inward connection8the number of host outward connection9the number of PING packets10the number of ICMP unreachpackets Figure3.Mahalanobis distance of the states occured by networktrouble.Figure4.Recognition rate of the state in point99of Figure3.This indicates that the state isnot occured by malicious action but unusual.4show the output of MID in recognizing network trou-ble.Clustering is able to detect the large number of attacks because the unsupervised learning and discrimination does not require predefined data.However,clustering algorithms can onlyfind just unusual or abnormal event compared with the profiles from system monitored.Thus,we need to run classification module in parallel.To proceed to specify the events alerted,we should process weaker signal.Classifica-tion algorithm can handle weaker signal tofigure out accu-rate recognition.Figure4show the recognition rate of the state in point99of Figure3.This indicates that anomaly is not occurred by malicious action but misoperation.5.2Performance evaluationNetwork administrators are recently concerned about the cost by deploying software loaded on their services.Some-times it is discussed that impact on CPU and disk utilization of utilizing IDS is considerably high.In this section,we compare the performance of proposal method with IDS with database transaction such as Snort and PostgreSQL[25].We pick up an attack called stick attack.This attack creates DoS (Denial of Service)attacks with packet data that generates numerous false alarms.The purpose of this technique is to trigger IDS events on aflooding level.Consequently IDS become disable to handle aflood of alerts owing to CPU usage and disk space being full of logsfiles.AndfinallyFigure5.CPU idle time of snort and proposedsystem.IDS drop packets or fail-on allowing malicious access to the network monitored.The effectiveness of the stick attack de-pends on how much CPU utilization or disk space of system where IDS resides could be wasted by the performance of tools and the attacker’s available bandwidth.Figure5shows that CPU idle time both of snort using text signature matching and proposed system using quanti-tative analysis.Under stick attack,proposal method is more functional in the sense that it works with less CPU utiliza-tion and returns to normal status faster.In Figure6,comparison is shown between the CPU utilization of snort applying PostgreSQL database transac-tion and proposed system with two neural networks.From performance measurementfigured out,proposal method is faster and more reasonable about CPU utilization.6Conclusion and further workThe rapid increasing of security incidents imposes a great burden on Internet users and system administrators. In this paper we discuss the parallel analysis for lightweight network incident detection using nonlinear adaptive sys-tems.In proposed system,we run anomaly detector and misuse detector in parallel.Both modules is quantitative analyzer.By setting proper threshold,two detectors gener-ates binary output misuse={Y ES/NO}or anomaly= {Y ES/NO}.In the case of anomaly=Y ES and misuse=NO,we start countermeasure by networkopera-Figure6.CPU idle time of snort with post-greSQL and proposed system.tion.In the case of anomaly=Y ES and misuse=NO, we start countermeasure by security operation.That is, anomaly∧misuse=1→work.operation anomaly∨misuse=1→do.security.operation.By{AND/OR}operation of binary output of two detec-tors,we can address the tradeoff between clustering and classification.We apply clustering algorithm for AID and classification algorithm for MID.Lightweight nonlinear adaptive system(maximum and functional link neural net-works)is trained for generating matrix for AID and MID. Proposed parallel system is more lightweight and simple to operate even if the number of incident patterns is increased. Experimental results in the case where false positive is fre-quently caused show that the proposal system is functional with a recognition rate of attacks less than10%,whilefind-ing the anomaly status.Also,performance evaluation show that for stick attack,this method can work with reasonable CPU utilization compared with serial signature matching based system.References[1]James P.Anderson,”Computer security threat moni-toring and surveillance”,Technical report,James P.Anderson Co.,Fort Washington,PA,1980.[2]Wenke Lee,Salvatore J.Stolfo,Kui W.Mok,”A DataMining Framework adaptive intrusion detection”,in Proceedings of the7th USENIX Security Symposium, 1998.[3]David Marchette,”A Statistical Method for ProfilingNetwork Traffic”,in Proceedings offirst USENIX Workshop on Intrusion Detection and Network Moni-toring,1999.[4]David Wagner and Drew,”Intrusion detection viaStatistic Analysis”,IEEE Symposium on Security and Privacy,2001.[5]Marina Thottan,Chuanyi Ji,”Proactive Anomaly De-tection Using Distributed Intelligent Agents”,IEEE Network,Special Issue on Network Management,vol.12,1998[6]Ghosh,Anup,K.Wanken,James and Charron,Frank.”Detecting Anomalous and Unknown Intru-sions Against Programs”,in Proceedings of the14th IEEE Annual Computer Security Applications Con-ference,1998.[7]Leonid Portnoy,Eleazar Eskin and Salvatore J.Stolfo,”Intrusion Detection with unlabeled data using clus-tering”,in Proceedings of ACM CSS Workshop on Data Mining Applied to Security(DMSA-2001), Philadelphia,PA,2001.[8]Makoto Iguchi and Shigeki Goto,”Detecting Ma-licious Activities through Port Profiling”,IEICE TRANS.INF.V ol.E82-D,1999.[9]Anup K.Ghosh,Aaron Schwartzbart,Michael Schatz,”Learning Program Behavior Profiles for Intrusion Detection”,in Proceedings1st USENIX Workshop on Intrusion Detection and Network Monitoring,1999.[10]W.Lee,S.Stolfo,P.Chan,E.Eskin,W.Fan,M.Miller,S.Hershkop,and J.Zhang,”Real time data mining-based intrusion detection”,in Proceedings of Second DARPA Information Survivability Conference and Exposition,2001.[11]James Cannady,”icial Neural Networks for MisuseDetection”,in Proceedings of the1998National In-formation Systems Security Conference(NISSC’98), Arlington,V A,1998.[12]Fawcett,T.and F.Provost,”Combining data miningand machine learning for effective user Profiling”,in Proceedings of the Second International Conference on Knowledge Discovery and data mining(KDD-96), 1996.[13]S.T.Eckmann,G.Vigna,and R.A.Kemmerer,”STATL:An Attack Language for state-based intru-sion detection”,Journal of Computer Security,vol.10, no.1/2,2002.[14]Ulf Lindqvist and Erland Jonsson,”How to Systemat-ically Classify Computer Security Intrusions”,In Pro-ceedings of the1997IEEE Symposium on Security& Privacy,Oakland,California,May4-7,1997. [15]S.W.Shieh,Virgil D.Gligor,”A Pattern-OrientedIntrusion-Detection Model and Its Applications”, IEEE Symposium on Security and Privacy1991p327-342,1991.[16]K.Fox,R.Henning,J.Reed,and R.Simonian,”Aneural network approach towards intrusion detection”, Tech.Rep.,Harris Corporation,1990.[17]Wenjie Hu,Yihua Liao and V.Rao Vemuri,”Ro-bust Support Vector Machines for Anomaly Detec-tion in Computer Security”,The2003International Conference on Machine Learning and Applications (ICMLA’03),Los Angeles,California,2003. [18]Katherine A Heller,Krysta M Svore,Angelos D.Keromytis,and Salvatore J.Stolfo,”One Class Sup-port Vector Machines for Detecting Anomalous Win-dow Registry Accesses”,3rd IEEE Conference Data Mining Workshop on Data Mining for Computer Se-curity,Florida,2003[19]J.Wang,N.Nitta,and H.Seki,”An efficient methodfor optimal probe deployment of distributed IDS,”The 2004Symposium on Cryptography and Information Security,2004.[20]Ricardo Puttini,Jean-Marc Percher,L.Me and Rafaelde Sousa,”A Fully Distributed IDS for MANET”,in Proceedings of the9th IEEE Symposium on Comput-ers and Communications(ISCC’2004),2004[21]James Cannady,”Artificial Neural Networks forMisuse Detection”,in Proceedings of the1998 National Information Systems Security Conference (NISSC’98),1998[22]Takefuji Y.-Lee K.C.-Aiso H,”An artificial maxi-mum neural network:a winner-take-all neuron model forcing the state of the system in a solution do-main”,Biological Cybernetics,67:Springer-Verlag Ltd,London,1992.[23]Y.H.Pao,and Y.Takefuji,”Functional-link net com-puting:theory,system architecture and functionali-ties”,IEEE Computer,25,5,1992。
Ruckus ZoneFlex 2942 802.11g Wi-Fi接入点说明书
the environment. This means fewer APs, more satisfied users, and a cost-effective system that can be installed anywhere by wireless novices.Deployed individually, or as a system centrally managed by the Ruckus ZoneDirector ™ Smart WLAN family of control-lers, the Ruckus ZoneFlex 2942 can be deployed with or without Ethernet cabling. Support for Ruckus Smart Mesh Networking streamlines costly and complex deployment headaches, eliminating the need to run Ethernet cabling to every access point. This minimizes operational overhead, making the ZoneFlex 2942 ideal for hotels, schools, airports and enterprises everywhere.Smart Wi-Fi 802.11g Access PointNo RF expertise requiredSmart antenna array eliminates AP placement issues and minimizes adjacent AP interference, while ZoneDirector controls dynamic channel assignment and power management.Optimized for voice over Wi-FiSpecialized antenna design, dynamic signal path selection and preci-sion QoS software optimize delay-sensitive, high-density Voice-over-Wi-Fi (VoFi) applications. Power Save (UAPSD) maximizes handset battery life.“IT lite” configuration and managementWeb-based wizard enables configuration of multiple APs across the entire WLAN in minutes. Once configured, the WLAN manages itself.ZoneFlex ™2942A patented smart antenna array integrates six high-gain vertically-polarized and six horizontally-polarized antenna elements. This enables up to 4096 potential antenna combinations and up to 9 dBi gain, thereby delivering unprecedented range extension and signal reliability. The dual polarized smart antenna increases the effectiveness of spatial-multiplexing, resulting in higher data rates.An intuitive web-based wizard in the RuckusZoneDirector enables quick and easy configuration of each ZoneFlex 2942 in a matter of minutes.AC powerExternal RP-SMARF Connector10/100802.3 af PoESoft reset10/100Ethernet Patented BeamFlex ™ Technology Extends Signal Range, Improves Stability of Client ConnectionsThe ZoneFlex 2942 Smart Wi-Fi access point integrates a software-controlled smart antenna array that delivers 9 dBi of signal gain and 20 dBi of interference rejection. This allows a 2 to 4x improvement in signal range and a reduction in packet loss from the ability to automatically avoid interference and obstacles.Advanced WLAN Applications with Smart/OSWhen used with the Ruckus ZoneDirector Smart WLAN controller, the ZoneFlex 2942 supports a wide range of value-addedapplications such as guest networking, Smart Wireless Meshing, Dynamic PSK, hotspot authentication, wireless intrusion detectionand many more. With Smart/OS, up to 32 discrete WLANs can be created and mapped to the same or different APs or VLANs. In a centrally managed configuration, the ZoneFlex 2942 works with a wide range of authentication servers including Microsoft’s Active Directory, LDAP , and RADIUS.Flexible Deployment OptionsZoneFlex 2942 APs can be deployed in as a standalone AP or as part of a centrally managed wireless LAN using ZoneDirector Smart WLAN controllers. ZoneFlex 2942’s can be deployed across any L2/L3 network and/or meshed without Ethernet cabling. When used with the ZoneDirector, the ZoneFlex 2942 is automatically configured through the network making deployment quick and easy.Complete Local and Remote ManagementThe ZoneFlex 2942 can be managed as a standalone AP through a Web-based GUI, using SNMP or through theRuckus FlexMaster Wi-Fi remote management system. Localmanagement can also be performed using the ZoneDirector Smart WLAN controller. FlexMaster is a LINUX-based software platform that uses industry-standard protocols to per-form bulk configuration, fault detec-tion, monitoring and a wide range oftroubleshooting capabilities over a wire area connection. The ZoneDirector enables local management and controlof APs, adding value-added services such as transmit powerand channel management, guest networking and meshing.traffic types.*when used with Ruckus ZoneDirector controllerSpecificationsTARGET UDP THROUGHPUT • 15-20Mbps (54Mbps bursts)sustainable throughput for a 5000 sq. foot (460 sq meter) area SIMULTANEOUS Vo-Fi CLIENTS• Up to 20SUPPORTED DATA RATES • 54,48,36,24,18,12,11,9,6,5.5,2,1 Mbps CHANNELS• US/Canada: 1-11• Europe (ETSI X30): 1-13 • Japan X41: 1-13AUTO CHANNEL SELECTION • SupportedRF POWER OUTPUT• Max transmit power 24 dBm• Country-specific power settings are configurable TRANSMIT POWER CONTROL • Supported BSSID • Up to eight POWER SAVE • SupportedWIRELESS SECURITY• WEP , WPA-PSK, WPA-TKIP , WPA2 AES, 802.11i• Authentication via 802.1X with the ZoneDirector, local authentication database, support for RADIUS and ActiveDirectory CERTIFICATIONS• U.S., Europe, Australia, Brazil,Canada, Chile, Colombia, Ecuador, Egypt, Hong Kong, India, Indonesia, Korea, Malaysia, Mexico, New Zealand, Pakistan, Philippines, Singapore, South Africa, Taiwan, Thailand, UAE, Uruguay, Vietnam • WEEE/RoHS compliance • Wi-Fi alliance certification • EN 60601-1-2Ruckus Wireless, Inc.880 West Maude Avenue, Suite 101, Sunnyvale, CA 94085 USA(650) 265-4200 Ph \ (408) 738-2065 FxCopyright ©2011, Ruckus Wireless, Inc. All rights reserved. Ruckus Wireless and Ruckus Wireless design are registered in the U.S. Patent and Trademark Office. Ruckus Wireless, the Ruckus Wireless logo, BeamFlex, ZoneFlex, MediaFlex, MetroFlex, FlexMaster, ZoneDirector,SpeedFlex, SmartCast, and Dynamic PSK are trademarks of Ruckus Wireless, Inc. in the United States and other countries. All other trademarks mentioned in this document or website are the property of their respective owners. 801-70654-001 rev 10w w w.r u c k u s w i r e l e s s.c o mPLEASE NOTE: When ordering you must specify the destinationregion by indicating -US, -EU, -AU, -BR, -IN, -KR, -PK, -SA, -UK, -UN, or -UU instead of XX.Product Ordering Information。
IT专业名词英语词汇
IT专业名词英语词汇导语：IT行业又称信息产业，它是运用信息手段和技术，收集、、储存、传递信息情报，提供信息效劳，并提供相应的信息手段、信息技术等效劳的产业。
下面是的IT专业名词，欢迎参考!adapter, serial 串行配接器adapter, standard 标准配接器adapter, super video graphics (SVGA) 超级视频图像配接器adapter, terminal (TA) 终端配接器adapter, video graphics (VGA) 视频图像配接器adaption rate 速率调整adaptive antenna 自适应天线adaptive antenna array 自适应天线阵列adaptive channel allocation (ACA) 自适应信道分配adaptive coding 自适应编码adaptive control system 自适应控制系统adaptive differential pulse code modulation (ADPCM) 自适应差动脉冲编码调adaptive equalization 配接等化adaptive excitation 自适应鼓励adaptive hardware 自适应硬件adaptive jitter buffer 自适应抖动缓冲器adaptive maintenance 自适应adaptive predictive coding (APC) 自适应预测编码adaptive speed control 自适应速度控制add-on card 附加卡add/drop multiplexer (ADM) 增减复用器adder 加法器addition without carry 无进位加法additional charge 附加费additive 相加的additive plating 添加电镀;附加电镀层additive process 相加过程，可加过程additive white Gaussian noise 加性白高斯噪声address 地址;定址address ID 地址识别address broadcast 位址播送address buffer 地址缓冲器address bus 地址总线address counter 地址计数器address cycle 地址周期address decoder 地址解码器address driver 地址驱动器address field 地址栏address format 地址格式address generator 地址产生器address latch enable 地址锁存有效,地址锁存选通address modification 地址修改address modifier 地址修改程序address part 地址部分address pointer 地址指标address register 地址存放器address signaling 地址信令address space 地址空间address strobe 地址选通address transfer 地址传送address, absolute 绝对地址address, base 基底地址address, base-port 根本端口地址address, column 列地址address, dot 点地址address, effective 有效地址address, line 线地址address, logical block (LBA) 逻辑区块地址address, machine 机器地址address, offset 偏移地址address, row 行地址address, segment 分段地址address, valid memory 有效存储器地址address-only cycle 只涉及定址的周期address-only transaction 只涉及定址的事项交易address/data bus 地址/数据总线addressable 可定址addressable connected,disconnected (ACD) 可连接/脱接寻址addressable latch 可定址锁存addressable point 可定址位置addressing 定址法addressing mode 定址模式addressing, absolute 绝对定址法addressing, direct 直接定址addressing, indirect 间接定址adenine 腺呤adenosine-triphosphate 三磷酸腺甘adhesion 附着，黏着adhesion layer 黏附层adhesive 黏合剂adhesive force 黏合力adhesive paper carrier tape 胶纸承载带adhesive string 黏合剂串adhesive tail 黏合剂尾adiabatic expansion 绝热膨胀adiabatic process 绝热过程adiabatic transformation 绝热变换adjacency 相邻adjacency list 相邻列adjacency matrix 相邻矩阵adjacent channel 相邻通道adjacent channel power response (ACPR) 相邻信道功率响应adjacent channel scan (ACS) 相邻信道扫描adjacent-channel interference 相邻通道干扰adjacent-channel selectivity 相邻通道选择性adjunct (AD) 附件adjust 调节;调谐adjustable voltage control 可调节电压控制adjustment, zero 零点调整administrative unit (AU) 管理单元admittance 导纳admittance, short-circuit 短路导纳adsorption 吸附作用advanced audio coding (AAC) 先进的音频编码advanced munications service 先进通讯效劳advanced munications technology satellite (ACTS) 先进的通信技术卫星advanced configuration and power interface 高级配置和电源接口advanced data munication control procedures (ADCCP) 先进通讯控制程序advanced encryption standard (AES) 先进的加密标准advanced input format (AIF) 高级输入格式advanced intelligent work (AIN) 高级智能网advanced mobile phone service (amps) 先进移动效劳advanced peer-to-peer working (APPN) 先进的对等网，先进的端对端网advanced power management (APM) 高级电源管理advanced process control (APC) 先进工艺控制,先进的处理控制advanced radio data information service (ARDIS) 高级无线电数据信息业务advanced router 先进路由器advanced solder mask (ASM) 先进焊接掩膜advantage, actual mechanical 实际机械利益advantage, ideal mechanical 理想机械利益advantage, mechanical 机械利益aeration 充气aerosol 喷雾器agent 代理人;代理商agent, broker 代理人兼agent, data analysis 数据分析代理agent, database 数据库代理agent, execution 执行代理agent, mediator 仲裁代理agent, security 平安代理,保安代理agent, user 用户代理aggregate 聚集aging factor 老化因素agitation, thermal 热震动agitation, ultrasonic 超音波振荡aglet 金属箍，金属饰物air chamber 气室air gap 空隙;气隙air interface 空中接口air knife 气刀air operated 气动air pressure gauge 气压计air pump 气泵air support 空气支承air, pressed 压缩空气air-cooled design 风冷设计，气冷设计air-gap field voltage 气隙场电压air-operated dispensing 气动涂料alarm 警报;警钟alarm condition 警报条件alarm display 告警显示，警报显示alarm indication signal (AIS) 告警指示信号albumin 蛋白质alcohol, isopropyl (IPA) 等丙醇algebraic code excited linear prediction (ACELP) 代数码鼓励的线性预测algorithm 算法algorithm analysis 算法分析algorithm, asynchronous parallel 异步并行算法algorithm, data encryption 数据加密算法algorithm, fast Fourier transform 快速傅立叶变换算法algorithm, internal 内部算法algorithm, layout 布局算法algorithm, least recently used 最近使用算法algorithm, logarithmic 对数算法algorithm, multiple 多重算法algorithm, replacement 替换算法algorithm, routing 路由算法algorithm, software 软件算法algorithm, two-bit 两位算法algorithm, unidirectional backtrace 单向回溯算法algorithmic language 算法语言alias 代号aliasing 混淆现象aligner 调校器alignment 定位;调校alignment error 定位错误alignment hole 定位孔alignment jitter 定位抖动alignment, frame 信息帧定位alignment, optical 光学定位alignment, testing 测试定位alignment, timing 时序调校alkali-halide 硷卤化物alkali-halide substrate 硷卤化物基板alkaline battery 硷性电池all-digital television 全数字电视all-optical works 全光网all-pass function 全通功能allocate 分配;配置allocation 分配;配置allocation, file 档案配置allowable continuous current 容许连续电流alloy 合金alloy junction 合金结alpha particle 阿尔发粒子alpha ray 阿尔发射线alphanumeric 字母，字符alphanumeric key 字母数字键alphanumeric pagers 字母数字寻呼机，数字寻呼机alternate billing service (ABS) 可选计帐业务，交替计帐业务alternate display 交替显示alternate mark inversion (AMI) 交替记号转换alternate routing 迂回路由选择alternate-channel interference 相间通道干扰alternating current (ac) 交流电流alternating function 交替功能alternating-current generator 交流发电机alternating-current pulse 交流电流脉冲alternator 交流发电机alternator, three-phase 三相交流发电机altimeter 高度计alumina 矾土aluminum coil 铝线圈aluminum electrolytic capacitor 铝质电解电容器aluminum interconnect 铝互连线，铝[线]互连ambient conditions 环境条件ambient level 环境水平ambient noise 环境噪声ambient temperature 环境温度amino acid 氨基酸ammeter 安培计ammonia 氨amorphous substance 非晶体物质amorphous-silicon thin-film transistors 非晶硅薄膜晶体管ampacity 安培容量，安流量ampere (A) 安培ampere-hour (Ah) 安培小时ampere-hour capacity 安时容量，安培小时容量ampere-hour efficiency 安培小时效率ampere-turns 安培圈数amplification 放大amplification factor 放大因数amplifier (Amp) 放大器amplifier gain 放大器增益amplifier, audio 声频放大器amplifier, audio-frequency 声频放大器amplifier, bridge 桥式放大器amplifier, class A power A 类功率放大器amplifier, class B power B 类功率放大器amplifier, position 组合式放大器amplifier, current feedback 电流反响放大器amplifier, current sense 电流感应放大器amplifier, differential 差动放大器amplifier, diffusion 扩散放大器amplifier, direct coupling 直接耦合放大器amplifier, direct current 直流放大器amplifier, dual video 双视频放大器amplifier, erbium-doped fiber (EDFA) 铒渗染光纤放大器amplifier, floating diffusion 浮动扩散放大器amplifier, high-frequency 高频放大器amplifier, instrumentation 仪器放大器amplifier, loop pensation 环路补偿放大器amplifier, low-frequency 低频放大器amplifier, multiple-channel 多通道放大器amplifier, narrowband 窄带放大器amplifier, operational (OpAmp) 运算放大器amplifier, operational transconductance (OTA) 运算跨导放大器amplifier, pre-(preamp) 前置放大器amplifier, programmable gain (PGA) 可编程增益放大器amplifier, push-pull 推挽式放大器amplifier, quad operational 四重组装运算放大器amplifier, radio frequency 射频放大器amplifier, sample-and-hold (SHA) 取样及保持放大器amplifier, track-and-hold (THA) 追踪及保持放大器amplifier, video 视频放大器amplitude 振幅amplitude distortion 振幅失真amplitude equalization 幅度均衡amplitude evaluation 振幅测定,振幅评估amplitude flatness 振幅平滑度amplitude modulation (AM) 振幅调制amplitude resonance 振幅谐振amplitude shift keying (ASK) 振幅键控amplitude, angle of 幅角amplitude-frequency response 振幅频率反响analog 模拟analog -to-digital converter (ADC) 模拟/数字转换器analog -to-digital video converter 模拟/数字视频转换器analog / digital (A/D) 模拟/数字analog / discrete test system 模拟/离散测试系统analog baseband chip 模拟基带芯片analog cell 模拟单元analog channel 模拟通道analog circuit 模拟电路analog parator 模拟比较器analog data interchange format (ADIF) 模拟数据交换格式analog dielectric isolation 模拟介电绝缘，模拟介质隔离analog display services interface (ADSI) 模拟显示业务接口analog emulation 模拟仿真。
适配器(Adaptor)模式
public static void main(String[] args) { // TODO code application logic here FileIO f = new FileProperties(); try { f.readFromFile("file.txt"); System.out.println(f.getValue("year")); f.setValue("year", "2000"); f.setValue("month", "11"); f.setValue("day", "20"); f.writeToFile("newfile.txt"); System.out.println(f.getValue("year")); } catch (IOException e) { e.printStackTrace(); } }
例子：动物图形编辑器
重用 我们的程序 现成的程序
策略1－对象适配器
适配器 采用对
//这是个适配器程序，适配Tiger使其具有Tookit的接口 public class TigerAdaptor implements Tookit { public Tiger theTiger; public TigerAdaptor(Tiger t) { theTiger=t; } public void draw() { theTiger.paint(); } }
策略2－类适配器
适配器 采用类继 承
策略2－采用继承
3GPP常用英文缩写全称大全
3GPP常用英文缩写全称大全3GPP 3rd Generation Partnership Project 3代合作项目3G-MSC 3rd Generation Mobile Switching Center 第三代移动交换中心3G—-SGSC 3rd Generation serving GPRS support node 第三代服务GPRS的节点AAL ATM Adaptation LayerAAL2 ATM Adaptation Layer of type 2 ATM适配层2AAL5 ATM Adaptation Layer of type 5 ATM适配层5ACIR Adjacent Channel Interference Ratio 邻道干扰比ACLR Adjacent Channel Leakage power Ratio 邻道泄露功率比ACS Adjacent Channel Selectivity 邻道选择性A&C Authentication and CipheringACFE Access Control Function EntityAI Acquisition IndicationAICH Acquisition Indication ChannelALCAP Access Link Control Application Part 介入链路控制应用部分AM Acknowledged Mode (of RLC)AMC Adapt Modulation Coding 自适应调制编码AMR Adaptive Multi Rate (Transcoder)AN Access NetworkAOA Angle Of ArrivalAP Application ProcessAPDU Application Protocol Data UnitAPId Access Point IdentifierAPN Access Point NameAPS Automatic Protection SwitchingARIB Association of Radio Industries and BusinessARQ Automatic Repeat Request 自动重复请求ASAP Alarm Severity Assignment ProfileASN.1 Abstract Repeat Request 吃偶像予以描述1ATC ATM Transfer CapabilityATM Asynchronous Transfer Mode 异步传输模式AUC Authentication Centre 鉴权中心AUG Administrative Unit GroupAU-n Administrative Unit n with n being 4 or 3AUTN Authentication TokenAWGN Added White Gaussian NoiseBCCH Broadcast Control Channel 广播控制信道BCH Broadcast Channel 广播信道BER Bit Error Rate 误比特率BGCF Breakout Gateway Control Function 突破网关控制功能BLER Block Error RateBMC Broadcast Multicast ControllerBPSK Binary Phase Shift KeyingBS Base StationBSC Base Station Controller 基站控制器BSS Base Station SystemBSS Base Station subsystem 基站子系统BTS Base Transceiver Station 基站收发机C- Control-CA Capacity AllocationCAA Capacity Allocation AcknowledgementCAC Connection Admission ControlCAMEL Customized Applications for Mobile network Enhanced Logic CAS Channel Associated SignallingCASC Current Alarm Summary ControlCBR Constant Bit RateCC Call Control 呼叫控制CCBS Call Completion Busy SubscriberCCCH Common Control Channel 公共控制信道CCH Control Channel 控制信道CCP Communication Control PortCCPCH Common Control Physical Channel 公共控制物理信道CCTrCH Coded Composite Transport ChannelCD Capacity Deallocation (radio context)CD Calibration Data (O&M context)CDA Capacity Deallocation AcknowledgementCDMA Code Division Multiple Access 码多分址CDR Charging Detail RecordCDV Cell Delay VariationCDVT Cell Delay Variation ToleranceCFN Connection Frame Number 连接帧号CID Channel IdentifierCk Cipher KeyCLP Cell Loss PriorityCM Configuration ManagementCM Call Management (in e.g. CM Service Request)CmCH Common Transport ChannelCMIP Common Management Information ProtocolCMIS Common Management Information ServiceCMISE Common Management Information Service ElementCN Core Network 核心网C-n Container-n (n=1-4)COL Collocated EquipmentCP Chip PeriodCPCH Common Packet ChannelCPICH Common Pilot ChannelCPS Common Part SublayerCQI Channel Quality Indicator 信道质量指示CRC Cyclic Redundancy Check 循环冗余检验CRCI CRC IndicatorCRC-N Cyclic Redundancy Check-NCRNC Controlling RNC 控制的无线网络控制器c-RNTI RNTI allocated by CRNCCS Circuit Switched 电路交换CSCF call server control function 呼叫服务器控制功能CSES Consecutive Severely Errored SecondCSN Ciphering Sequence NumberCSUM ChecksumCTCH Common Traffic ChannelCTDMA Code Time Division Multiple AccessCTP Connection Termination Point (OAM context)CTP Common Transport Protocol (Protocol context)DBR Deterministic Bit RateDC Dedicated Control (SAP)DCA Dynamic Channel Allocation 动态心道分配DCCH Dedicated Control Channel 专用控制信道DCH Dedicated ChannelDCN Data Communication NetworkDL DownLink 下行链路DOA Direction of Arrival 到达方向DoCoMo Do Communication with MobilesDPCCH Dedicated Physical Control ChannelDPCH Dedicated Physical Channel 专用物理信道DPDCH Dedicated Physical Data ChannelDRAC Dynamic Resource Allocation ControlDRNC Drift RNCDRNS Drift RNSDRX Discontinuous ReceptionDS-CDMA Direct-Sequence Code Division Multiple Access DSCH Downlink Shared Channel 下行共享心道DT Data TransportDTCH Dedicated Traffic Channel 下行业务信道DTX Discontinuous TransmissionDwPCH Downlink Pilot Channel 下行导频信道DwPCH Downlink Pilot Time slot 下行导频时隙EBER Excessive Bit Error RatioECASC Extended Current Summary Alarm ControlEFCI Explicit Forward Congestion IndicationEFD Event Forwarding DiscriminatorEIR Equipment Identity Register 设备表示寄存器EIRP Equivalent Isotropic Radiated PowerE-OTD Enhanced OTDES Errored SecondETSI European Telecommunication Standardisation Institute F8 access link encryption functionFACH Forward Access Channel 前向接入信道FAUSCH Fast Uplink Signalling ChannelFBI Feed Back IndicatorFCS Frame Check SequenceFDD Frequency Division Duplex 频分双工FDMA Frequency Division Multiple AccessFEC Forward Error CorrectionFEEB Far End Errored BlockFEES Far End Errored SecondFER Frame Erasure RateFESES Far End Severely Errored SecondFFS For Further Study 进一步研究FM Fault ManagementFP Frame Protocol 帧协议FT Frame Type 帧类型FTAM File Transfer Access ManagementFTP File Transfer ProtocolGb Gb interface (between SGSN and BSC)GC General Control (SAP)GCRA Generic Cell Rate AlgorithmGFR Guaranteed RateGGSN Gateway GPRS Serving Node 网管支持节点GMM MM for GPRS services 移动性管理GMSK Gaussian Minimum Shift KeyingG-PDU T-PDU plus GTP headerGPRS General Packet Radio Service 全球定位系统GPRS-CSI GPRS CAMEL Subscription Information GPS Global Positioning SystemGRNC Generic RNCGSM Global System for Mobile communicationsGTP GPRS Tunnelling Protocol 隧道协议GTP-u GTP user planeHCS Hierarchical Cell StructureHE Home EnvironmentHEC Header Error ControlHFN Hyper Frame Number 超帧号HLR Home Location Register 归属位置寄存器HHO Hard HandoverHO HandoverHOP High Order PathHOVC Higher Order Virtual ContainerIBTS uplink Interference signal power level at Node BICB Inter Carrier BoardICD Interface Control DocumentICH Indicator CHannelICI Inter Carrier InterfaceIE Information ElementIEC Incoming Error CountIETF Internet Engineering Task ForceIK Integrity KeyIMA Inverse Multiplexing for ATMIMEI International Mobile Equipment IdentityIMEISV International Mobile Equipment Identity Software VersionIMSI International Mobile Subscriber Identity (identical for IMUI; used in GSM context) 国际移动用户标识码IMUI International Mobile User Identity (identical to IMSI; seems to replace IMSI in UMTS context)INI Inter Network InterfaceIP Internet ProtocolISCP Interference Signal Code PowerISDN Integrated Services Digital NetworkISF Incoming Signal FailureIS-FL Idle Slot Forward LinkISID Idle Signal IdentificationISO International Organisation for StandardizationIT Information TechnologyITU International Telecommunication Union 国际电联Iu Reference point between Access and Serving Network domainsIub Iub interface (between Node B and RNC)Iu-CS Iu towards the Circuit Switched-Service Domain of the Core NetworkIu-PS Iu towards the Packet Switched-Service Domain of the Core NetworkIur Iur interface (between RNC and RNC)IWF Inter Working FunctionIWU Inter Working UnitJD Joint DetectionKbps kilo-bits per secondKSI Key Set IdentifierKsps kilo-symbols per secondL1 Layer 1 (physical layer)L2 Layer 2 (data link layer)L3 Layer 3 (network layer)L3-CE Layer 3 Compression EntityLAC Link Access ControlLAI Location Area IdentityLAN Local Area NetworkLAPD Link Access Protocol for D-channelLB Laser BiasLCAF Location Client Authorisation FunctionLCCF Location Client Control FunctionLCCTF Location Client Coordinate Transformation FunctionLCD Loss of Cell Delineation (transmission context)LCD Low Constrained Delay (traffic context)LCF Location Client FunctionLCS Localisation Client ServiceLDD Low Delay DataLIR Limited IP Routing entity (in the RNC)LLC Link Layer ControlLMT Local Maintenance TerminalLMU Location Measurement Unit 位置测量单元LNA Low Noise AmplifierLOF Loss of FrameLOP Low Order PathLOP Loss of PointerLOS Loss of SignalLPA Linear Power AmplifierLSA Localised Service AreaLSB Least Significant BitLSBF Location System Billing FunctionLSCF Location System Control FunctionLSN Local Sub NetworkLSPF Location Subscriber Privacy FunctionLT Laser TemperatureLTOA Latest Time of ArrivalMA Multiple AccessMAC Medium Access Control 媒质接入控制MAC-c MAC entity handling common channels (RACH, FACH)MAC-d MAC entity handling dedicated channels (DCH)MAC-I Message Authentication Code used for data Integrity of signalling messages MAC-sh MAC entity handling shared channel (DSCH)MAHO Mobile Assisted HandoverMAP Mobile Application Part 移动应用部分MC CDMA Multiple Carrier CDMA 多载波码分多址MC TDMA Multiple Carrier CDMA 多载波时分多址MBS Maximum Burst SizeMCC Mobile Country CodeMCD Manual Configuration DataMcps Mega-chips per secondMD Macro-diversityME Mobile Equipment 移动设备MEHO Mobile evaluated handoverMGW Media Gateway 媒体网关MIB Management Information Base 控制信息块MM Mobility ManagementMNC Mobile Network CodeMNRG Mobile station Not Reachable for GPRS flagMNRR Mobile station Not Reachable ReasonMO Mobile OriginatedMOHO Mobile Originated HandoverMPLS Multi Protocol Label Switching 多协议标签交换MRFC Media Resource Function Controller 媒体资源功能控制器MRFC Media Resource Function Processor 媒体资源功能处理器MS Multiplex Section (transmission context)MS Mobile Station (GSM or security context)MS-AIS Multiplex Section Alarm Indication SignalMSB Most Significant BitMSC Multi-Slot Cell (MPSR context) 移动业务中心MSC Mobile services Switching Centre (Core Network Context) MSID Mobile Station IdentifierMSOH Multiplex Section OverheadMSP Multiplex Section ProtectionMS-RDI Multiplex Section Remote Defect IndicationMS-REI Multiplex Section Remote Error IndicationMSTE Multiplex Section Terminating ElementMT Mobile Terminated (call context)MT Mobile Terminal (equipment context)MTP Message Transfer Part 消息传输部分MUI Mobile User IdentifierNAS Non Access Stratum 非接入层NBAP Node B Application Part Node B应用部分NCP Node B Control PortNCSES Number of Consecutive Severely Errored SecondNDF New Data FlagNE Network ElementNEHO Network evaluated handoverNEM Network Element ManagerNMC Network Management CentreNNI Network Node Interface (includes INI and ICI interfaces) NP Nectar PilotNPC Network Parameters ControlNRT Non-Real TimeNSS Network Sub SystemNT Nectar TelecomNt Notification (SAP)NW NetworkN-PDU Network PDUO&M Operation and Maintenance 操作管理OAM Operation Administration and MaintenanceOCCCH ODMA Common Control ChannelODCCH ODMA Dedicated Control ChannelODCH ODMA Dedicated ChannelODI Outgoing Defect IndicationODMA Opportunity Driven Multiple AccessODTCH ODMA Dedicated Traffic ChannelOEI Outgoing Error IndicationOFS Out of Frame SecondOMC Operation and Maintenance CentreOOF Out of FrameORACH ODMA Random Access ChannelOS Operation SystemOSF Offset FieldOSI Open System InterconnectionOSL Optical Signal LevelOTD Observed Time DifferenceOVSF Orthogonal Variable Spreading FactorPA Power AmplifierPC Power Control 功率控制PCCH Paging Control Channel 寻呼控制信道PCCPCH Physical Downlink Shared Channel 基本公公控制物理信道PCF Positioning Calculation FunctionPCH Paging Channel 寻呼信道PCM Pulse Code ModulationPCR Peak Cell RatePDCP Packet Data Convergence protocolPDH Plesiochronous Digital HierarchyPDN Packet Data NetworkPDSCH Physical Downlink Shared Channel物理下行链路共享信道PDP Packet Data ProtocolPDU Protocol Data UnitPG Processing GainPHY Physical layerPhyCH Physical ChannelPI Paging IndicatorPICH Page Indicator ChannelPID Packet IdentificationPJC Pointer Justification CountPJE Pointer Justification EventPkg PackagesPLM Payload MismatchPLMN Public Land Mobile Network公共陆地移动网PM Performance Management/Performance MonitoringPMM MM for PS domainPN Pseudo NoisePOH Path OverheadPPI Plesiochronous Physical InterfacePPM Parts Per MillionPRACH Physical Random Access Channel 物理随机接入信道PRCF Positioning Radio Co-ordination FunctionPS Packet Switched 分组交换PSAP Presentation Service Access PointPSC Protection Switch CountPSD Protection Switch DurationPSMF Positioning Signal Measurement FunctionPSN Plane Switch NodePSTN Public Switched Telephone Network 公共电话交换网络PTE Path Terminating ElementPVC Permanent Virtual ConnectionP-TMSI Packet TMSI (equivalent to P-TMUI, used in GPRS context)P-TMUI Packet TMUI – (equivalent to P-TMSI, new name for it in the UMTS context) PTR PointerPUF Power Up FunctionQAM Quadrature Amplitude Modulation 政教幅度调制QE Quality Estimate 质量评估QoS Quality of Service 业务质量QPSK Quadrature Phase Shift KeyingRA Routing AreaRAB Radio Access Bearer 无线接入承载RAC Routing Area CodeRAC Radio Admission ControlRACH Random Access Channel 随即接入信道RAI Routing Area Identity (GPRS or Iu-PS context)RAI Remote Alarm Indication (transmission context)RAID Redundant Array of Independent DisksRAN Radio Access NetworkRANAP Radio Access Network Application Part 无线接入网应用部分RAND Random ChallengeRB Radio BearerRDI Remote Defect IndicationRDN Relative Distinguished NameREI Remote Error IndicationRF Radio FrequencyRFC Request For CommentRFN Reference Frame NumberRL radio link 无线链路RLC Radio Link ControlRLCP Radio Link Control ProtocolRLS Radio Link SetRLs Radio LinksRNC Radio Network Controller 无线网络控制器RNCC Radio Network Connection ControlRNS Radio Network Subsystem 无线网络子系统RNSAP Radio Network Subsystem Application Part 无线网络子系统应用部分RNTI Radio Network Temporary Identity 无线网络临时识别RP Radio ProcessingRR Radio Resources 无线资源RRC Radio Resource Control 无线资源控制RRM Radio Resource ManagementRS Regenerator sectionRSCP Received Signal Code Power after despreadingRSOH Regenerator Section OverheadRSSI Received Signal Strength IndicatorRT Real TimeRU Resource UnitRX ReceiveSA Service Area 服务区域SAAL Signalling AAL (equivalent to SSCF over SSCOP over AAL5)SABP service area broadcast Protocol 服务区广播协议SACCH Slow Associated Control ChannelSAP Service Access Point 服务接入点SBM Subnetwork Bandwidth Management 子网带宽管理SBR Statistical Bit RateSC Service ControlSCCH Synchronization Control Channel 信令链接控制部分SCH Synchronization Channel 同步信道SCCP Signalling Connection Control PartSCD Selective Cell DiscardSCR Sustainable Cell RateSCTP Simple Control Transmission Protocol 简单控制传输协议SD Supervision Data (context configuration management)SD Signal Degrade (context SDH)SDCCH Stand-Alone Dedicated Control ChannelSDH Synchronous Digital HierarchySDU Service Data UnitSES Severely Errored SecondSF Signal Fail (transmission context)SF Spreading Factor (radio context)SFN System Frame Number 系统帧号SG Study GroupSGSN Serving GPRS Support Node 服务支持节点SHO Soft Hand OverSIB Systems Information Block 系统信息块SIM Subscriber Information Module 用户识别模块SIR Signal-to-Interference RatioSLF Subscription Location Function 签约位置功能SLM Signal Label MismatchSM Session Management 会话管理SMS Short Message ServiceSN Serving NetworkSN Sequence NumberSNMP Simple Network Management ProtocolSOH Section OverheadSONET Synchronous Optical NetworkSP Switching PointSPA Signalling Point AccessibleSPI Signalling Point Inaccessible (SS7 context)SPI Synchronous Physical Interface (SDH context)SPROC System PROCessorSRNC Serving RNC 服务无线网络控制功能SRNS Serving RNS 服务RNSs-RNTI RNTI allocated by SRNCSSA Signalling Subsystem AccessibleSSADT Service Specific Assured Data TransferSSCF Service Specific Coordination Function 具体业务协调功能SSCOP Service Specific Connection-Oriented Protocol 特定业务面向连接协议SSP Signalling Subsystem ProhibitedSSSAR Service Specific Segmentation And ReassemblySSTED Service Specific Transmission Error DetectionSTF Start FieldSTM Synchronous Transport ModuleSTM(-N) Synchronous Transport Module (-N)STS(-N) Synchronous Transport Signal (-N)STTD Space Time Transmit DiversityT-SGW Transport Signalling Gateway 传输信令网关TB Transport Block 传输块TBC To Be ConfirmedTBD To Be DefinedTBF Transport Block FormatTBS Transport Block Set 传输块集TCH Traffic ChannelTCM Tandem Connection MonitoringTCOH Tandem Connection OverheadTCP Transport Control ProtocolTCP Transport Control ProtocolTC-RDI Tandem Connection Remote Defect IndicationTC-REI Tandem Connection Remote Error IndicationTCT Tandem Connection TraceTCTE Tandem Connection Terminating ElementTDD Time Duplex DivisionTE Terminal EquipmentTEID Tunnel Endpoint IDTFCI Transport Format Combination Indicator 传输格式组合指示TFCS Transport Format Combination Set 传输格式组合集TFI Transport Format Indicator 传输格式指示TFS Transport Format Set 传输格式集TFT Traffic Flow TemplateTFTP Trivial File Transfer ProtocolTIM Trace Identifier MismatchTLLI Temporary Logical Link IdentifierTM Transparent Mode (of RLC)TMN Telecommunication Management NetworkTMSI Temporary Mobile Subscriber Identity (used in GSM context, equivalent to TMUI) 临时移动用户识别号TMUI Temporary Mobile User Identity (new name for TMSI in the UMTS context)TN Termination NodeTOA or ToA Time Of Arrival 到达时间TOAWE TOA Window End pointTOAWS TOA Window Start pointTP Termination PointTPC Transmit Power Control 发射功率控制T-PDU Original packet, for example an IP datagram, from UE or an external PDNTR Threshold ResetTRX Transmitter/ReceiverTSID Test Signal IdentificationTSS Telecommunication Standardization SectorTSN Transmission Sequence NumberTTC Telecommunication Technology CommitteeTTI Time Transmission Interval (Radio Context)传输时间间隔TTI Trail Trace Identifier (O&M context)TTP Trusted Third Party (security context)TTP Trail Termination Point (transmission context)TU Tributary UnitTUG Tributary Unit GroupTUG(-n) Tributary Unit Group (-n)TU-n Tributary Unit-nTX TransmitU- User-UARFCN UTRA Absolute Radio Frequency Channel NumberUAS Unavailable SecondUBR Unspecified Bit RateUDD Unconstrained Delay DataUDP User Datagram ProtocolUE User Equipment 用户设备UEA UMTS Encryption AlgorithmUEFN User Equipment Frame NumberUIA UMTS Integrity AlgorithmUL UpLink 上行链路UM Unacknowledged Mode (of RLC)UMTS Universal Mobile Telecommunication SystemUNEQ UnequippedUNI User to Network InterfaceUP User PlaneUPC Usage Parameters ControlURA User Registration AreaUSCH Uplink Shared Channel 上行共享信道USIM UMTS Subscriber Identity Module 用户识别模块UTRA UMTS Terrestrial Radio AccessUTRAN UMTS Terrestrial Radio Access Network 陆地无线接入网Uu Reference point between User Equipment and Infrastructure domains, UMTS radio interfaceUUI User to User IndicatorV A Voice Activity (factor)VBR Variable Bit RateVC Virtual Channel 虚电路VCC Virtual Channel ConnectionVCI Virtual Channel IdentifierVC-n Virtual Container n (n is 11, 12, 2, 3 or 4)VLR Visitor Location Register 访问位置寄存器VP Virtual PathVPC Virtual Path ConnectionVPI Virtual Path IdentifierW-CDMA Wideband CDMAWG Working Group 工作组WG-n Working Group (of 3GPP)WTR Wait-to-RestoreXMAC-I eXpected Message Authentication Code used for data Integrity of signalling messagesXOR eXclusive ORXPU AuXiliary Processing UnitXRES Expected Response 期待的用户响应本文来自CSDN博客，转载请标明出处：/fengyuruhui/archive/2009/02/10/3873460.aspx。
电子产品常用英文词汇
41. 恒压源 constant voltage source
-可编辑修改-
。
42. 纹波电流 ripple current 43. 涌入电流 inrush current 44. 空载电流 no-load current 45. 电网 power system 46. 死区时间 dead time 47. 浮充电压 float charge voltage 48. 正向电压 forward voltage drop 49. 续流二极管 freewheel diode 50. 肖特基二极管 schottky 51. 整流桥 bridge rectifier 52. 超快速整流器 ultra fast rectifier 53. 检测电阻 sense resistor 54. 振荡电阻 timing resistor 55. 散热片 thermal slug/heat sink/ radiator 56. 断路器 breaker 57. 过流保护器 circuit breaker 58. 自由运行 free running 59. 满负载 full load 60. 过载 overload 61. 轻载 light load 62. 加载 upload 63. 静态 static （state） 64. 动态 dynamic （state） 65. 稳态的 steady 66. 静电 static electricity 67. 电源调整率 line regulation 68. 负载调整率 load regulation 69. 满载效率 full load efficiency 70. 最佳效率 optimum efficiency 71. 输出效率 output efficiency 72. 峰值效率 peak efficiency 73. 标称效率 declared efficiency 74. 视在功率 apparent power 75. 有功功率 active power 76. 无功功率 reactive power 77. 功率因数 power-factor 78. 耗散功率 power dissipation 79. 空载损耗 no-load loss 80. 关断状态 off state 81. 电源工作电压 operating supply voltage 82. 电压参考 voltage reference 83. 参考值 reference value 84. 反馈 feedback 85. 产品型号 part number
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
A Complete Bibliography of Publications in the C/C++Users Journal:2000–2009Nelson H.F.BeebeUniversity of UtahDepartment of Mathematics,110LCB155S1400E RM233Salt Lake City,UT84112-0090USATel:+18015815254FAX:+18015814148E-mail:beebe@,beebe@,beebe@(Internet) WWW URL:/~beebe/22October2005Version1.02Title word cross-reference #1[Hic00].#2[Cac00a].#3[Fos00].#4[Pet00].#5[Tim01].#6[Cha01].#7[Now01].#8[Abr02].3[Tel00].N[Bav00b,Smi00].X[Thi00]. Y[Thi00].*[Now01].-[Thi00].-D[Tel00].-Dimensional[Bav00b].-Way[Smi00]. .NET[Lip02,Sch00d,Smi02].0x[Sut02f].20th[Ano01b].21st[Sch01a].4[Mey02c].Accelerated[Gla01].Access[Dix01,Kle00,Mor00a,Yor01]. Accident[KM01a].across[Lop01]. Adaptable[Kem02b].Adapter[May01]. Adapters[Dew02c,Dew02d].Adaptive[Phi00c].Adaptors[Bec02e,PW00].Adding[Sta01]. Adventures[Sch00a].Advice[Mey02a]. Alan[Sch01c].Algol[Pla00a].Algorithm[HR02,Lor01,Phi00a]. Algorithms[All00c,Ano02a,Bec02d,Buc02,Dew01c,Koe01,Mey01h,Mey01i]. Allocators[Vla02].Alone[All02b]. Angelology[KB00a].Annealing[Buc01]. Anniversary[Ano01b].12Application[Bro00,Tru02].Applications[Mor00b,Mot02,Pad01,Ten02].Applied[KB00c].Applying[Abl02].Approach[K¨a m01]. Apps[Ano02e].Aquaman[Sch00a]. Arbitrary[Rin01].Array[KM02a,Mey02c].Arrays[All00a,Bav00b,Mey01e,Mey01f, Mey02d,Sak00a,Sak00b].Art[All02a].Ask[Sch01h].Association[Til01]. Asynchronous[Nak01].auto ptr[Vla01]. Automated[All00g].Avoiding[KM02a]. Axis[Bra00].Back[Bri01f,Dew01f].Backtracking[Lab00].Bad[Bec00h]. Ballad[Sch00k].Based[Aus01c,Bra00,Cac00b,Fau00,Gui00c,Mor00a,Sca00,Smi00].Basic[All00b].Basics[Bec00e].Be[Gri01]. Began[Mey00c].Behavior[Yod01]. Behind[Vla01].Best[All02g].Better[Bec00i].between[Lin01].BGL[Abl02].Big[Bri01e,Sut01b].Binary[Hub02,KM01c].Bit[Aus01a,Dew02a,Dew02b].Bit-Wise[Dew02a,Dew02b].Bits[Bec00f]. Bitsets[Aus01a].Block[KB01a].Blocks[Nas00,Que00].Book[Sut02a,Bri00a,But00,Cir01,For01, Gla01,K¨a m01,Phi00b,Wal01].Books[Ano01g].bool[Sch02a,Mey02a]. Boost[Kar02].Boost.Threads[Kem02a]. Both[All02g].Boxes[Kem02b].Boyer[Ber00].Boyer-Moore[Ber00]. Bridge[May01].Brother[All02a,Bri01e]. Browser[Mor00a].Browser-Based[Mor00a].Buffers[Kue05]. Building[Bav00a,Hub01a].C[Sut02a,Bri00a,But00,Cir01,For01,GF01,Gla01,K¨a m01,Pla00d,Pla00b,Pla00f,Pla00e,Pla00c,Sut02e,Sut02f,Zol01, Abr02,Ano01b,Ano01a,Ano01e,Ano02a,Ano02e,Bat00,Bav00a,Bec02a,Bec02b, BMG02,Bri00n,Cac00a,Cav02,Cha01,Col02,Cre00,Fau00,Fos00,Gat02,Gon00, Hic00,Koe01,KM01a,KM01d,KM01b,KM01e,KM01c,KM02d,KM02e,KM02a, KM02b,KM02c,KL02,LK00,Laf00,Lin01, Lip02,Liu01,Mey00b,Mey00c,Mey00a, Mey01a,Mey01b,Mey01c,Mey01d,Mey01e, Mey01f,Mey01g,Mey02a,Mey02b,Mey02c, Mor02,Nel01,Now01,Pet00,Pin02,Pla02, Rin01,Sak00a,Sak00b,Sew02,Smi02,Str02b,Str02a,Str02c,Sut01a,Tim01].C#[Ano01g,Lip01].C/C[Cir01,Pla00d,Pla00b,Pla00f,Pla00e, Pla00c,Abr02,Ano01b,Cac00a,Cha01,Fos00,Hic00,Lin01,Now01,Pet00,Tim01]. C/C[KL02,Pla02].C99[Mey00b,Mey00a]. Cafe[Sch00g].Calculations[Bec00d].Call[Hub01b].Callbacks[Bat01].Calling[Sew02].Case[Str02b,Str02a]. Casts[Bec00a].Catching[Gui00a].CE[Gar00].Century[Sch01a].CGI[Mor00b].Character[Sak00a,Sak00b].Cheese[All02f].choice[Sch02a].Circles[Dew02e].Class[Bav00b,Cha02,Ehl00,Fau00,Fox01, KM02b,Nik00,Pad01,Sew02,Swa00,Tru02]. Classes[All00e,Bec01d,Cal00,Cha01,Nie00,Pan01,Pee01,Que00,Rei00,Sme01, Til01].Clipboard[Rog00a].Code[Bon01,Geo02,Hub02].Coder[KB01a].Codes[Gui00a]. Collections[All00c,Kle00].COM[Kou00,LK00,Mor00a]. Combinatorial[Lab00].Combining[Ber00].Comes[KB00e]. Command[Rog00a].Comment[Tim01]. Common[Bec00b,Bec00c,Dew00,Dew01c, Dew01d,Dew01e,Dew01b,Dew01a,Dew01f, Dew02c,Dew02d,Dew02e].comp.cuj.qa.moderated[Sch00b]. Compare[KB00d].Comparisons[Bec00f]. Compatibility[Str02b,Str02a].3Compatible[Ano01f].Compilation[Bec00l].Compiler[Col02]. compilers[Sch02a].Completely[Aus02a]. Complex[Aus02b].Complexity[Bri01j]. Component[Gui00c].Component-Based[Gui00c]. Components[Bia00,May01].Compound[Mey01a].Compressed[Yor01].Computational[Abl02].Concepts[Vla01]. Configuration[Bro00].Conformance[Pla00f,Pla00e,Sut01a]. Const[Aus01b].Constants[Cac00a]. Constructed[Mor02].Constructor[Sut00].Container[Bec01b,KM01e,PW00]. Containers[Aus01c,Bec01c,Sut01b]. content[Sch02a].Contour[Wu00]. Contributing[Cir01].Control[Dew00]. Conventional[Dew01c].Conversions[Bec00a].Converting[Bia00]. Cookie[Pad01].Cool[Bri01g].Copying[Rog00a].CORBA[May01].Core[K¨a m01].Correction[And02].Could[All00g].Counting[Bat00,KM02c]. cout[Ano01-33].Creating[Ehl00,Fos00,Hic00].Creation[Wu00].Cross[Gui00b,Kem02b,Mor01].Cross-Platform[Gui00b,Kem02b,Mor01]. Custom[Vla02].Customize[Yod01]. Cyclic[Ber02].D[Tel00].Dance[Sch02e].Data[Bra00,KM02e,Lin01,Thi00].Data-Based[Bra00].Debug[Nel01]. Debugging[Fox01,Gui00c,Vla02,Zac01]. Debunker[KB00c,KB00d,KB00b,KB00e, KB00a,KB01c,KB01b,KB01e,KB01a,KB01d,KB02].Declarations[Mey01b]. Decryptor[Zol01].Defining[Aus01b]. Delegate[Lip01].Delegates[Smi02]. Dependencies[Ber02].Depth[Phi00d]. Derivable[Cha01].Design[Bat01,Bec00b,Bec00c,Bec02c,Laf00,Sut02a].Destructing[Pet00].Determination[Bra00].Development[Cum02,Gui00b,KL02]. Deviation[Sch00h].Dialog[Kem02b]. Dictionary[And02].Dies[Sch00c].Different[Aus02a].Dimensional[Bav00b]. Directories[Nik00].Directory[Mor00a]. Discontinuum[Sch02d].Distinguishing[Mey01h].Do[Bri01d]. Document[Mor00b].Documenting[Peh01].Documents[Bav00a].Don’t[Sch02b]. Double[Phi00a].Dragons[Gri01].Driven[Bec02c,KL02].Drowning[Bri01e]. Dynamic[Gon00].Easier[Ano01a,Koe01,KM01a,KM01d, KM01b,KM01e,KM01c,KM02d,KM02e, KM02a,KM02b,KM02c].Easy[Bat01,GF01,Gon00,Ano01-33]. Economical[Bat00].Editor[All02a,All02g,All02b,All02d,All02c,All02f,All02e,Ano01c,Ano01d,Ano02b,Ano02c,Ano02d,Bri00b,Bri00c, Bri00d,Bri00e,Bri00f,Bri00g,Bri00h,Bri00i,Bri00j,Bri00k,Bri00l,Bri00m,Bri01e,Bri01d,Bri01h,Bri01f,Bri01i,Bri01g,Bri01j,Bri01a,Bri01b,Bri01c]. Editors[Cir01].Effective[Mey01j,Wu00]. Efficient[Lem02,Lor01,Pyr02].Elegant[Hub01b].Embedded[Fau00,Ano01e].Emperor[Bri01h].Encapsulating[May01,Rog02]. Encapsulation[Mey00d].Engineering[K¨a m01].Environment[Hub02].Error[Bec00d,Off00,Zol01].Errors[Vla02].Euclid[All02b].Events[Smi02].eWriter[Sch01d].Excel[LK00].Exception[Ano01e,KM02b, KM02c,Nie02,Sta01,Sut02d].Exceptional[Bri00a].Exceptions[Nie02,4Sch00a,Sch00k,Sch00b,Sch00c,Sch00d, Sch00e,Sch00h,Sch00f,Sch00g,Sch00i,Sch00j,Sch01c,Sch01b,Sch01a,Sch01d,Sch01e,Sch01i,Sch01f,Sch01g,Sch01h,Sch01j,Sch02b,Sch02c,Sch02d,Sch02e]. Exchanging[Lin01].Execution[Nak01]. exit[Pla00c].Experts[Sch01f].Export[Sut02c].Expressing[Wei02]. Expressions[Ber00].Extending[Ano02e,Til01].Extensible[Sut02b].Extensions[Bec00j,Lip02].Extracting[Thi00].Factories[Ehl00].Failures[Sut00].Farm[Sut01c].Fi[Sch00f].File[Aus01c,Yor01].File-Based[Aus01c]. Files[Rog00a].Film[Sch01c].Filter[Peh01].Filtering[Kue05].Filters[Phi00c].Finding[Bas00].First[KB00e].Flexible[Lem02,Mey02c]. Flies[KB01c].Floating[Bec00d,Bec00e,Bec00f].Floating-Point[Bec00d,Bec00e,Bec00f]. Form[PW00].Formatted[All00d]. Formatters[Sut01c].FORTRAN[Mey00c].Forum[All02a,All02g,All02b,All02d,All02c,All02f,All02e,Ano01c,Ano01d,Ano02b,Ano02c,Ano02d,Bri00b,Bri00c, Bri00d,Bri00e,Bri00f,Bri00g,Bri00h,Bri00i,Bri00j,Bri00k,Bri00l,Bri00m,Bri01e,Bri01d,Bri01h,Bri01f,Bri01i,Bri01g,Bri01j,Bri01a,Bri01b,Bri01c]. Framework[All00g,BMG02,Hsi00,Mor01]. Fugit[Sch00j].Function[Aus01d,Bec02e, Dew01e,Hub01b,Nas00,Sut01f].Functions[Mey00d,Mey02b,Yod01]. Fungible[Dew00].Fuzzy[Sch01e].Game[Bri01i,Cum02].GCC[Gui00b]. Gear[All02c].Gear-Head[All02c].Geek[Sch00g].General[BMG02]. Generalizing[Vla01].Generation[Geo02].Generic[Bav00b,Bec00j,Bec00m,Bec00l, Bec00k,Bec01c,Bec01b,Bec01f,Bec01e, Bec01d,Bec02c,Bec02d,Bec02e,Bec02a, Bec02b,Cac00a,Dew01c].Genetic[Buc02]. Geometry[Abl02].Global[Ten02]. GNOME[Pin02].GNU[Col02,Zac01]. GNU/Linux[Zac01].Going[Bri01f]. Good[All02d,Bec00h,Sch01b].Graphic[Peh01].Great[Sch01i].Grow[KM01d].Gtk[Ano02p].GUI[Mor01].Guidelines[Mey01j,Pee01]. habits[Sut02e].Hand[Mey01i].Hand-Written[Mey01i].Handle[KM02b]. Handlers[Bec00f].Handles[KM02b,KM02c].Handling[Ano01e].Handy[Fox01]. Happen[Bec00h].Head[All02c].Hello[Ano01-33].Here[Gri01]. Homework[Bri01d].HTML[Bav00a,Mor00b].Humor[All02c]. I/O[All00b,Aus01d].Identifying[Ber02]. IDEs[Sor01].Idioms[Dew01a].II[Wal01]. Image[Lor01,Phi00c,Qur01].Images[Phi00d].Implementation[Bar00]. Implementing[Gat02,Liu01].Import[Peh01,All00a,All00b,All00c,All00d,All00e,All00f].Important[All02c,All02e].Improve[Mey00d].Improved[Cac00b,Wei02].Index[Fos00,Hic00].Inheritance[Sut02b]. Initializations[Mey01b].Inline[Mey02b]. Inner[All00e].Integers[Mey00a,Mey01c,Mey01d]. Integrating[Cal00].Integration[GF01]. Interface[Peh01].Interfaces[All00e]. International[Sch01f].Interpolation[Lou00].Interrupt[Gat02]. Interval[Dan00].Introducing[Mey00b]. Introduction[Bec00k,Lou00,Nas00]. Intrusive[KM02c].Intuitive[Mor01]. Iostream[Ano01f].5Iostream-Compatible[Ano01f]. IOStreams[But00,Aus00,Off00].Irae[Sch00c].Items[All02c].Iterator[Dew02d,Mey01j].Iterators[Aus01b,Aus01f,Bec01b,Bec01f, Bec01e].Java[Lin01,Pla00d].java.*[All00a,All00b, All00c,All00d,All00e,All00f].JNI[GF01]. Journal[Ano01b].Journeyman[Bec00b, Bec00c,Bec00a,Bec00d,Bec00e,Bec00f, Bec00g,Bec00i,Bec00h,Bec01a].Just[Pla00a].KDE[Mot02].Kelly[Sch00k].Keyword[And02].Knowledge[Dew00, Dew01c,Dew01d,Dew01e,Dew01b,Dew01a, Dew01f,Dew02c,Dew02d,Dew02e]. Language[Pla02].Languages[Sch01h]. Layer[Yor01].LDAP[Mor00a].Leaks[Gar00,Gui00c].Length[Mey01e,Mey01f,Mey02d]. Librarian[Aus00,Aus01a,Aus01b,Aus01c, Aus01d,Aus01e,Aus01f,Aus02b,Aus02a]. Library[Aus01e,For01,Kem02a,Koe01, Pla00e,Rin01,Sut02f,Til01,Yod01,Sut02e, Cav02].Licensing[Sca00].Lightweight[Han00].Linear[Swa00]. Linked[Pla00b].Linux[Bon01,Hub02,Nel00,Sor01].Linux/Unix[Sor01].List[Pla00b].Literals[Mey01a].Loading[Gon00]. Locales[All00d,But00].Location[Sme00]. Locks[Abr02].Logging[Off00,Pyr02]. Logically[Dew02e].Look[Ano01a,Ano01g,Sut02d].Loops[Mey01i].Machine[Laf00].Macro[Nak01,Tim01]. Macros[Get00,Mey01g].Made[Ano01a,Bat01,GF01,Koe01,KM01a,KM01d,KM01b,KM01e,KM01c, KM02d,KM02e,KM02a,KM02b,KM02c].Mail[Ano00m,Ano00n,Ano00o,Ano00p, Ano00q,Ano00r,Ano00s,Ano00t,Ano00u, Ano00v,Ano00w,Ano00x,Ano01u,Ano01v, Ano01w,Ano01x,Ano01y,Ano01z,Ano01-27,Ano01-28,Ano01-29,Ano01-30, Ano01-31,Ano01-32].Maintainable[Ehl00].Making[Cha01,Low00].MAM[KB00b]. Man[Sch01a].Managed[Cav02,Lip02]. Manager[Pad01].Managing[Ber02]. Manor[Sut01c].MAPM[Rin01]. Mapping[Wu00].Maps[Qur01].Math[Rin01,Sch01e].Mathematical[Liu01].MA W[KB00b]. mC[Wal01].mC/OS[Wal01].mC/OS-II[Wal01].Me[KB01d].Meaning[Wei02].Member[Cac00b,Mey00d].Members[Mey02c].Memory[Fau00,Gar00,Gui00c,Rog02,Sut01b,Vla02]. Memory-Based[Fau00].Message[Zol01]. Metaphone[Phi00a].Metaprogrammed[Dew02c]. Metaprogramming[Bec02b].migrating[Sut02e].Mill[Ano01t,Sut00, Sut01b,Sut01d,Sut01c,Sut01e,Sut01f,Sut02e,Sut02c,Sut02d,Sut02f].Mistakes[Bec00b,Bec00c].Model[Bec00l]. Modern[Sut02a].Monitoring[Pyr02]. Moore[Ber00].Mortem[KB00c,KB00d, KB00b,KB00e,KB00a,KB01c,KB01b,KB01e,KB01a,KB01d,KB02].Multiple[Abr02,HR02,J¨a r01]. Multithreaded[Ten02].Multithreading[Bec00g].Mystery[Sch01f].Name[Bri01i,Sch01h,Sch02a].Naming[KM02d].Navigating[Bon01]. Nearest[And01].Neat[Bas00].Ned[Sch00k].Neighbor[And01].Network[Nel00,Rog00b].Neural[Rog00b].Never[Sut00]. Nevermind[Sch01g].Next[KB01e].6next permutation[Ano02a].No[Sch00d]. Noise[Phi00c].Non[Cha01,Mey00d].Non-Derivable[Cha01].Non-Member[Mey00d].Nonlinear[Per00a,Per00b].Not-So-Obvious[Get00].Numbers[Aus02b,Bec00h].O[All00b,Aus01d].Object[Dix01]. Objects[Aus01d,Bec02e,Dew01e,Kou00, LK00,Lop01,Low00,Sut00,Ten02]. Observer[Bar00,Bat01].Observer/ Mediator[Bat01].Obvious[Get00].Old[KM02e].One[Dew01d].Open[Sor01]. OpenGL[Qur01,Wu00].Operations[Nie00].Operator[Gib00,Dew02a,Dew02b,Sch02a]. Optimization[Buc01].Optimizing[Nie00].Organizing[Rog00b]. OS-II[Wal01].Other[All02c].Output[Dew02d].Overruns[KM02a]. Own[Bec01e].Palm[Har02].Panjandrum[Sch01i]. Parameter[Que00].Parameters[Mey02d]. Part[Ano01t,Bec00b,Bec00c,Bec01a,Dew02a,Dew02b,KM02b,KM02c,Mey00a, Mey01c,Mey01d,Mey01e,Mey02d,Per00a, Per00b,Sak00a,Sak00b,Sut01d,Sut02c,Sut02f,Mey02c].Pattern[Bar00].Patterns[Bat01,May01].PC[Ano02e].C[KL02,Pla02].IP[Sme00].Linux[Zac01]. Mediator[Bat01].Unix[Sor01].Write[Abr02].Per-Thread[Cha02]. Perchance[Ano01t,Sut01d].Performing[Abr02].Perl[Sew02]. Persistence[Hsi00].Perspective[Tel00]. Physical[Ber02].Plain[KM02e].Platform[Gui00b,Kem02b,Mor01]. Platforms[Lop01].Please[Dew01d].Plots[Thi00].Plotting[Bas00].Pocket[Ano02e].Point[Bec00d,Bec00e,Bec00f].Pointers[Kar02,Mey02d].Policy[Bec02c,Bro02].Policy-Driven[Bec02c].Polymorphic[Dew01e].Portability[All02e].Portable[Gib00,Rin01].Possibly[All00g]. Post[KB00c,KB00d,KB00b,KB00e,KB00a,KB01c,KB01b,KB01e,KB01a,KB01d,KB02].Post-Mortem[KB00c,KB00d,KB00b,KB00e,KB00a,KB01c,KB01b,KB01e,KB01a,KB01d,KB02]. Practice[Sak00a,Sak00b].Pragmatic[Phi00b,Sut02d].Precision[KB02,Rin01].Predicate[How00].Primitive[Low00]. Probing[Har02].Problem[And01]. Problems[Lab00].Procedures[Liu01]. Products[Ano00a,Ano00b,Ano00c,Ano00d,Ano00e,Ano00f,Ano00g,Ano00h, Ano00i,Ano00j,Ano00k,Ano00l,Ano01h, Ano01i,Ano01j,Ano01k,Ano01l,Ano01m, Ano01n,Ano01o,Ano01p,Ano01q,Ano01r, Ano01s,Ano02f,Ano02g,Ano02h,Ano02i, Ano02j,Ano02k,Ano02l,Ano02m,Ano02n, Ano02o].Professional[Hub01a]. Programmer[Wal01,Phi00b]. Programmers[Mey02a].Programming[Bec00m,Bec00l,Bec00k, Bec01c,Bec01b,Bec01f,Bec01e,Bec01d, Bec02c,Bec02d,Bec02e,Bec02a,Bec02b, Cac00a,Kem02b,LK00,Nel00,Pin02,Pla02, Sme01].Programs[Ano01e,KM01a,Lin01]. progress[Sut02e].Prompt[Rog00a]. Protocol[Dix01].Pure[KB00c].Purpose[BMG02].Question[Dew01b].Quicksort[Bec01a]. Random[Yor01].rarely[Sch02a].Read[Abr02,Sch02b].Read/Write[Abr02].Reading[Que00].Real[Pyr02,Wal01].Real-Time[Pyr02,Wal01].Recursion[Cre00].Redmond[Sch02a]. Refactoring[Ten02].7Reference[Bat00,KM02c,For01]. Reference-Counting[Bat00]. Regression[Swa00].Regular[Ber00]. Release[Bro00].Remembrance[Sch00e]. remove if[Now01].Removing[Phi00c]. Rendering[Phi00d].Replacing[Sak00a,Sak00b].Reply[KB01b].Resizable[Bav00b]. Resources[Bia00].Respect[Dew01b]. Restrictions[Sut02c].Retargeting[Col02].Retreat[Sch02c]. Retro[Bec00i].Return[Gui00a,J¨a r01]. Reusable[Liu01,Per00a,Per00b].Reuse[Hub02].Review[Sut02a,Bri00a,But00,Cir01,For01,Gla01,K¨a m01,Phi00b,Wal01]. right[Sch02a].Rotation[Qur01].Round[Dew02e].Roundup[Sut01a]. Routines[Gat02].Rule[KM01b]. Running[Dew02e].Safe[Bat00,Kle00,Low00].Safety[KM02b,KM02c,Wei02].scaffolding[Ano01-33].Scales[Bas00]. Scanning[Nik00].Search[HR02,Ber00,Mey01h,Phi00a]. Searches[KM01c].Searching[Aus01e]. Secure[Sca00].Self[Pet00,Rog00b].Self-Organizing[Rog00b].Semper[Sch00f].Sending[Lop01]. Serialization[BMG02].Server[Sme00]. Service[Gat02].Set[Smi00].Shall[KB00d].Shim[Rei00].Shoes[Bri01h].Shop[Bec00b,Bec00c, Bec00a,Bec00d,Bec00e,Bec00f,Bec00g, Bec00i,Bec00h,Bec01a].Should[KM01e]. Siblings[Str02c].Simple[Bri00n,Hsi00, KM02b,Sme01,Swa00,Dix01].Simplest[All00g].Simulated[Buc01]. Singleton[Cha02].Singly[Pla00b]. Smart[Kar02].Smithee[Sch01c].SOAP[Dix01].Socket[Ano01f,Sme00,Sme01,Ano01-33]. Sockets[Pee01].Soft[Sch00g].Software[Hub01a,K¨a m01].Solver[Per00a,Per00b].Solving[Lab00]. Something[Aus02a,Bri01g].Sorting[Bec01a].Source[Bon01,Sor01]. Space[Sch02d].Space-Time[Sch02d]. Specialize[Sut01f].Specifications[Sut02d].Spiral[Sch02e]. Split[Dew01a].Spurious[KB02].SQL[Fau00].Stack[Nie02].Standard[But00,Cav02,For01,Sch00h, Sch01h,Til01,Aus00,Aus01a,Aus01b,Aus01c,Aus01d,Aus01e,Aus01f,Aus02b, Aus02a,Pla00d,Pla00b,Pla00f,Pla00e,Pla00c,Sut02e,Sut02f].State[Laf00]. Statements[Ano01a].Static[Wei02]. Stdio[Aus00].Stepping[Dew01f].Sticky[Bec00f].Still[All02e].STL[Bec00j, Bec00m,Bec00l,Bec00k,Bec01c,Bec01b, Bec01f,Bec01e,Bec01d,Bec02c,Bec02d, Bec02e,Bec02a,Bec02b,Fos00,Hic00,Lab00,Mey01h,Mey01i,Smi00,Zol01].STL-Based[Smi00].Straight[Sch02a]. Stream[All00b,Kue05,Nel01,Sew02]. Streambuf[Aus01f].Streambufs[Aus01f]. Stressing[Kou00].String[Ber00,Nie00,Pan01,Sut01c]. Strings[All00f,Sak00a,Sak00b]. Structures[Dew00].Studies[Str02b].Stuff[All02d].Substring[HR02,Nie00]. suitable[Ano01-33].Sunshine[Sch00i]. Superman[Sch00i].Sutter[Ano01t]. System[Per00a,Per00b].Systems[Pyr02]. T[Now01].Table[Fos00,Hic00].Take[Fos00].talk[Sch02a].Taming[Tel00].TCP[Sme00].TCP/IP[Sme00].Technique[Lem02,Pyr02]. Teh[Aus01f].Template[And01,Bav00b, Bec00l,Bec02a,Cal00,Til01,Yod01]. Templates[Cac00b,Geo02,Mor00b,Sut01f, Sut02b].Tempus[Sch00j].Test[All00g,KL02].Testing[Pla00f,Pla00e,Sta01].Tests[Bri00n,Sta01].Text[All00d].REFERENCES8Texture[Qur01,Wu00].Thee[KB00d]. Their[Bec02e].Them[Sch01h].Theory[Sak00a,Sak00b].Things[Bec00h,Sch01b].Thou[All02a]. Thread[Cha02,Kle00,Low00].Thread-Safe[Kle00].Threads[Cal00,How00,Pet00].Three[KM01b,Mey01j].Throw[Ano01t,Sut01d].Time[Dew01d, KB01c,Pla00d,Pyr02,Sch02d,Wal01].Tip[Abr02,Cac00a,Cha01,Fos00,Hic00, Now01,Pet00,Tim01].Tips[Abr02,Cac00a, Cha01,Fos00,Hic00,Now01,Pet00,Tim01]. Title[Sch02b].Toolbox[Pan01].Toolkit[Hub01a].Tracing[Bro00,Lem02,Nie02].Tracking[Gar00].Traits[Bec01d,Sut02b]. Transform[Tel00].Trap[Bec00f]. Traversal[Cre00].Tree[Cre00].Trees[Dan00].Truly[Ehl00].Trust[KB01d].try[Nas00].Tuple[J¨a r01]. Tutorial[For01].Two[Ano01g,Sme01]. Type[Cac00b,Wei02].typedefs[Mey02c]. typeof[Gib00,Dew02a,Dew02b].Types[Cav02,J¨a r01,KM02d,Mor02]. Uncaught[Sch00a,Sch00k,Sch00b,Sch00c, Sch00d,Sch00e,Sch00h,Sch00f,Sch00g,Sch00i,Sch00j,Sch01c,Sch01b,Sch01a,Sch01d,Sch01e,Sch01i,Sch01f,Sch01g,Sch01h,Sch01j,Sch02b,Sch02c,Sch02d,Sch02e].Understanding[KM01c]. Unicode[Kue05].Unions[Mor02].Unit[All00g,Bri00n,Sta01].Unknown[KM02d].Unraveling[Bec00g]. Untested[Gui00a].Usage[Mey01j].Use[KM01e].Users[Ano01b].Using[Buc02,Cav02,Geo02,Gui00b,How00, Koe01,Liu01,Mor02,Qur01,Smi02,Yod01]. Utility[Get00].Values[J¨a r01].Variable[Mey01e,Mey01f,Mey02d]. Variant[Cac00b].VB[Ano02e].VCL[Bia00].vector[Now01].Vectors[Aus01a,KM01d].Version[Pla00a].Via[Sut02b,Phi00d]. Views[PW00].Virtual[Rog02].Virtuality[Sut01e].Visual[Zol01]. Visualizing[Phi00d].VLA[Mey02c]. VLAs[Mey02c].vs[KB00c,Mey01i].w[KM01d].Waits[How00].Warping[Lor01].Watchman[Tru02]. Way[Smi00].Web[Pad01,Sca00].Web-Based[Sca00].Welcome[Bec00m]. Well[Bri01f].Were[Sut00].Where[All02a].Which[KM01e]. Whichever[KB00e].Widgets[Ano02p]. Win32[How00,Nel01].Window[Han00]. Windows[Bia00,Gar00,Lin01,Rog02]. Wise[Dew02a,Dew02b].without[Cre00]. Witness[Sch01j].Woods[Bri01j].Work[All00g,KM01a,Sut02e].Working[Dix01].world[Ano01-33]. Wrapper[Ano01f,Bro02,Han00]. Wrappers[Hub01b].Wrapping[Pee01]. Writing[Bec01e,Mot02,Que00,Ano01-33]. Written[Ano02e,Mey01i].wxWindows[Mor01].X[Mey01g].XML[Geo02]. XParam[BMG02].XSL[Geo02]. ReferencesAblavsky:2002:ABC [Abl02]Vitaly Ablavsky.ApplyingBGL to computational geome-try.C/C++Users Journal,20(8):6,8–12,August2002.CODENCCUJEX.ISSN1075-2838.Abramson:2002:CCT [Abr02]Tomer Abramson.C/C++tips:Tip#8:Performing multipleread/write locks.C/C++UsersREFERENCES9Journal,20(5):25–??,May2002.CODEN CCUJEX.ISSN1075-2838.Allison:2000:IJA [All00a]Chuck Allison.import java.*:Arrays.C/C++Users Journal,18(3):46–??,March2000.CODENCCUJEX.ISSN1075-2838.Allison:2000:IJB [All00b]Chuck Allison.import java.*:Basic stream I/O.C/C++UsersJournal,18(11):58–??,November2000.CODEN CCUJEX.ISSN1075-2838.Allison:2000:IJC [All00c]Chuck Allison.import java.*:Collections and algorithms.C/C++Users Journal,18(9):76–??,Septem-ber2000.CODEN CCUJEX.ISSN1075-2838.Allison:2000:IJF [All00d]Chuck Allison.import java.*:Formatted text and locales.C/C++Users Journal,18(7):60–??,July2000.CODEN CCUJEX.ISSN1075-2838.Allison:2000:IJI [All00e]Chuck Allison.import java.*:Interfaces and inner classes.C/C++Users Journal,18(1):??,January2000.CODEN CCUJEX.ISSN1075-2838.Allison:2000:IJS [All00f]Chuck Allison.import java.*:Strings.C/C++Users Journal,18(6):??,June2000.CODENCCUJEX.ISSN1075-2838.Allison:2000:SAU [All00g]Chuck Allison.The sim-plest automated unit test frame-work that could possibly work.C/C++Users Journal,18(9):48–??,September2000.CODENCCUJEX.ISSN1075-2838.Allison:2002:EFBa [All02a]Chuck Allison.Editor’s forum:Brother,where art thou?C/C++Users Journal,20(7):4,July2002.CODEN CCUJEX.ISSN1075-2838.Allison:2002:EFE [All02b]Chuck Allison.Editor’s forum:Euclid alone.C/C++Users Jour-nal,20(10):4,October2002.CO-DEN CCUJEX.ISSN1075-2838.Allison:2002:EFGb [All02c]Chuck Allison.Editor’s forum:Gear-head humor and other im-portant items.C/C++UsersJournal,20(6):4,June2002.CO-DEN CCUJEX.ISSN1075-2838.Stan Kelly-Bootle announces hisretirement from C/C++UsersJournal column writing.Allison:2002:EFGa [All02d]Chuck Allison.Editor’s forum:Good stuff.C/C++Users Jour-nal,20(4):6,April2002.CODENCCUJEX.ISSN1075-2838.Allison:2002:EFP [All02e]Chuck Allison.Editor’s fo-rum:Is portability still impor-tant?C/C++Users Journal,20(5):4,May2002.CODEN CCU-JEX.ISSN1075-2838.REFERENCES10Allison:2002:EFN [All02f]Chuck Allison.Editor’s forum:New cheese.C/C++Users Jour-nal,20(8):4,August2002.CO-DEN CCUJEX.ISSN1075-2838.Allison:2002:EFBb [All02g]Chuck Allison.Editor’s forum:The best of both!C/C++UsersJournal,20(9):4,September2002.CODEN CCUJEX.ISSN1075-2838.Andrews:2001:TNN [And01]Larry Andrews.A templatefor the nearest neighbor problem.C/C++Users Journal,19(11):??,November2001.CODEN CCU-JEX.ISSN1075-2838.Andrews:2002:KCD [And02]Larry Andrews.Keyword correc-tion from a dictionary.C/C++Users Journal,20(6):14–??,June2002.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:NPa [Ano00a]Anonymous.New products.C/C++Users Journal,18(1):??,January2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:NPb [Ano00b]Anonymous.New products.C/C++Users Journal,18(2):94–??,February2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:NPc [Ano00c]Anonymous.New products.C/C++Users Journal,18(3):95–??,March2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:NPd [Ano00d]Anonymous.New products.C/C++Users Journal,18(4):86–??,April2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:NPe [Ano00e]Anonymous.New products.C/C++Users Journal,18(5):80–??,May2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:NPf [Ano00f]Anonymous.New products.C/C++Users Journal,18(6):??,June2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:NPg [Ano00g]Anonymous.New products.C/C++Users Journal,18(7):95–??,July2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:NPh [Ano00h]Anonymous.New products.C/C++Users Journal,18(8):87–??,August2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:NPi [Ano00i]Anonymous.New products.C/C++Users Journal,18(9):103–??,September2000.CODENCCUJEX.ISSN1075-2838.Anonymous:2000:NPj [Ano00j]Anonymous.New products.C/C++Users Journal,18(10):103–??,October2000.CODENCCUJEX.ISSN1075-2838.REFERENCES11Anonymous:2000:NPk [Ano00k]Anonymous.New products.C/C++Users Journal,18(11):88–??,November2000.CODENCCUJEX.ISSN1075-2838.Anonymous:2000:NPl [Ano00l]Anonymous.New products.C/C++Users Journal,18(12):80–??,December2000.CODENCCUJEX.ISSN1075-2838.Anonymous:2000:WMa [Ano00m]Anonymous.We have mail.C/C++Users Journal,18(1):??,January2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:WMb [Ano00n]Anonymous.We have mail.C/C++Users Journal,18(2):98–??,February2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:WMc [Ano00o]Anonymous.We have mail.C/C++Users Journal,18(3):99–??,March2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:WMd [Ano00p]Anonymous.We have mail.C/C++Users Journal,18(4):90–??,April2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:WMe [Ano00q]Anonymous.We have mail.C/C++Users Journal,18(5):84–??,May2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:WMf [Ano00r]Anonymous.We have mail.C/C++Users Journal,18(6):??,June2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:WMg [Ano00s]Anonymous.We have mail.C/C++Users Journal,18(7):99–??,July2000.CODEN CCUJEX.ISSN1075-2838.Anonymous:2000:WMh [Ano00t]Anonymous.We have mail.C/C++Users Journal,18(8):91–??,August2000.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2000:WMi [Ano00u]Anonymous.We have mail.C/C++Users Journal,18(9):107–??,September2000.CODENCCUJEX.ISSN1075-2838.Anonymous:2000:WMj [Ano00v]Anonymous.We have mail.C/C++Users Journal,18(10):107–??,October2000.CODENCCUJEX.ISSN1075-2838.Anonymous:2000:WMk [Ano00w]Anonymous.We have mail.C/C++Users Journal,18(11):92–??,November2000.CODENCCUJEX.ISSN1075-2838.Anonymous:2000:WMl [Ano00x]Anonymous.We have mail.C/C++Users Journal,18(12):84–??,December2000.CODENCCUJEX.ISSN1075-2838.REFERENCES12Anonymous:2001:CME [Ano01a]Anonymous.C++made easier:A new look at for statements.C/C++Users Journal,19(12):??,December2001.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2001:CCU [Ano01b]Anonymous.C/C++Users Jour-nal20th anniversary.C/C++Users Journal,19(11):??,Novem-ber2001.CODEN CCUJEX.ISSN1075-2838.Anonymous:2001:EFk [Ano01c]Anonymous.Editor’s forum.C/C++Users Journal,19(11):??,November2001.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2001:EFl [Ano01d]Anonymous.Editor’s forum.C/C++Users Journal,19(12):??,December2001.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2001:EHE [Ano01e]Anonymous.Exception han-dling in Embedded C programs.C/C++Users Journal,19(2):??,February2001.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2001:ICS [Ano01f]Anonymous.An Iostream-compatible socket wrapper.C/C++Users Journal,19(12):??,Decem-ber2001.CODEN CCUJEX.ISSN1075-2838.Anonymous:2001:LTC [Ano01g]Anonymous.A look at two C#books.C/C++Users Journal,19(12):??,December2001.CODENCCUJEX.ISSN1075-2838.Anonymous:2001:NPa [Ano01h]Anonymous.New products.C/C++Users Journal,19(1):88–??,January2001.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2001:NPb [Ano01i]Anonymous.New products.C/C++Users Journal,19(2):88–??,February2001.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2001:NPc [Ano01j]Anonymous.New products.C/C++Users Journal,19(3):88–??,March2001.CODEN CCU-JEX.ISSN1075-2838.Anonymous:2001:NPd [Ano01k]Anonymous.New products.C/C++Users Journal,19(4):??,April2001.CODEN CCUJEX.ISSN1075-2838.Anonymous:2001:NPe [Ano01l]Anonymous.New products.C/C++Users Journal,19(5):80–??,May2001.CODEN CCUJEX.ISSN1075-2838.Anonymous:2001:NPf [Ano01m]Anonymous.New products.C/C++Users Journal,19(6):71–??,June2001.CODEN CCUJEX.ISSN1075-2838.Anonymous:2001:NPg [Ano01n]Anonymous.New products.C/C++Users Journal,19(7):72–??,July2001.CODEN CCUJEX.ISSN1075-2838.。