Brief_Info_for_Intl_Applicants_to_Trier_University

合集下载

四年级上册英语第六单元课文

四年级上册英语第六单元课文

It points out that effective communication requires not only linguistic skills, but also cultural sensitivity and awareness.
The text also provides some practical examples to illustrate how to apply cultural differences in interpersonal communication, such as greetings, gift giving, table settings, and etiquette.
The text also compares the different cultural backgrounds and historical experiences of China and the West, and analyzes their respective advantages and disadvantages.
It points out that the differences between Chinese and Western cultures are mainly reflected in their respective emphasis on collectivism and individualism.
01
02
03
04
Summary: Voice analysis involves understanding the different forms and uses of verbs to show whether an action is being performed actively or passively.

电脑英文说明书

电脑英文说明书

电脑英文说明书电脑英文说明书篇一:海本平板笔记本电脑P810英文说明书 Tablet PC User Manual Catalg 1ATTENTIN .................................................. ........................................................... ............... 3 2 PRDUCTDESCRIPTIN ................................................ . (10)2.1 BRIEFINTRDUCTIN ................................................ .. (10)2.2 CMPNENTSINTRDUCTIN ................................................ .. (10)2.3 PEN THE BX ANDCHECK ..................................................... ........................................... 13 3 BASIC INFRMATIN ................................................. (14)3.1 SYSTEM STATUS INDICATRLIGHT ..................................................... . (14)3.2SCREEN .................................................... ........................................................... .. (15)3.3 NETRKCARD ......................................................15 4 BIS(BASIC INPUT AND UTPUT SYSTEM) SETTINGS (15)4.1 METHD F BISSETUP ..................................................... . (16)4.2 MAINSETTINGS .................................................. ........................................................... . (17)4.3 BT (SETUP F BT SCREEN AND BT DEVICERDER) (18)4.4 SECURITYSETTINGS .................................................. .. (19)4.5 [EXIT]MENU ...................................................... ........................................................... .... 20 5 DRIVERS INSTALLATIN AND USERINSTRUCTIN (21)5.1INSTALL DRIVERS,PLS FLL BELSTEPS: .................................................... ................ 21 6 MALFUNCTIN ANALYSIS ANDDISPSAL ................................................... (22)6.1 SUNDPRBLEM .................................................... . (22)6.2 HARD DISK (22)6.3 LCDPRBLEM .................................................... ........................................................... (23)6.4 MEMRYPRBLEM .................................................... .. (24)SPECIALSTATEMENT ................................................. .. (24)APPENDIX A:SPEC ...................................................... .........................................................25 Tablet PC User Manual_________________________________________________________________________ Attentin Respect users, Thank yu fr yur purchase and use f ur prducts. Fr yur security and interests , read the prduct instructins and all the attached data befre using it. If yu d nt perate the prduct in accrdance ith prduct instructins, resulting in any persnal injury, prperty r ther lsses, the pany ill nt be respnsible fr that. Abut the prduct instructins (hereinafter referred “instructins”) ? Cpyright f instructins belngs t ur pany; ? Mentined trademarks, type size in the instructins belngs t their respective ners; ? If the cntent f instructins is incnsistent ith the actual prducts, hichever are actual prducts. If yu are unknn r bjectinable t the clauses f the instructins, please prpse a ritten bjectin t ur pany ithin 7 days after purchasing it. therise yu have agreed ,understd and accepted all the cntent f the instructins. Tablet PC UserManual 1 Attentin1.1 Special tips In rder t make yu pay reasnable attentin n certain nte, please see the flling ntice: 【DANGER】-- Attentin! High danger 【ARNING】-- Attentin! Medium danger 【ATTENTIN】-- Attentin! Danger! 【FRBIDDEN】-- D nt d this dangerus peratin 【REMIND】-- Take care The security infrmatin prvided in this chapter is nt the hle. Fr safe reasn, please pay enugh attentin t all security infrmatin herever it as marked, as ell as ther instructin in this manual.1.2 Imprtant tips f using tablet pc1. LCD maintenance: Dn t put any heavy gds n the laptp Please make sure that yu haven’t put t many things in the bag r besides the device hen using suitcase r backpack Dn t grasp,tist r impact the surface f the LCD Dn t put LCD in envirnment beynd 40 degree r humidity ver 90% Dn t expse LCD in the direct sunlight r strng flurescent Please dn t use crrsive cleaning agent t clean LCD t avid any damage.2. Please d nt blck ventilating radiatr t avid device ver heat.3. Please dn t remve them hen system is reading flppy drive, CD drive r U disk etc, r system uld be cllapsed, even all yur datas uld lse.4. Please dn t take the case apart hen the system is rking r datas uld be damaged, even lst. Please cpy thse imprtant files by yurself timely, especially, befre yu decide t frmat the disks.5.Refrmat the HDD ill delete all date n it, please backup frist.Be sure yur imprtant date have backed up in ther strage media, Data lss caused by n-backup the pany ill nt assumerespnsibility.6.Please use the per adapter accrding t the safe usage rules.D nt take the adapter apart.7.D please nly use the per adapter e enclsed in the device package.8.Make sure the puter rk in nrmal envirnment, make sure puter aay frm Tablet PC User Manual_________________________________________________________________________ the harsh envirnment (high-temperature, l temperature, high humidity) t ensure that the life f the puter.9.D nt use MDEN,ADAPTER in lightning eather.10.D nt pick-and-place Tablet PC ith ne hand r make it imbalance. 11.nly the authrized peple f ur agency can assemble r disassemble the device, please prevent the seal frm any damage fr after-sales service. 12. D please remember the passrd if any, and please turn t agency fr help if yu frget yur passrd, but all yur datas may be lst after the retrieval. 13. Please just pen the CD drive manually, but nt recur t any ther fragile things. 14.Against perate puter incrrectlly.1.3 Attentin Applicable grup 【attentin】 Yu’d better perate this device ith the related basic mn sense. Children nly can perate it besides adult. rking envirnment 【【arning】 T avid puter damaged by envirnment (humidity, dust, fd, liquid, direct expsure in the sunlight ). It shuld be placed in ventilatin, dry place. T avid magnetic interference and damage please keep aay frm ther hme appliances such as TV, air cnditiner and s n.Please dn t splash liquids r ther debris int the puter r it uld cause the shrt Tablet PC User Manual circuit f ther internal pnents and get electric shck r fire. 【attentin】 Please make sure that the laptp has been placed under 10 degree r abve fr at least 2 hurs, r hen turning n, that uld damage yur datas. Befre usage 【arning】 After a transprtatin bel 10 degree, please at least ait fr 2 hurs under nrmal temperature befre yur usage. And d nt unfld the package during this perid. 【attentin】Befre using, please make sure the ptuer cnnectin, per supply and ther matters all under the manual instructin. Mve, Transprtatin,Strage 【attentin】 Please be attentin t lightly take and put hen mving puter Cmputer shuld be put in the package case and put accrding t the package strage lg, als use clse cartn t carry . Please keep the package beynd children’s tuch. 【attentin】 D please change the battery under prfessinal staffs’ instructin; nly use the battery manufacturer remends; apprpriately dispse the used battery.1.4 Imprtant tips f using batteries Ne battery: Please charge the battery nly after pletely used ut. Battery life:Imprper use and maintenance may shrten batterylife. Please make the battery used ut and re-charged fully nce per 30 days. Save battery per : A. advanced per management Yur laptp has functin f advanced per management ,hich culd sl dn CPU and surrunding parts speed .Using these functins uld help save per B. LCD brightness LCD uld cnsume a lt f per,yu can save the per by reducing the brightness. C. sftare and peripherals Fr different sftare and peripherals, even these are nt prcedure r equipment in篇二:常用电脑英文单词解释常用电脑英文单词解释 EeDxCPU(Center Prcessr Unit)中央处理单元 QLC mainbard主板 x,ZI/u RAM(randm access Y memry)随机存储器(内存) b@mx6! RM(Read nly Memry)只读存储器 } Flppy Disk软盘 2-G Hard Disk硬盘 )1CqZ% CD-RM光盘驱动器(光驱) 2n‘$~( mnitr监视器 G tfc: keybard键盘 Z _ muse鼠标 am # chip芯片 *c h CD-R光盘刻录机 @cK HUB 集线器 z+i Mdem= Mdulatr-DEMdulatr,调制解调器 %/- P-P(Plug and Play)即插即用 p‘FL=e UPS(Uninterruptable Per Supply)不间断电源 +**R`Q BIS(Basic-input-utput r System)基本输入输出系统 /r88, CMS(Cmplementary Metal-xide-Semicnductr)互补金属氧化物半导体 f;` setup安装 ANJA= uninstall卸载 t izzard向导 ~|pM S(peratin Systrem)操作系统 #7r A(ffice AutMatin)办公自动化 )( exit退出 tv edit编辑 r 09 cpy复制 U$‘! cut 剪切 8 paste粘贴 YV% delete删除 X+~A select选择 ^p= find查找 Gx select all全选 ?V1.# replace替换 C~k‘lS und撤消 !d(.‘G red重做 _v prgram 程序 L-HP license许可(证) 7:k back前一步 2u next下一步 T8Y finish结束 lxq flder文件夹 g Destinatin Flder目的文件夹 / user用户 fNKh? click点击 jeQ duble click双击 uqPI} right click右击 FRI(%Z settings设置 i update更新 KU/S‘G release 发布 ^~,dxh data数据 D* data base数据库 3 DBMS(Data Base Manege I System)数据库管理系统 % vie视图 L=# insert插入AND(8, bject对象 R cnfiguratin配置 +;}t mand命令 qa dcument 文档 f0. PST(per-n-self-test)电源自检程序 7 cursr光标 J)8J attribute属性 mEr icn图标 =8rqE service pack服务补丁 %+*N ptin pack功能补丁 3AM$ Dem演示 Q@31 shrt cut快捷方式 QI_ exceptin异常 / PT/ debug调试 1p previus前一个 g#F. clumn行{J r列 a`a08 restart重新启动 S!RG text文本 xy fnt字体 M_ size大小 scale比例 n interface界面 ? functin函数 zmbduE access访问 I jB5 manual指南 u;-6F active激活 {u2KY puter language计算机语言 G} menu菜单 PTPT GUI(graphical user C1;Y interfaces )图形用户界面 CG template模版 zEJf- page setup页面设置 ,VvY passrd口令 cde密码 f print previe打印预览 ;MRNq zm in放大 1 zm ut缩小‘F pan漫游 g0 cruise漫游 6=^ full screen全屏 ^H}* tl bar工具条 .!@gC status bar状态条 f/ ruler 标尺 5LN=| table表 lE02 paragraph段落 symbl符号 J style风格 1 execute执行 nfjx graphics图形 ~=@r@i image图像 GFb Unix 用于服务器的一种操作系统 NkC Mac S苹果公司开发的操作系统Qxsv;k (bject-riented)面向对象 *Dm_U virus病毒 x file文件 H| pen打开 8d clse关闭 }f3 ne新建 X:z 9 save保存 kxUy exit退出 ,r clear清除 bJE default默认 V LAN局域网 DyGj AN广域网 M Client/Server客户机/服务器 T% LQE ATM( Asynchrnus y Transfer Mde)异步传输模式 #%vz inds NT微软公司的网络操作系统 Cf^1 Internet互联网 Dk (rld ide eb)万维网 Lt prtcl协议 Pu! HTTP超文本传输协议 =$‘Y FTP文件传输协议 # Brser浏览器 Jra3LP hmepage主页 xhV ebpage网页 ebsite网站 V{H URL在Internet 的服务程序上 +{0 用于指定信息位置的表示方法 V@ nline在线jsU8M Email电子邮件 ;cK) ICQ网上寻呼 8 Fireall防火墙 XA Gateay网关 D4SI HTML超文本标识语言 Bm hypertext超文本 `L hyperlink超级链接 lk3.7 IP(Address)互联网协议(地址) :! SearchEngine搜索引擎 }b#= TCP/IP用于网络的一组通讯协议 Al Telnet远程登录 ItR IE(Internet Explrer)探索者(微软公司的网络浏览器) ,(n Navigatr引航者(网景公司的浏览器) :P multimedia多媒体 pGLJJ/ IS国际标准化组织 9G7 ANSI美国国家标准协会 H able 能 KEE _N activefile 活动文件 cm addatch 添加监视点 allfiles 所有文件L allrightsreserved 所有的权力保留 Z k altdirlst 切换目录格式 C andfixamuchiderrangefdiskprblems 并能够解决更大范围内的磁盘问题 -Czp:. andtherinfrmatin 以及其它的信息 Y archivefileattribute 归档文件属性 { assignt 指定到 dYbYC| autanser 自动应答 V autdetect 自动检测 9,|^ l autindent 自动缩进 {SYh / autsave 自动存储 c n}! availablenvlume 该盘剩余空间 A{ badmand 命令错 c-P=z badmandrfilename 命令或文件名错+ batchparameters 批处理参数 C^! a binaryfile 二进制文件 idK binaryfiles 二进制文件 n2 brlandinternatinal brland国际公司- bttmmargin 页下空白‘37q bydate 按日期 (‘ byextensin 按扩展名 Jc/ byname 按名称 { bytesfree 字节空闲 `@ callstack 调用栈 `|d casesensitive 区分大小写 ^ causesprmptingtcnfirmyuanttverritean 要求出现确认提示,在你想覆盖一个 4 centralpintsftareinc central pint 软件股份公司QLG changedirectry 更换目录 $xZ changedrive 改变驱动器 :_F08 changename 更改名称 Z+9 characterset 字符集 ( checkingfr 正在检查 E checksadiskanddisplaysastatusreprt 检查磁盘并显示一个状态报告 chgdrivepath 改变盘/路径 {? china 中国 hAn chseneftheflling 从下列中选一项 #I^ce clearall 全部清除kmHZ clearallbreakpints 清除所有断点 `. clearsanattribute 清除属性 -2 P clearsmandhistry 清除命令历史 ~ clearscreen 清除屏幕 ; clseall 关闭所有文件 =a9 cdegeneratin 代码生成 d|‘N clrpalette 彩色调色板 jqmU mandline 命令行 : B mandprmpt 命令提示符 )h z pressedfile 压缩文件 Z5I1g cnfiguresaharddiskfruseithmsds 配置硬盘,以为 MS-DS 所用 e6 cnventinalmemry 常规内存 4|igcpiesdirectriesandsubdirectrie***ceptemptynes 拷贝目录和子目录,空的除外 2 cpiesfilesiththearchiveattributeset 拷贝设置了归档属性的文件 F}?,Ei cpiesnermrefilestantherlcatin 把文件拷贝或搬移至另一地方 X cpiesthecntentsfneflppydisktanther 把一个软盘的内容拷贝到另一个软盘上 ( cpydiskette 复制磁盘 u 6DR cpymvepfindrenamedeletevervieeditattribrdpprintlist C拷贝M 移动比 F搜索R改名 D删除 V版本 E浏览A属性写字 P打印 L 列表 P5 cpyrightc 版权(c pe`pB%createdspartitinrlgicaldsdrive 创建DS分区或逻辑DS驱动器fQN createextendeddspartitin 创建扩展DS分区 $l createlgicaldsdrivesintheextendeddspartitin 在扩展DS分区中创建逻辑DS驱动器 D createprimarydspartitin 创建DS主分区C+,dl createsadirectry 创建一个目录 )PB‘ createschangesrdeletesthevlumelabelfadisk 创建,改变或删除磁盘的卷标 a currentfile 当前文件 ,Ny currentfixeddiskdrive 当前硬盘驱动器 *{G_^3 currentsettings 当前设置 d currenttime 当前时间 L^A9U篇三:中英文说明书 1080P手机移动电源摄像机充电宝摄像机使用说明书 A:电源按键 B: 电量指示灯 C: 镜头 D: MIC E: 录像指示灯 F: TF 卡插口 G: 摄像按键 H: 电源充电口(Micr USB) I: 摄像机数据口/充电口(DC 5V 2A) J: 照明灯 K: 电源输出口(DC 5V 1A)感谢您使用我公司的便携微型录像产品,在使用本产品之前,请认真阅读本使用说明书。

THOMSON REUTERS EndNote 说明书

THOMSON REUTERS EndNote 说明书
使用手冊dNote ........................................................................................ 4 EndNote 簡介 ........................................................................................................ 4 關於 EndNote 詴用版和 EndNote 瀏覽器 ........................................................... 4 關於使用手冊........................................................................................................ 4 客戶服務................................................................................................................ 5 EndNote X4 新功能 .............................................................................................. 7 第一章:EndNote 安裝 ................................................................................................ 8 安裝 EndNote 前 ................................................................................................... 8 安裝 EndNote ...................................................................................................... 10 從舊版 EndNote 升級安裝 ................................................................................. 23 檢查安裝.............................................................................................................. 24 自動更新檔案...................................................................................................... 26 移除 EndNote ...................................................................................................... 27 第二章:EndNote Library 介紹 ................................................................................. 29 啟用 EndNote ...................................................................................................... 29 EndNote Library 視窗介紹 ................................................................................. 30 預覽參考文獻...................................................................................................... 31 參考文獻排序...................................................................................................... 33 選擇和開啟一筆參考文獻.................................................................................. 33 關閉參考文獻...................................................................................................... 35 快速編輯參考文獻(Quick Edit Tab) ............................................................. 35 儲存參考文獻到群組中...................................................................................... 36 建立複合群組(Combination Group) ............................................................. 38 相關章節.............................................................................................................. 40 第三章:設定 EndNote 偏好設定 ............................................................................. 41 進入 EndNote Preferences ................................................................................... 41 設定預設 Library (Default Library) .................................................................... 41 改變 Library 呈現字型........................................................................................ 42 相關章節.............................................................................................................. 44 第四章:輸入參考文獻.............................................................................................. 45 新增參考文獻...................................................................................................... 45 手動建立新 Reference ........................................................................................ 45 在參考文獻中加入圖片...................................................................................... 49 在參考文獻中插入圖表檔案.............................................................................. 51 相關章節.............................................................................................................. 52

IEC-61854架空线.隔离层的要求和检验

IEC-61854架空线.隔离层的要求和检验

NORMEINTERNATIONALECEI IEC INTERNATIONALSTANDARD 61854Première éditionFirst edition1998-09Lignes aériennes –Exigences et essais applicables aux entretoisesOverhead lines –Requirements and tests for spacersCommission Electrotechnique InternationaleInternational Electrotechnical Commission Pour prix, voir catalogue en vigueurFor price, see current catalogue© IEC 1998 Droits de reproduction réservés Copyright - all rights reservedAucune partie de cette publication ne peut être reproduite niutilisée sous quelque forme que ce soit et par aucunprocédé, électronique ou mécanique, y compris la photo-copie et les microfilms, sans l'accord écrit de l'éditeur.No part of this publication may be reproduced or utilized in any form or by any means, electronic or mechanical,including photocopying and microfilm, without permission in writing from the publisher.International Electrotechnical Commission 3, rue de Varembé Geneva, SwitzerlandTelefax: +41 22 919 0300e-mail: inmail@iec.ch IEC web site http: //www.iec.chCODE PRIX PRICE CODE X– 2 –61854 © CEI:1998SOMMAIREPages AVANT-PROPOS (6)Articles1Domaine d'application (8)2Références normatives (8)3Définitions (12)4Exigences générales (12)4.1Conception (12)4.2Matériaux (14)4.2.1Généralités (14)4.2.2Matériaux non métalliques (14)4.3Masse, dimensions et tolérances (14)4.4Protection contre la corrosion (14)4.5Aspect et finition de fabrication (14)4.6Marquage (14)4.7Consignes d'installation (14)5Assurance de la qualité (16)6Classification des essais (16)6.1Essais de type (16)6.1.1Généralités (16)6.1.2Application (16)6.2Essais sur échantillon (16)6.2.1Généralités (16)6.2.2Application (16)6.2.3Echantillonnage et critères de réception (18)6.3Essais individuels de série (18)6.3.1Généralités (18)6.3.2Application et critères de réception (18)6.4Tableau des essais à effectuer (18)7Méthodes d'essai (22)7.1Contrôle visuel (22)7.2Vérification des dimensions, des matériaux et de la masse (22)7.3Essai de protection contre la corrosion (22)7.3.1Composants revêtus par galvanisation à chaud (autres queles fils d'acier galvanisés toronnés) (22)7.3.2Produits en fer protégés contre la corrosion par des méthodes autresque la galvanisation à chaud (24)7.3.3Fils d'acier galvanisé toronnés (24)7.3.4Corrosion causée par des composants non métalliques (24)7.4Essais non destructifs (24)61854 © IEC:1998– 3 –CONTENTSPage FOREWORD (7)Clause1Scope (9)2Normative references (9)3Definitions (13)4General requirements (13)4.1Design (13)4.2Materials (15)4.2.1General (15)4.2.2Non-metallic materials (15)4.3Mass, dimensions and tolerances (15)4.4Protection against corrosion (15)4.5Manufacturing appearance and finish (15)4.6Marking (15)4.7Installation instructions (15)5Quality assurance (17)6Classification of tests (17)6.1Type tests (17)6.1.1General (17)6.1.2Application (17)6.2Sample tests (17)6.2.1General (17)6.2.2Application (17)6.2.3Sampling and acceptance criteria (19)6.3Routine tests (19)6.3.1General (19)6.3.2Application and acceptance criteria (19)6.4Table of tests to be applied (19)7Test methods (23)7.1Visual examination (23)7.2Verification of dimensions, materials and mass (23)7.3Corrosion protection test (23)7.3.1Hot dip galvanized components (other than stranded galvanizedsteel wires) (23)7.3.2Ferrous components protected from corrosion by methods other thanhot dip galvanizing (25)7.3.3Stranded galvanized steel wires (25)7.3.4Corrosion caused by non-metallic components (25)7.4Non-destructive tests (25)– 4 –61854 © CEI:1998 Articles Pages7.5Essais mécaniques (26)7.5.1Essais de glissement des pinces (26)7.5.1.1Essai de glissement longitudinal (26)7.5.1.2Essai de glissement en torsion (28)7.5.2Essai de boulon fusible (28)7.5.3Essai de serrage des boulons de pince (30)7.5.4Essais de courant de court-circuit simulé et essais de compressionet de traction (30)7.5.4.1Essai de courant de court-circuit simulé (30)7.5.4.2Essai de compression et de traction (32)7.5.5Caractérisation des propriétés élastiques et d'amortissement (32)7.5.6Essais de flexibilité (38)7.5.7Essais de fatigue (38)7.5.7.1Généralités (38)7.5.7.2Oscillation de sous-portée (40)7.5.7.3Vibrations éoliennes (40)7.6Essais de caractérisation des élastomères (42)7.6.1Généralités (42)7.6.2Essais (42)7.6.3Essai de résistance à l'ozone (46)7.7Essais électriques (46)7.7.1Essais d'effet couronne et de tension de perturbations radioélectriques..467.7.2Essai de résistance électrique (46)7.8Vérification du comportement vibratoire du système faisceau/entretoise (48)Annexe A (normative) Informations techniques minimales à convenirentre acheteur et fournisseur (64)Annexe B (informative) Forces de compression dans l'essai de courantde court-circuit simulé (66)Annexe C (informative) Caractérisation des propriétés élastiques et d'amortissementMéthode de détermination de la rigidité et de l'amortissement (70)Annexe D (informative) Contrôle du comportement vibratoire du systèmefaisceau/entretoise (74)Bibliographie (80)Figures (50)Tableau 1 – Essais sur les entretoises (20)Tableau 2 – Essais sur les élastomères (44)61854 © IEC:1998– 5 –Clause Page7.5Mechanical tests (27)7.5.1Clamp slip tests (27)7.5.1.1Longitudinal slip test (27)7.5.1.2Torsional slip test (29)7.5.2Breakaway bolt test (29)7.5.3Clamp bolt tightening test (31)7.5.4Simulated short-circuit current test and compression and tension tests (31)7.5.4.1Simulated short-circuit current test (31)7.5.4.2Compression and tension test (33)7.5.5Characterisation of the elastic and damping properties (33)7.5.6Flexibility tests (39)7.5.7Fatigue tests (39)7.5.7.1General (39)7.5.7.2Subspan oscillation (41)7.5.7.3Aeolian vibration (41)7.6Tests to characterise elastomers (43)7.6.1General (43)7.6.2Tests (43)7.6.3Ozone resistance test (47)7.7Electrical tests (47)7.7.1Corona and radio interference voltage (RIV) tests (47)7.7.2Electrical resistance test (47)7.8Verification of vibration behaviour of the bundle-spacer system (49)Annex A (normative) Minimum technical details to be agreed betweenpurchaser and supplier (65)Annex B (informative) Compressive forces in the simulated short-circuit current test (67)Annex C (informative) Characterisation of the elastic and damping propertiesStiffness-Damping Method (71)Annex D (informative) Verification of vibration behaviour of the bundle/spacer system (75)Bibliography (81)Figures (51)Table 1 – Tests on spacers (21)Table 2 – Tests on elastomers (45)– 6 –61854 © CEI:1998 COMMISSION ÉLECTROTECHNIQUE INTERNATIONALE––––––––––LIGNES AÉRIENNES –EXIGENCES ET ESSAIS APPLICABLES AUX ENTRETOISESAVANT-PROPOS1)La CEI (Commission Electrotechnique Internationale) est une organisation mondiale de normalisation composéede l'ensemble des comités électrotechniques nationaux (Comités nationaux de la CEI). La CEI a pour objet de favoriser la coopération internationale pour toutes les questions de normalisation dans les domaines de l'électricité et de l'électronique. A cet effet, la CEI, entre autres activités, publie des Normes internationales.Leur élaboration est confiée à des comités d'études, aux travaux desquels tout Comité national intéressé par le sujet traité peut participer. Les organisations internationales, gouvernementales et non gouvernementales, en liaison avec la CEI, participent également aux travaux. La CEI collabore étroitement avec l'Organisation Internationale de Normalisation (ISO), selon des conditions fixées par accord entre les deux organisations.2)Les décisions ou accords officiels de la CEI concernant les questions techniques représentent, dans la mesuredu possible un accord international sur les sujets étudiés, étant donné que les Comités nationaux intéressés sont représentés dans chaque comité d’études.3)Les documents produits se présentent sous la forme de recommandations internationales. Ils sont publiéscomme normes, rapports techniques ou guides et agréés comme tels par les Comités nationaux.4)Dans le but d'encourager l'unification internationale, les Comités nationaux de la CEI s'engagent à appliquer defaçon transparente, dans toute la mesure possible, les Normes internationales de la CEI dans leurs normes nationales et régionales. Toute divergence entre la norme de la CEI et la norme nationale ou régionale correspondante doit être indiquée en termes clairs dans cette dernière.5)La CEI n’a fixé aucune procédure concernant le marquage comme indication d’approbation et sa responsabilitén’est pas engagée quand un matériel est déclaré conforme à l’une de ses normes.6) L’attention est attirée sur le fait que certains des éléments de la présente Norme internationale peuvent fairel’objet de droits de propriété intellectuelle ou de droits analogues. La CEI ne saurait être tenue pour responsable de ne pas avoir identifié de tels droits de propriété et de ne pas avoir signalé leur existence.La Norme internationale CEI 61854 a été établie par le comité d'études 11 de la CEI: Lignes aériennes.Le texte de cette norme est issu des documents suivants:FDIS Rapport de vote11/141/FDIS11/143/RVDLe rapport de vote indiqué dans le tableau ci-dessus donne toute information sur le vote ayant abouti à l'approbation de cette norme.L’annexe A fait partie intégrante de cette norme.Les annexes B, C et D sont données uniquement à titre d’information.61854 © IEC:1998– 7 –INTERNATIONAL ELECTROTECHNICAL COMMISSION––––––––––OVERHEAD LINES –REQUIREMENTS AND TESTS FOR SPACERSFOREWORD1)The IEC (International Electrotechnical Commission) is a worldwide organization for standardization comprisingall national electrotechnical committees (IEC National Committees). The object of the IEC is to promote international co-operation on all questions concerning standardization in the electrical and electronic fields. To this end and in addition to other activities, the IEC publishes International Standards. Their preparation is entrusted to technical committees; any IEC National Committee interested in the subject dealt with may participate in this preparatory work. International, governmental and non-governmental organizations liaising with the IEC also participate in this preparation. The IEC collaborates closely with the International Organization for Standardization (ISO) in accordance with conditions determined by agreement between the two organizations.2)The formal decisions or agreements of the IEC on technical matters express, as nearly as possible, aninternational consensus of opinion on the relevant subjects since each technical committee has representation from all interested National Committees.3)The documents produced have the form of recommendations for international use and are published in the formof standards, technical reports or guides and they are accepted by the National Committees in that sense.4)In order to promote international unification, IEC National Committees undertake to apply IEC InternationalStandards transparently to the maximum extent possible in their national and regional standards. Any divergence between the IEC Standard and the corresponding national or regional standard shall be clearly indicated in the latter.5)The IEC provides no marking procedure to indicate its approval and cannot be rendered responsible for anyequipment declared to be in conformity with one of its standards.6) Attention is drawn to the possibility that some of the elements of this International Standard may be the subjectof patent rights. The IEC shall not be held responsible for identifying any or all such patent rights. International Standard IEC 61854 has been prepared by IEC technical committee 11: Overhead lines.The text of this standard is based on the following documents:FDIS Report on voting11/141/FDIS11/143/RVDFull information on the voting for the approval of this standard can be found in the report on voting indicated in the above table.Annex A forms an integral part of this standard.Annexes B, C and D are for information only.– 8 –61854 © CEI:1998LIGNES AÉRIENNES –EXIGENCES ET ESSAIS APPLICABLES AUX ENTRETOISES1 Domaine d'applicationLa présente Norme internationale s'applique aux entretoises destinées aux faisceaux de conducteurs de lignes aériennes. Elle recouvre les entretoises rigides, les entretoises flexibles et les entretoises amortissantes.Elle ne s'applique pas aux espaceurs, aux écarteurs à anneaux et aux entretoises de mise à la terre.NOTE – La présente norme est applicable aux pratiques de conception de lignes et aux entretoises les plus couramment utilisées au moment de sa rédaction. Il peut exister d'autres entretoises auxquelles les essais spécifiques décrits dans la présente norme ne s'appliquent pas.Dans de nombreux cas, les procédures d'essai et les valeurs d'essai sont convenues entre l'acheteur et le fournisseur et sont énoncées dans le contrat d'approvisionnement. L'acheteur est le mieux à même d'évaluer les conditions de service prévues, qu'il convient d'utiliser comme base à la définition de la sévérité des essais.La liste des informations techniques minimales à convenir entre acheteur et fournisseur est fournie en annexe A.2 Références normativesLes documents normatifs suivants contiennent des dispositions qui, par suite de la référence qui y est faite, constituent des dispositions valables pour la présente Norme internationale. Au moment de la publication, les éditions indiquées étaient en vigueur. Tout document normatif est sujet à révision et les parties prenantes aux accords fondés sur la présente Norme internationale sont invitées à rechercher la possibilité d'appliquer les éditions les plus récentes des documents normatifs indiqués ci-après. Les membres de la CEI et de l'ISO possèdent le registre des Normes internationales en vigueur.CEI 60050(466):1990, Vocabulaire Electrotechnique International (VEI) – Chapitre 466: Lignes aériennesCEI 61284:1997, Lignes aériennes – Exigences et essais pour le matériel d'équipementCEI 60888:1987, Fils en acier zingué pour conducteurs câblésISO 34-1:1994, Caoutchouc vulcanisé ou thermoplastique – Détermination de la résistance au déchirement – Partie 1: Eprouvettes pantalon, angulaire et croissantISO 34-2:1996, Caoutchouc vulcanisé ou thermoplastique – Détermination de la résistance au déchirement – Partie 2: Petites éprouvettes (éprouvettes de Delft)ISO 37:1994, Caoutchouc vulcanisé ou thermoplastique – Détermination des caractéristiques de contrainte-déformation en traction61854 © IEC:1998– 9 –OVERHEAD LINES –REQUIREMENTS AND TESTS FOR SPACERS1 ScopeThis International Standard applies to spacers for conductor bundles of overhead lines. It covers rigid spacers, flexible spacers and spacer dampers.It does not apply to interphase spacers, hoop spacers and bonding spacers.NOTE – This standard is written to cover the line design practices and spacers most commonly used at the time of writing. There may be other spacers available for which the specific tests reported in this standard may not be applicable.In many cases, test procedures and test values are left to agreement between purchaser and supplier and are stated in the procurement contract. The purchaser is best able to evaluate the intended service conditions, which should be the basis for establishing the test severity.In annex A, the minimum technical details to be agreed between purchaser and supplier are listed.2 Normative referencesThe following normative documents contain provisions which, through reference in this text, constitute provisions of this International Standard. At the time of publication of this standard, the editions indicated were valid. All normative documents are subject to revision, and parties to agreements based on this International Standard are encouraged to investigate the possibility of applying the most recent editions of the normative documents indicated below. Members of IEC and ISO maintain registers of currently valid International Standards.IEC 60050(466):1990, International Electrotechnical vocabulary (IEV) – Chapter 466: Overhead linesIEC 61284:1997, Overhead lines – Requirements and tests for fittingsIEC 60888:1987, Zinc-coated steel wires for stranded conductorsISO 34-1:1994, Rubber, vulcanized or thermoplastic – Determination of tear strength – Part 1: Trouser, angle and crescent test piecesISO 34-2:1996, Rubber, vulcanized or thermoplastic – Determination of tear strength – Part 2: Small (Delft) test piecesISO 37:1994, Rubber, vulcanized or thermoplastic – Determination of tensile stress-strain properties– 10 –61854 © CEI:1998 ISO 188:1982, Caoutchouc vulcanisé – Essais de résistance au vieillissement accéléré ou à la chaleurISO 812:1991, Caoutchouc vulcanisé – Détermination de la fragilité à basse températureISO 815:1991, Caoutchouc vulcanisé ou thermoplastique – Détermination de la déformation rémanente après compression aux températures ambiantes, élevées ou bassesISO 868:1985, Plastiques et ébonite – Détermination de la dureté par pénétration au moyen d'un duromètre (dureté Shore)ISO 1183:1987, Plastiques – Méthodes pour déterminer la masse volumique et la densitérelative des plastiques non alvéolairesISO 1431-1:1989, Caoutchouc vulcanisé ou thermoplastique – Résistance au craquelage par l'ozone – Partie 1: Essai sous allongement statiqueISO 1461,— Revêtements de galvanisation à chaud sur produits finis ferreux – Spécifications1) ISO 1817:1985, Caoutchouc vulcanisé – Détermination de l'action des liquidesISO 2781:1988, Caoutchouc vulcanisé – Détermination de la masse volumiqueISO 2859-1:1989, Règles d'échantillonnage pour les contrôles par attributs – Partie 1: Plans d'échantillonnage pour les contrôles lot par lot, indexés d'après le niveau de qualité acceptable (NQA)ISO 2859-2:1985, Règles d'échantillonnage pour les contrôles par attributs – Partie 2: Plans d'échantillonnage pour les contrôles de lots isolés, indexés d'après la qualité limite (QL)ISO 2921:1982, Caoutchouc vulcanisé – Détermination des caractéristiques à basse température – Méthode température-retrait (essai TR)ISO 3417:1991, Caoutchouc – Détermination des caractéristiques de vulcanisation à l'aide du rhéomètre à disque oscillantISO 3951:1989, Règles et tables d'échantillonnage pour les contrôles par mesures des pourcentages de non conformesISO 4649:1985, Caoutchouc – Détermination de la résistance à l'abrasion à l'aide d'un dispositif à tambour tournantISO 4662:1986, Caoutchouc – Détermination de la résilience de rebondissement des vulcanisats––––––––––1) A publierThis is a preview - click here to buy the full publication61854 © IEC:1998– 11 –ISO 188:1982, Rubber, vulcanized – Accelerated ageing or heat-resistance testsISO 812:1991, Rubber, vulcanized – Determination of low temperature brittlenessISO 815:1991, Rubber, vulcanized or thermoplastic – Determination of compression set at ambient, elevated or low temperaturesISO 868:1985, Plastics and ebonite – Determination of indentation hardness by means of a durometer (Shore hardness)ISO 1183:1987, Plastics – Methods for determining the density and relative density of non-cellular plasticsISO 1431-1:1989, Rubber, vulcanized or thermoplastic – Resistance to ozone cracking –Part 1: static strain testISO 1461, — Hot dip galvanized coatings on fabricated ferrous products – Specifications1)ISO 1817:1985, Rubber, vulcanized – Determination of the effect of liquidsISO 2781:1988, Rubber, vulcanized – Determination of densityISO 2859-1:1989, Sampling procedures for inspection by attributes – Part 1: Sampling plans indexed by acceptable quality level (AQL) for lot-by-lot inspectionISO 2859-2:1985, Sampling procedures for inspection by attributes – Part 2: Sampling plans indexed by limiting quality level (LQ) for isolated lot inspectionISO 2921:1982, Rubber, vulcanized – Determination of low temperature characteristics –Temperature-retraction procedure (TR test)ISO 3417:1991, Rubber – Measurement of vulcanization characteristics with the oscillating disc curemeterISO 3951:1989, Sampling procedures and charts for inspection by variables for percent nonconformingISO 4649:1985, Rubber – Determination of abrasion resistance using a rotating cylindrical drum deviceISO 4662:1986, Rubber – Determination of rebound resilience of vulcanizates–––––––––1) To be published.。

3GPP TS 36.213 V9.2.0 (2010-06)

3GPP TS 36.213 V9.2.0 (2010-06)

3GPP TS 36.213 V9.2.0 (2010-06)Technical Specification3rd Generation Partnership Project;Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA);Physical layer procedures(Release 9)The present docu ment has been developed within the 3rd Generation Partnership Project (3G PP TM ) and may be fu rther elaborated for the purposes of 3GPP.The present d ocument has not been subject to any approval process by the 3G PP Organisational Partners and shall not be implemented.This Specification is provided for fu ture development work within 3GPP only. The Organisational Partners accept no liability for any use of this Specification. Specifications and reports for implementation of the 3GPP TM system should be obtained via the 3GPP Organisational Partners ‟ Publications Offices.KeywordsUMTS, radio, layer 13GPPPostal address3GPP support office address650 Route des Lucioles – Sophia AntipolisValbonne – FranceTel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16InternetCopyright NotificationNo part may be reproduced except as authorized by written permission.The copyright and the foregoing restriction extend to reproduction in all media.© 2010, 3GPP Organizational Partners (ARIB, ATIS, CCSA, ETSI, TTA, TTC).All rights reserved.UMTS™ is a Trade Mark of ETSI registered for the benefit of its members3GPP™ is a Trade Mark of ETSI registered for the benefit of its Members and of the 3GPP Organizational PartnersLTE™ is a Trade Mark of ETSI currently being registered for the benefit of i ts Members and of the 3GPP Organizational Partners GSM® and the GS M logo are registered and owned by the GSM AssociationContentsForeword (5)1Scope (6)2References (6)3Definitions, symbols, and abbreviations (7)3.1Symbols (7)3.2Abbreviations (7)4Synchronisation procedures (8)4.1Cell search (8)4.2Timing synchroni sation (8)4.2.1Radio link monitoring (8)4.2.2Inter-cell synchronisation (8)4.2.3Transmission timing adjustments (8)5Power control (9)5.1Uplink power control (9)5.1.1Physical uplink shared channel (9)5.1.1.1UE behaviour (9)5.1.1.2Power headroom (12)5.1.2Physical uplink control channel (12)5.1.2.1UE behaviour (12)5.1.3Sounding Reference Symbol (14)5.1.3.1UE behaviour (14)5.2Downlink power allocation (15)5.2.1 eNodeB Relative Narrowband TX Power restrictions (16)6Random access procedure (16)6.1Physical non-synchronized random access procedure (17)6.1.1Timing (17)6.2Random Access Response Grant (17)7 Physical downlink shared channel related procedures (19)7.1UE procedure for receiving the physical downlink shared channel (19)7.1.1 Single-antenna port scheme (22)7.1.2Transmit diversity scheme (23)7.1.3Large delay CDD scheme (23)7.1.4Closed-loop spatial multiplexing scheme (23)7.1.5Multi-user MIMO scheme (23)7.1.5A Dual layer scheme (23)7.1.6Resource allocation (23)7.1.6.1Resource allocation type 0 (23)7.1.6.2Resource allocation type 1 (24)7.1.6.3Resource allocation type 2 (25)7.1.7Modulation order and transport block size determination (26)7.1.7.1Modulation order determination (27)7.1.7.2Transport block size determination (27)7.1.7.2.1Transport blocks not mapped to two-layer spatial multiplexing (28)7.1.7.2.2Transport blocks mapped to two-layer spatial multiplexing (34)7.1.7.2.3Transport blocks mapped for DCI Format 1C (34)7.1.7.3Redundancy Version determination for Format 1C (35)7.2UE procedure for reporting channel quality indication (CQI), precoding matrix indicator (PMI) and rankindication (RI) (35)7.2.1Aperiodic CQI/PMI/RI Reporting using PUSCH (38)7.2.2Periodic CQI/PMI/RI Reporting using PUCCH (42)7.2.3Channel quality indicator (CQI) definition (48)7.2.4Precoding Matrix Indicator (PMI) definition (50)7.3UE procedure for reporting ACK/NA CK (51)8Physical uplink shared channel related procedures (54)8.1Resource Allocation for PDCCH DCI Format 0 (57)8.2UE sounding procedure (57)8.3UE A CK/NACK procedure (60)8.4UE PUSCH Hopping procedure (60)8.4.1 Type 1 PUSCH Hopping (61)8.4.2 Type 2 PUSCH Hopping (62)8.5UE Reference Symbol procedure (62)8.6Modulation order, redundancy version and transport block size determination (62)8.6.1Modulation order and redundancy version determination (62)8.6.2Transport block size determination (64)8.6.3Control information MCS offset determination (64)8.7UE Transmit Antenna Selection (66)9Physical downlink control channel procedures (66)9.1UE procedure for determining physical downlink control channel assignment (66)9.1.1 PDCCH Assignment Procedure (66)9.1.2 PHICH Assignment Procedure (67)9.2PDCCH validation for semi-persistent scheduling (68)10Physical uplink control channel procedures (70)10.1UE procedure for determining physical uplink control channel assignment (70)10.2Uplink A CK/NACK timing (75)11 Physical multicast channel related procedures (76)11.1UE procedure for receiving the physical multicast channel (76)11.2UE procedure for receiving MCCH change notification (76)Annex A (informative): Change history (77)ForewordThis Technical Specification (TS) has been produced by the 3rd Generation Partnership Project (3GPP).The contents of the present document are subject to continuing work within the TSG and may change following formal TSG approval. Should the TSG modify the contents of this present document, it will be re-released by the TSG with an identifying change of release date and an increase in version number as follows:Version x.y.zwhere:x the first digit:1 presented to TSG for information;2 presented to TSG for approval;3 or greater indicates TSG approved document under change control.y the second digit is incremented for all changes of substance, i.e. technical enhancements, corrections, updates, etc.z the third digit is incremented when editorial only changes have been incorporated in the document.1 ScopeThe present document specifies and establishes the characteristics of the physicals layer procedures in the FDD and TDD modes of E-UTRA.2 ReferencesThe following documents contain provisions which, through reference in this text, constitute provisions of the present document.∙References are either specific (identified by date of publication, edition number, version number, etc.) or non-specific.∙For a specific reference, subsequent revisions do not apply.∙For a non-specific reference, the latest version applies. In the case of a reference to a 3GPP document (including a GSM document), a non-specific reference implicitly refers to the latest version of that document in the same Release as the present document.[1] 3GPP TR 21.905: “Vocabulary for 3GPP Specifications”[2] 3GPP TS 36.201: “Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Layer –General Description”[3] 3GPP TS 36.211: “Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels andmodulation”[4] 3GPP TS 36.212: “Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing andchannel c oding”[5] 3GPP TS 36.214: “Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer –Measurements”[6] 3GPP TS 36.101: “Evolved Universal Terrestrial Radio Access (E-UTRA); User Equipment (UE)radio transmission and reception”[7] 3GPP TS 36.104: “Evolved Universal Terrestrial Radio Access (E-UTRA); Base Station (BS)radio transmission and reception”[8] 3GPP TS36.321, “Evolved Universal Terrestrial Radio Access (E-UTRA); Medium AccessControl (MAC) protocol specification”[9] 3GPP TS36.423, “Evolved Universal Terrestrial Radio Access (E-UTRA); X2 ApplicationProtocol (X2AP)”[10] 3GPP TS36.133, “Evolved Universal Terrestrial Radio Access (E-UTRA); Requirements forsupport of radio resource management”[11] 3GPP TS36.331, “Evolved Universal Te rrestrial Radio Access (E-UTRA); Radio ResourceControl (RRC) protocol specification”3Definitions, symbols, and abbreviations3.1SymbolsFor the purposes of the present document, the following symbols apply:f nS ystem frame number as defined in [3]s nS lot number within a radio frame as defined in [3]DLRB N Downlink bandwidth configuration, expressed in units of RBsc N as defined in [3] UL RB NUplink bandwidth configuration, expressed in units of RB sc N as defined in [3]ULsymb N Number of SC-FDMA symbols in an uplink slot as defined in [3]RBsc NResource block size in the frequency domain, expressed as a number of subcarriers as defined in [3]s TBasic time unit as defined in [3]3.2 AbbreviationsFor the purposes of the present document, the following abbreviations apply. ACK Acknowledgement BCH Broadcast ChannelCCE Control Channel Element CQI Channel Quality Indicator CRC Cyclic Redundancy Check DAI Downlink Assignment Index DCI Downlink Control Information DLDownlinkDL-SCH Downlink Shared Channel DTX Discontinuous Transmission EPRE Energy Per Resource Element MCS Modulation and Coding Scheme NACK Negative Acknowledgement PBCH Physical Broadcast ChannelPCFICH Physical Control Format Indicator Channel PDCCH Physical Downlink Control Channel PDSCH Physical Downlink Shared ChannelPHICH Physical Hybrid ARQ Indicator Channel PMCH Physical Multicast ChannelPRA CH Physical Random Access Channel PRB Physical Resource BlockPUCCH Physical Uplink Control Channel PUSCH Physical Uplink Shared Channel QoS Quality of Service RBG Resource Block Group RE Resource Element RPF Repetition Factor RS Reference SignalSIR Signal-to-Interference RatioSINRSignal to Interference plus Noise Ratio SPS C-RNTI Semi-Persistent Scheduling C-RNTI SR Scheduling RequestSRS Sounding Reference Symbol TA Time alignmentTTI Transmission Time Interval UEUser EquipmentUL UplinkUL-SCH Uplink Shared ChannelVRB Virtual Resource Block4 Synchronisation procedures4.1 Cell searchCell search is the procedure by which a UE acquires time and frequency synchronization with a cell and detects the physical layer Cell ID of that cell. E-UTRA cell search supports a scalable overall transmission bandwidth corresponding to 6 resource blocks and upwards.The following signals are transmitted in the downlink to facilitate cell search: the primary and secondary synchronization signals.4.2 Timing synchronisation4.2.1 Radio link monitoringThe downlink radio link quality of the serving cell shall be monitored by the UE for the purpose of indicating out-of-sync/in-sync status to higher layers.In non-DRX mode operation, the physical layer in the UE shall every radio frame assess the radio link quality, evaluated over the previous time period defined in [10], against thresholds (Q out and Q in) defined by relevant tests in [10].In DRX mode operation, the physical layer in the UE shall at least once every DRX period assess the radio link quality, evaluated over the previous time period defined in [10], against thresholds (Q out and Q in) defined by relevant tests in [10].The physical layer in the UE shall in radio frames where the radio link quality is assessed indicate out-of-sync to higher layers when the radio link quality is worse than the threshold Q out. When the radio link quality is better than the threshold Q in, the physical layer in the UE shall in radio frames where the radio link quality is assessed indicate in-sync to higher layers.4.2.2 Inter-cell synchronisationNo functionality is specified in this section in this release.4.2.3 Transmission timing adjustmentsUpon reception of a timing advance command, the UE shall adjust its uplink transmission timing forPUCCH/PUSCH/SRS. The timing advance command indicates the change of the uplink timing relative to the current uplink timing as multiples of 16T. The start timing of the random access preamble is specified in [3].sIn case of random access response, 11-bit timing advance command [8], T A, indicates N TA values by index values ofT A = 0, 1, 2, ..., 1282, where an amount of the time alignment is given by N TA = T A⨯16. N TA is defined in [3].In other cases, 6-bit timing advance command [8], T A, indicates adjustment of the current N TA value, N TA,old, to the new N TA value, N TA,new, by index values of T A = 0, 1, 2,..., 63, where N TA,new = N TA,old + (T A-31)⨯16. Here, adjustment of N TA value by a positive or a negative amount indicates advancing or delaying the uplink transmission timing by a given amount respectively.For a timing advance command received on subframe n, the corresponding adjustment of the timing shall apply from the beginning of subframe n+6.When the UE‟s uplink PUCCH/PUSCH/SRS transmissions in subframe n and subframe n+1 are overlapped due to the timing adjustment, the UE shall transmit complete subframe n and not transmit the overlapped part of subframe n+1.If the received downlink timing changes and is not compensated or is only partly compensated by the uplink timing adjustment without timing advance command as specified in [10], the UE changes N TA accordingly.5 Power controlDownlink power control determines the energy per resource element (EPRE). The term resource element energydenotes the energy prior to CP insertion. The term resource element energy also denotes the average energy taken over all constellation points for the modulation scheme applied. Uplink power control determines the average power over a SC-FDMA symbol in which the physical channel is transmitted.5.1 Uplink power controlUplink power control controls the transmit power of the different uplink physical channels.A cell wide overload indicator (OI) and a High Interference Indicator (HII) to control UL interference are defined in [9].5.1.1Physical uplink shared channel5.1.1.1UE behaviourThe setting of the UE Transmit power PUSCH P for the physical uplink shared channel (PUSCH) trans mission in subframe i is defined by)}()()()())((log10,min{)(TF O_PUSCH PUSCH10CMAX PUSCH i f i PL j j P i MP i P +∆+⋅++=α [dBm]where,∙ CMAX P is the configured UE transmitted power defined in [6]∙ )(PUSCH i M is the bandwidth of the PUSCH resource assignment expressed in number of resource blocks validfor subframe i .∙)(O_PUSCH j P is a parameter composed of the sum of a cell specific nominal component )( PUSCHO_NOMINAL_j Pprovided from higher layers for j=0 and 1 and a UE specific component )(O_UE_PUSCH j P provided by higher layers for j=0 and 1. For PUSCH (re)transmissions corresponding to a semi-persistent grant then j=0 , for PUSCH (re)transmissions corresponding to a dynamic scheduled grant then j=1 and for PUSCH(re)trans missions corresponding to the random access response grant then j=2. 0)2(O_UE_PUSCH =P and 3_O_PRE PUSCHO_NOMINAL_)2(Msg PREAMBLEP P ∆+=, where the parameterPREAMBLE_INITIA L_RECEIVED_TA RGET_POW ER [8] (O_PRE P ) and 3_Msg PREAMBLE ∆ are signalledfrom higher layers. ∙For j =0 or 1, {}1,9.0,8.0,7.0,6.0,5.0,4.0,0∈α is a 3-bit cell specific parameter provided by higher layers. For j=2, .1)(=j α∙PL is the downlink pathloss estimate calculated in the UE in dB and PL = referenceSignalPower – higher layer filtered RSRP, where referenceSignalPower is provided by higher layers and RSRP is defined in [5] and the higher layer filter configuration is defined in [11]∙T F 10()10log ((21))SM PR K PUSC Hoffseti β⋅∆=-for 25.1=S K and 0 for 0=S K where S K is given by the UE specificparameter deltaMCS-Enabled provided by higher layerso/CQIRE MPR O N =for control data sent via PUSCH without UL-SCH data and1/C rRE r KN -=∑for othercases.▪where C is the number of code blocks, r K is the size for code block r , CQI O is the number of CQI bits including CRC bits and RE N is the number of resource elementsdetermined as initial-PUSCH symbN M N initialPUSCHscRE ⋅=-, where C , r K , initialPUSCH scM- andinitial-PUSCH symbN are defined in [4].oPUSCHCQIoffsetoffset ββ= for control data sent via PUSCH without UL-SCH data and 1 for other cases.∙PUSCH δ is a UE specific correction value, also referred to as a TPC command and is included in PDCCH withDCI format 0 or jointly coded with other TPC commands in PDCCH with DCI format 3/3A whose CRC parity bits are scrambled with TPC-PUSCH-RNTI. The current PUSCH power control adjustment state is given by )(i f which is defined by:o)()1()(PUSCH PUSCH K i i f i f -+-=δ if accumulation is enabled based on the UE-specific parameterAccumulation-enabled provided by higher layers or if the TPC command PUSCH δ is included in a PDCCH with DCI format 0 where the CRC is scrambled by the Temporary C-RNTI▪where )(PUSCH PUSCH K i -δwas signalled on PDCCH with DCI format 0 or 3/3A on subframe PUSCH K i -, and where )0(f is the first value after reset of accumulation. ▪The value of PUSCH K is∙ For FDD,PUSCH K = 4∙ For TDD UL/DL configurations 1-6, PU SC H K is given in Table 5.1.1.1-1∙For TDD UL/DL configuration 0o If the PUSCH transmission in subframe 2 or 7 is scheduled with a PDCCHof DCI format 0 in which the LSB of the UL index is set to 1, PUSC H K = 7 o For all other PUSCH transmissions,PU SC HK is given in Table 5.1.1.1-1.▪The UE attempts to decode a PDCCH of DCI format 0 with the UE ‟s C-RNTI or SPS C-RNTI and a PDCCH of DCI format 3/3A with this UE ‟s TPC-PUSCH-RNTI in every subframe except when in DRX▪If DCI format 0 and DCI format 3/3A are both detected in the same s ubframe, then the UE shall use the PUSCH δ provided in DCI format 0.▪ 0PUSCH =δdB for a subframe where no TPC command is decoded or where DRX occurs ori is not an uplink subframe in TDD.▪The PUSCH δ dB accumulated values signalled on PDCCH with DCI format 0 are given in Table 5.1.1.1-2. If the PDCCH with DCI format 0 is validated as a SPS activation or release PDCCH, then PUSCH δ is 0dB.▪The PUSCH δ dB accumulated values signalled on PDCCH with DCI format 3/3A are one of SET1 given in Table 5.1.1.1-2 or SET2 given in Table 5.1.1.1-3 as determined by the parameter TPC-Index provided by higher layers.▪ If UE has reached maximum power, positive TPC commands shall not be accumulated ▪ If UE has reached minimum power, negative TPC commands shall not be accumulated ▪UE shall reset accumulation∙when O_UE_PUSCHP value is changed by higher layers∙when the UE receives random access response messageo)()(PUS CH PUS CH K i i f -=δif accumulation is not enabled based on the UE-specific parameterAccumulation-enabled provided by higher layers▪where )(PUSCH PUSCH K i -δwas signalled on PDCCH with DCI format 0 on subframePUSCH K i -▪The value of PUSCH K is∙ For FDD,PUSCH K = 4∙ For TDD UL/DL configurations 1-6, PU SC H K is given in Table 5.1.1.1-1∙For TDD UL/DL configuration 0o If the PUSCH transmission in subframe 2 or 7 is scheduled with aPDCCHof DCI format 0 in which the LSB of the UL index is set to 1, PUSC H K = 7 o For all other PUSCH transmissions, PU SC H Kis given in Table 5.1.1.1-1.▪The PUSCH δ dB absolute values signalled on PDCCH with DCI format 0 are given in Table 5.1.1.1-2. If the PDCCH with DCI format 0 is validated as a SPS activation or release PDCCH, then PUSCH δ is 0dB.▪)1()(-=i f i f for a subframe where no PDCCH with DCI format 0 is decoded or whereDRX occurs or i is not an uplink subframe in TDD.o For both types of )(*f (accumulation or current absolute) the first value is set as follows:▪If O_UE_PUS C HP value is changed by higher layers, ∙()00f =▪Else∙2)0(msg rampup P f δ+∆=o where 2msg δ is the TPC command indicated in the random accessresponse, see Section 6.2, and orampup P ∆ is provided by higher layers and corresponds to the total powerramp-up from the first to the last preambleTable 5.1.1.1-1PU SC HK for TDD configuration 0-6Table 5.1.1.1-2: Mapping of TPC Command Field in DCI format 0/3 to absolute and accumulatedPUSCH δ values.Table 5.1.1.1-3: Mapping of TPC Command Field in DCI format 3A to accumulated PUSCH δ values.5.1.1.2 Power headroomThe UE power headroom PH valid for subframe i is defined by{}CM AX 10PUSCH O_PUSCH TF ()10log (())()()()()PH i P M i P j j PL i f i α=-++⋅+∆+ [dB]where, CMAX P , )(PUS C H i M , )(O_PUS C H j P , )(j α, PL, )(TF i ∆ and )(i f are defined in section 5.1.1.1. The power headroom shall be rounded to the closest value in the range [40; -23] dB with steps of 1 dB and is delivered by the physical layer to higher layers.5.1.2Physical uplink control channel5.1.2.1UE behaviourThe setting of the UE Transmit power PUCCH P for the physical uplink control channel (PUCCH) transmission in subframe i is defined by()()()(){}i g F n n h PL P P i P HARQCQI +∆+++=F_PUCCH0_PUCCH CMAX PUCCH ,,min [dBm]where∙ CMAX P is the configured UE transmitted power defined in [6]∙The parameter F_PUCCH ()F ∆ is provided by higher layers. Each F_PUCCH ()F ∆ value corresponds to a PUCCH format (F ) relative to PUCCH format 1a, where each PUCCH format (F ) is defined in Table 5.4-1 [3].∙(),CQI HARQ h n n is a PUCCH format dependent value, where CQI n corresponds to the number of informationbits for the channel quality information defined in section 5.2.3.3 in [4] and HARQ n is the number of HA RQ bits.o For PUCCH format 1,1a and 1b ()0,=HARQ CQI n n h o For PUCCH format 2, 2a, 2b and normal cyclic prefix()⎪⎩⎪⎨⎧≥⎪⎪⎭⎫ ⎝⎛=otherwise04if 4log 10,10CQI CQI HARQCQI n n n n ho For PUCCH format 2 and extended cyclic prefix()1010log if 4,40otherw iseC Q I H ARQ C Q I H ARQ C Q I H ARQn n n n h n n ⎧+⎛⎫+≥⎪ ⎪ ⎪=⎨⎝⎭⎪⎩∙O_PUCCH P is a parameter composed of the sum of a cell specific parameter PUCCHO_NOMINAL_P provided byhigher layers and a UE specific component O_UE_PUCCHP provided by higher layers.∙PUCCH δ is a UE specific correction value, also referred to as a TPC command, included in a PDCCH with DCIformat 1A/1B/1D/1/2A/2/2B or sent jointly coded with other UE specific PUCCH correction values on a PDCCH with DCI format 3/3A whose CRC parity bits are scrambled with TPC-PUCCH-RNTI.o The UE attempts to decode a PDCCH of DCI format 3/3A with the UE ‟s TPC-PUCCH-RNTI and oneor several PDCCHs of DCI format 1A/1B/1D/1/2A/2/2B with the UE ‟s C-RNTI or SPS C-RNTI on every subframe except when in DRX. o If the UE decodes a PDCCH with DCI format 1A/1B/1D/1/2A/2/2B and the corresponding detectedRNTI equals the C-RNTI or SPS C-RNTI of the UE, the UE shall use the PUCCH δ provided in that PDCCH.else▪if the UE decodes a PDCCH with DCI format 3/3A, the UE shall use the PUCCH δ provided in that PDCCHelse the UE shall set PUCCH δ = 0 dB.o 1()(1)()M PU C C H m m g i g i i k δ-==-+-∑where )(i g is the current PUCCH power control adjustmentstate and where ()0g is the first value after reset.▪ For FDD, 1=M and 40=k .▪ For TDD, values of M and m k are given in Table 10.1-1.▪The PUCCH δ dB values signalled on PDCCH with DCI format 1A/1B/1D/1/2A/2/2B are given in Table 5.1.2.1-1. If the PDCCH with DCI format 1/1A/2/2A/2B is validated as an SPS activation PDCCH, or the PDCCH with DCI format 1A is validated as an SPS release PDCCH, then PUCCH δ is 0dB. ▪ The PUCCH δ dB values signalled on PDCCH with DCI format 3/3A are given in Table 5.1.2.1-1 or in Table 5.1.2.1-2 as semi-statically configured by higher layers. ▪If O_UE_PUC C HP value is changed by higher layers,∙()00g =▪Else∙2(0)rampup msg g P δ=∆+o where 2msg δ is the TPC command indicated in the random accessresponse, see Section 6.2 and orampup P ∆ is the total power ramp -up from the first to the last preambleprovided by higher layers▪ If UE has reached maximum power, positive TPC commands shall not be accumulated ▪ If UE has reached minimum power, negative TPC commands shall not be accumulated ▪UE shall reset accumulation∙ when O_UE_PUCCHP value is changed by higher layers∙when the UE receives a random access response message▪()(1)g i g i =- if i is not an uplink subframe in TDD.Table 5.1.2.1-1: Mapping of TPC Command Field in DCI format 1A/1B/1D/1/2A/2B/2/3 to PUCCH δvalues.Table 5.1.2.1-2: Mapping of TPC Command Field in DCI format 3A to PUCCH δ values.5.1.3Sounding Reference Symbol5.1.3.1UE behaviourThe setting of the UE Transmit power SRS P for the Sounding Reference Symbol transmitted on subframe i is defined bySRS CM AX SRS_OFFSET 10SRS O_PUSCH ()min{,10log ()()()()}P i P P M P j j PL f i α=+++⋅+ [dBm]where∙ CMAX P is the configured UE transmitted power defined in [6]∙For 1.25S K =,SRS_OFFSET P is a 4-bit UE specific parameter semi-statically configured by higher layers with1dB step size in the range [-3, 12] dB. ∙For 0=S K ,SRS_OFFSETP is a 4-bit UE specific parameter semi-statically configured by higher layers with 1.5dB step size in the range [-10.5,12] dB ∙SRS M is the bandwidth of the SRS transmission in subframe i expressed in number of resource blocks.∙ )(i f is the current power control adjustment state for the PUSCH, see Section 5.1.1.1.∙ )(O_PUSCH j P and )(j α are parameters as defined in Section 5.1.1.1, where 1=j .5.2 Downlink power allocationThe eNodeB determines the downlink trans mit energy per resource element.A UE may assume downlink cell-specific RS EPRE is constant across the downlink system bandwidth and constant across all subframes until different cell-specific RS power information is received. The downlink reference-signal EPRE can be derived from the downlink reference-signal transmit power given by the parameter Reference-signal-power provided by higher layers. The downlink reference-signal transmit power is defined as the linear average over the power contributions (in [W]) of all resource elements that carry cell-specific reference signals within the operating system bandwidth.The ratio of PDSCH EPRE to cell-specific RS EPRE among PDSCH REs (not applicable to PDSCH REs with zero EPRE) for each OFDM symbol is denoted by either A ρ or B ρaccording to the OFDM symbol index as given by Table 5.2-2. In addition,A ρ and B ρare UE-specific.For a UE in transmission mode 8 when UE-specific RSs are not present in the PRBs upon which the correspondingPDSCH is mapped or in trans mission modes 1 – 7, the UE may assume that for 16 QAM, 64 QAM, spatial multiplexing with more than one layer or for PDSCH transmissions associated with the multi-user MIMO transmission scheme,▪A ρ is equal to )2(log1010offset-power++A P δ [dB] when the UE receives a PDSCH data transmission usingprecoding for transmit diversity with 4 cell-specific antenna ports according to Section 6.3.4.3 of [3]; ▪A ρ is equal to A P +offset-powerδ [dB] otherwisewhere offset-power δis 0 dB for all PDSCH transmission schemes except multi-user MIMO and where A P is a UE specificparameter provided by higher layers.For transmission mode 7, if UE-specific RSs are present in the PRBs upon which the corresponding PDSCH is mapped, the ratio of PDSCH EPRE to UE-specific RS EPRE within each OFDM symbol containing UE-specific RSs shall be a constant, and that constant shall be maintained over all the OFDM symbols containing the UE-specific RSs in the corresponding PRBs. In addition, the UE may assume that for 16QAM or 64QAM, this ratio is 0 dB.For transmission mode 8, if UE-specific RSs are present in the PRBs upon which the corresponding PDSCH is mapped, the UE may assume the ratio of PDSCH EPRE to UE-specific RS EPRE within each OFDM symbol containing UE-specific RSs is 0 dB.A UE may assume that downlink positioning reference signal EPRE is constant across the positioning reference signal bandwidth and across all OFDM symbols that contain positioning reference signals in a given positioning reference signal occasion [10].The cell-specific ratio A B ρρ/ is given by Table 5.2-1 according to cell-specific parameter B P signalled by higher layers and the number of configured eNodeB cell specific antenna ports.Table 5.2-1: The cell-specific ratio A B ρρ/ for 1, 2, or 4 cell specific antenna ports。

Materials Letters-详细投稿指南

Materials Letters-详细投稿指南

以下是Materials Letters的作者指南,我觉得它已经非常简明的说清楚整个投稿过程需要注意的东西2009年影响因子:1.94Guide for Authors Materials LettersMaterials Letters is dedicated to publishing novel, cutting edge reports of broad interest to the materials community. The journal provides a forum for materials scientists and engineers, physicists, and chemists to rapidly communicate on the most important topics in the field in materials. We are primarily interested in those contributions which bring new insights, and papers will be selected on the basis of the importance of the new knowledge they provide.Contributions include a variety of topics such as:• Materials- Metals and alloys, amorphous solids, ceramics, composites, nanocrystals, polymers, semiconductors.• Applications - Structural, opto-electronic, magnetic, medical, MEMS, sensors, smart.• Characterization- Analytical, microscopy, scanning probes, nanoscopic, optical, electrical, acoustic, spectroscopic, diffraction.• Novel Materials- Micro and nanostructures (nanowires, nanotubes, nanoparticles), nanocomposites, thin films, superlattices, quantum dots.• Processing - Thin film processing, sol-gel processing, mechanical processing, assembly, and nanocrystalline processing leading to unique materials.• Properties - Mechanical, magnetic, optical, electrical, ferroelectric, thermal, interfacial, transport, thermodynamic.• Synthesis- Quenching, solid state, solidification, solution synthesis, vapor deposition, and high pressure, explosive processes leading to unique materials. The following topics are inappropriate for publication:Building materials - aggregate, asphalt, cement, concrete, plasterCatalytic materialsCorrosion and oxidation phenomena and protectionLiquid crystalsMetallurgical ProcessesNatural raw materials – clays, minerals, rocksOxide glasses and glass ceramicsRecycled materialsRefractoriesSingle crystal growthTheoryWearTypes of Contribution:Letters are intended as brief reports of significant, original and timely research results on the science, applications and processing of materials which warrant rapid publication. In considering a manuscript for publication, particular attention will be given to the originality of the research, the desirability of speedy publication, the clarity of the presentation and the validity of the conclusions. There is a strict four-page limit to printed articles. Manuscripts must not exceed 2000 words plus three figures and one table. The maximum number of figures is strictly limited to five. If the maximum of 5 figures is used, then the total number of words must be reduced to 1600. If more than 5 figures are used, the manuscript will be rejected. The manuscript submitted for review should not exceed 8 pages (including title, abstract, references, figures, tables and figure captions).Contact Details:Authors should submit their article via the online submission system. Authors will be asked to choose the Editor whose subject area is most closely aligned to the subject of their article. Each Editor's specialties are given below. To expedite the review process, authors will also be prompted to nominate 3 potential referees, who are not at the same institute, to serve as potential referees. Contact details are helpful.Principal EditorsProf. J. Hojo - Nano-composites, Composites, Sol-gel preparationProf. T.G. Nieh - Metallic Alloys, Ceramics, Composites, High Temperature Materials, Mechanical Behavior, Material ProcessingProf. L.S. Shvindlerman - Nano-Crystalline Metals, Thermodynamics, Kinetics, Interfaces and Surfaces.Prof. A.F.W. Willoughby - Semiconductor/Electronic Materials, PolymersOnline Submission:Authors must submit their articles using the secure online submission system at /mlblue.To facilitate rapid publication, it is essential to precisely follow these instructions. Failure to do so can result in a delay or rejection of the manuscript for publication. To ensure a timely review you will be required to answer the following questions before your paper will be considered for review.• Has your paper, or part of your paper, been published before, or is it currently submitted for review to another journal?Yes / No(If yes, then do not submit your paper to Materials Letters.)• Is the total number of words less than 2000?Yes / No(If greater than 2000, please reduce the number of words.)• Is the number of figures greater than 5?Yes / No(If yes, then the paper will automatically be rejected.)• Are the x-ray diffraction patterns indexed?Yes / No(see 4.10) (If your x-ray patterns are not indexed, the paper will be rejected for publication.) [?奇怪]• Do the micrographs have professional quality scale markers?Yes / No(Please replace the black bar on SEM & TEM micrographs with a professional quality scale marker. See 4.9)Ethics in PublishingFor information on Ethics in Publishing and Ethical guidelines for journal publication see /publishingethics and /ethicalguidelines.Policy and ethicsThe work described in your article must have been carried out in accordance with The Code of Ethics of the World Medical Association (Declaration of Helsinki) for experiments involving humans /e/policy/b3.htm; EC Directive 86/609/EEC for animal experimentshttp://ec.europa.eu/environment/chemicals/lab_animals/legislation_en.htm; Uniform Requirements for manuscripts submitted to Biomedical journals . This must be stated at an appropriate point in the article.Conflict of interestAll authors are requested to disclose any actual or potential conflict of interest including any financial, personal or other relationships with other people or organizations within three years of beginning the submitted work that could inappropriately influence, or be perceived to influence, their work. See also /conflictsofinterest.Submission declarationSubmission of an article implies that the work described has not been published previously (except in the form of an abstract or as part of a published lecture or academic thesis), that it is not under consideration for publication elsewhere, that its publication is approved by all authors and tacitly or explicitly by the responsible authorities where the work was carried out, and that, if accepted, it will not be published elsewhere including electronically in the same form, in English or in any other language, without the written consent of the copyright-holder.CopyrightUpon acceptance of an article, authors will be asked to complete a 'Journal Publishing Agreement' (for more information on this and copyright see /copyright). Acceptance of the agreement will ensure the widest possible dissemination of information. An e-mail will be sent to the corresponding author confirming receipt of the manuscript together with a 'Journal Publishing Agreement' form or a link to the online version of this agreement.Subscribers may reproduce tables of contents or prepare lists of articles including abstracts for internal circulation within their institutions. Permission of the Publisher is required for resale or distribution outside the institution and for all other derivative works, including compilations and translations (please consult /permissions). If excerpts from other copyrighted works are included, the author(s) must obtain written permission from the copyright owners and credit the source(s) in the article. Elsevier has preprinted forms for use by authors in these cases: please consult /permissions.Retained author rightsAs an author you (or your employer or institution) retain certain rights; for details you are referred to: /authorsrights.Role of the funding sourceYou are requested to identify who provided financial support for the conduct of the research and/or preparation of the article and to briefly describe the role of the sponsor(s), if any, in study design; in the collection, analysis and interpretation of data; in the writing of the report; and in the decision to submit the paper for publication. If the funding source(s) had no such involvement then this should be stated. Please see /funding.Funding body agreements and policiesElsevier has established agreements and developed policies to allow authors whose articles appear in journals published by Elsevier, to comply with potential manuscript archiving requirements as specified as conditions of their grant awards. To learn more about existing agreements and policies please visit /fundingbodies.Language and language servicesPlease write your text in good English (American or British usage is accepted, but not a mixture of these). Authors who require information about language editing and copyediting services pre- and post-submission please visit /languageediting or our customer support site at for more information.SubmissionSubmission to this journal proceeds totally online and you will be guided stepwise through the creation and uploading of your files. The system automatically converts source files to a single PDF file of the article, which is used in the peer-review process. Please note that even though manuscript source files are converted to PDF files at submission for the review process, these source files are needed for further processing after acceptance. All correspondence, including notification of the Editor's decision and requests for revision, takes place by e-mail removing the need for a paper trail.RefereesPlease submit, with the manuscript, the names, addresses and e-mail addresses of 3 potential referees. Note that the editor retains the sole right to decide whether or not the suggested reviewers are used.Use of wordprocessing softwareIt is important that the file be saved in the native format of the wordprocessor used. The text should be in single-column format. Keep the layout of the text as simple as possible. Most formatting codes will be removed and replaced on processing the article. In particular, do not use the wordprocessor's options to justify text or to hyphenate words. However, do use bold face, italics, subscripts, superscripts etc. Do not embed "graphically designed" equations or tables, but prepare these using the wordprocessor's facility. When preparing tables, if you are using a table grid, use only one grid for each individual table and not a grid for each row. If no grid is used, use tabs, not spaces, to align columns. The electronictext should be prepared in a way very similar to that of conventional manuscripts (see also the Guide to Publishing with Elsevier: /guidepublication). Do not import the figures into the text file but, instead, indicate their approximate locations directly in the electronic text and on the manuscript. See also the section on Electronic illustrations.To avoid unnecessary errors you are strongly advised to use the "spell-check" and "grammar-check" functions of your wordprocessor.Article structureFollow this order when submitting manuscripts: Title, Authors, Affiliations, Abstract, Keywords, Main text, Acknowledgements, Appendix, References, Figure Captions and then Tables. For submission via the website you are requested to import low-resolution images into the article at the approximate location you wish them to appear. Thus the PDF which is created for refereeing purposes will contain all necessary information. In addition you will be asked to separately upload high quality images. Collate acknowledgements in a separate section at the end of the article and do not include them on the title page, as a footnote to the title or otherwise.Text LayoutUse double spacing and wide (3 cm) margins. (Avoid full justification, i.e., do not use a constant right-hand margin.) Ensure that each new paragraph is clearly indicated. Present tables, figures and figure legends at the point they will appear in the manuscript. If possible, consult a recent issue of the journal to become familiar with layout and conventions. Number all pages consecutively, use 12 or 10 pt font size and standard fonts.Subdivision - numbered sectionsDivide your article into clearly defined and numbered sections. Subsections should be numbered 1.1 (then 1.1.1, 1.1.2, ...), 1.2, etc. (the abstract is not included in section numbering). Use this numbering also for internal cross-referencing: do not just refer to "the text". Any subsection may be given a brief heading. Each heading should appear on its own separate line. IntroductionState the objectives of the work and provide an adequate background, avoiding a detailed literature survey or a summary of the results.Material and methodsProvide sufficient detail to allow the work to be reproduced. Methods already published should be indicated by a reference: only relevant modifications shouldbe described.Theory/calculationA Theory section should extend, not repeat, the background to the article already dealt with in the Introduction and lay the foundation for further work. In contrast, a Calculation section represents a practical development from a theoretical basis. ResultsResults should be clear and concise.DiscussionThis should explore the significance of the results of the work, not repeat them.A combined Results and Discussion section is often appropriate. Avoid extensive citations and discussion of published literature.ConclusionsThe main conclusions of the study may be presented in a short Conclusions section, which may stand alone or form a subsection of a Discussion or Results and Discussion section.Essential title page information• Title.Concise and informative. Titles are often used in information-retrieval systems. Avoid abbreviations and formulae where possible.• Author names and affiliations.Where the family name may be ambiguous (e.g., a double name), please indicate this clearly. Present the authors' affiliation addresses (where the actual work was done) below the names. Indicate all affiliations with a lower-case superscript letter immediately after the author's name and in front of the appropriate address. Provide the full postal address of each affiliation, including the country name, and, if available, the e-mail address of each author.• Corresponding author.Clearly indicate who will handle correspondence at all stages of refereeing and publication, also post-publication. Ensure that telephone and fax numbers (with country and area code) are provided in addition to the e-mail address and the complete postal address.• Present/permanent address.If an author has moved since the work described in the article was done, or was visiting at the time, a "Present address" (or "Permanent address") may be indicated as a footnote to that author's name. The address at which the author actually did the work must be retained as the main, affiliation address. Superscript Arabic numerals are used for such footnotes.Abstract:A self-contained abstract of 100 to 200 words, outlining in a single paragraph the aims, scope and conclusions of the paper must be supplied. Do not list the analytical equipment (e.g. SEM, XRD, TEM) used unless it is critical to themeaning. The abstract should state briefly the purpose of the research, the principal results and major conclusions. An abstract is often presented separate from the article, so it must be able to stand alone. For this reason, References should be avoided, but if essential, they must be cited in full, without reference to the reference list. Also, non-standard or uncommon abbreviations should be avoided, but if essential they must be defined at their first mention in the abstract itself.KeywordsImmediately after the abstract, provide a maximum of 6 keywords, using American spelling and avoiding general and plural terms and multiple concepts (avoid, for example, "and", "of"). Be sparing with abbreviations: only abbreviations firmly established in the field may be eligible. These keywords will be used for indexing purposes.AcknowledgementsCollate acknowledgements in a separate section at the end of the article before the references and do not, therefore, include them on the title page, as a footnote to the title or otherwise. List here those individuals who provided help during the research (e.g., providing language help, writing assistance or proof reading the article, etc.).Nomenclature and unitsFollow internationally accepted rules and conventions: use the international system of units (SI). If other quantities are mentioned, give their equivalent in SI. You are urged to consult IUGS: Nomenclature for geological time scales/rock names: / for further information.Math formulaePresent simple formulae in the line of normal text where possible and use the solidus (/) instead of a horizontal line for small fractional terms, e.g., X/Y. In principle, variables are to be presented in italics. Powers of e are often more conveniently denoted by exp. Number consecutively any equations that have to be displayed separately from the text (if referred to explicitly in the text).ArtworkElectronic artworkGeneral points• Make sure you use uniform lettering and sizing of your original artwork.• Save text in illustrations as "graphics" or enclose the font.• Only use the following fonts in your illustrations: Arial, Courier, Ti mes, Symbol.• Number the illustrations according to their sequence in the text.• Use a logical naming convention for your artwork files.• Provide captions to illustrations separately.• Produce images near to the desired size of the printed version.• Submit each figure as a separate file.A detailed guide on electronic artwork is available on our website:/artworkinstructionsYou are urged to visit this site; some excerpts from the detailed information are given here.FormatsRegardless of the application used, when your electronic artwork is finalised, please "save as" or convert the images to one of the following formats (note the resolution requirements for line drawings, halftones, and line/halftone combinations given below):EPS: Vector drawings. Embed the font or save the text as "graphics".TIFF: color or grayscale photographs (halftones): always use a minimum of 300 dpi.TIFF: Bitmapped line drawings: use a minimum of 1000 dpi.TIFF: Combinations bitmapped line/half-tone (color or grayscale): a minimum of 500 dpi is required.DOC, XLS or PPT: If your electronic artwork is created in any of these Microsoft Office applications please supply "as is".Please do not:• Supply embedded graphics in your wordprocessor (spreadsheet, presentation) document;• Supply files that are optimised for scr een use (like GIF, BMP, PICT, WPG); the resolution is too low;• Supply files that are too low in resolution;• Submit graphics that are disproportionately large for the content.Color artworkPlease make sure that artwork files are in an acceptable format (TIFF, EPS or MS Office files) and with the correct resolution. If, together with your accepted article, you submit usable color figures then Elsevier will ensure, at no additional charge, that these figures will appear in color on the Web (e.g., ScienceDirect and other sites) regardless of whether or not these illustrations are reproduced in color in the printed version. For color reproduction in print, you will receive information regarding the costs from Elsevier after receipt of your accepted article. Please indicate your preference for color in print or on the Web only. For further information on the preparation of electronic artwork, please see /artworkinstructions.Please note: Because of technical complications which can arise by converting color figures to "gray scale" (for the printed version should you not opt for color in print) please submit in addition usable black and white versions of all the color illustrations.Figure captionsEnsure that each illustration has a caption. Supply captions separately, not attached to the figure. A caption should comprise a brief title (not on the figure itself) and a description of the illustration. Keep text in the illustrations themselves to a minimum but explain all symbols and abbreviations used.TablesNumber tables consecutively in accordance with their appearance in the text. Place footnotes to tables below the table body and indicate them with superscript lowercase letters. Avoid vertical rules. Be sparing in the use of tables and ensure that the data presented in tables do not duplicate results described elsewhere in the article.ReferencesCitation in textPlease ensure that every reference cited in the text is also present in the reference list (and vice versa). Any references cited in the abstract must be given in full. Unpublished results and personal communications are not recommended in the reference list, but may be mentioned in the text. If these references are included in the reference list they should follow the standard reference style of the journal and should include a substitution of the publication date with either "Unpublished results" or "Personal communication" Citation of a reference as "in press" implies that the item has been accepted for publication.Web referencesAs a minimum, the full URL should be given and the date when the reference was last accessed. Any further information, if known (DOI, author names, dates, reference to a source publication, etc.), should also be given. Web references can be listed separately (e.g., after the reference list) under a different heading if desired, or can be included in the reference list.References in a special issuePlease ensure that the words 'this issue' are added to any references in the list (and any citations in the text) to other articles in the same Special Issue. Reference management softwareThis journal has standard templates available in key reference management packages EndNote () and Reference Manager ( ). Using plug-ins to wordprocessing packages, authors only need to select the appropriate journal template when preparing their article and the list of references and citations to these will be formatted according to the journal style which is described below.Reference styleText: Indicate references by number(s) in square brackets in line with the text. The actual authors can be referred to, but the reference number(s) must always be given.List: Number the references (numbers in square brackets) in the list in the order in which they appear in the text.Examples:Reference to a journal publication:[1] Van der Geer J, Hanraads JAJ, Lupton RA. The art of writing a scientific article. J Sci Commun 2000;163:51-9.Reference to a book:[2] Strunk Jr W, White EB. The elements of style. 3rd ed. New York: Macmillan; 1979.Reference to a chapter in an edited book:[3] Mettam GR, Adams LB. How to prepare an electronic version of your article. In: Jones BS, Smith RZ, editors. Introduction to the electronic age, New York: E-Publishing Inc; 1999, p. 281-304.Note shortened form for last page number. e.g., 51-9, and that for more than 6 authors the first 6 should be listed followed by "et al." For further details you are referred to "Uniform Requirements for Manuscripts submitted to Biomedical Journals" (J Am Med Assoc 1997;277:927-934) (see also /bsd/uniform_requirements.html).Journal abbreviations sourceJournal names should be abbreviated according toIndex Medicus journal abbreviations:/tsd/serials/lji.html;List of serial title word abbreviations:/2-22661-LTWA-online.php;CAS (Chemical Abstracts Service): /sent.html. Supplementary and multimedia dataElsevier accepts electronic supplementary and multimedia data to support and enhance your scientific research. Supplementary files offer the author additional possibilities to publish supporting applications, movies, animation sequences, high-resolution images, background datasets, sound clips and more. Supplementary files supplied will be published online alongside the electronic version of your article in Elsevier Web products, including ScienceDirect: . In order to ensure that your submitted material is directly usable, please ensure that data are provided in one of our recommended file formats. Authors should submit the material in electronic format together with the article and supply a concise and descriptive caption for each file. Video files: please supply 'stills' with your files: you can choose any frame from the video or make a separate image. These will be used instead of standard icons and will personalize the link to your supplementary information.For more detailed instructions please visit our artwork instruction pages at /artworkinstructions.Submission checklistIt is hoped that this list will be useful during the final checking of an article prior to sending it to the journal's Editor for review. Please consult this Guide for Authors for further details of any item.Ensure that the following items are present:One Author designated as corresponding Author:• E-mail address• Full postal address• Telephone and fax numbersAll necessary files have been uploaded• Keywords• All fig ure captions• All tables (including title, description, footnotes)Further considerations• Manuscript has been "spellchecked" and "grammar-checked"• References are in the correct format for this journal• All references mentioned in the Reference l ist are cited in the text, and vice versa• Permission has been obtained for use of copyrighted material from other sources (including the Web)• Color figures are clearly marked as being intended for color reproduction on the Web (free of charge) and in print or to be reproduced in color on the Web (free of charge) and in black-and-white in print• If only color on the Web is required, black and white versions of the figures are also supplied for printing purposesFor any further information please visit our customer support site at .Use of the Digital Object IdentifierThe Digital Object Identifier (DOI) may be used to cite and link to electronic documents. The DOI consists of a unique alpha-numeric character string which is assigned to a document by the publisher upon the initial electronic publication. The assigned DOI never changes. Therefore, it is an ideal medium for citing a document, particularly 'Articles in press' because they have not yet received their full bibliographic information. The correct format for citing a DOI is shown as follows (example taken from a document in the journal Physics Letters B): doi:10.1016/j.physletb.2003.10.071When you use the DOI to create URL hyperlinks to documents on the web, theyare guaranteed never to change.ProofsOne set of page proofs (as PDF files) will be sent by e-mail to the corresponding author (if we do not have an e-mail address then paper proofs will be sent by post) or, a link will be provided in the e-mail so that authors can download the files themselves. Elsevier now provides authors with PDF proofs which can be annotated; for this you will need to download Adobe Reader version 7 (or higher) available free from /products/acrobat/readstep2.html. Instructions on how to annotate PDF files will accompany the proofs (also given online). The exact system requirements are given at the Adobe site: /products/acrobat/acrrsystemreqs.html#70win.If you do not wish to use the PDF annotations function, you may list the corrections (including replies to the Query Form) and return them to Elsevier in an e-mail. Please list your corrections quoting line number. If, for any reason, this is not possible, then mark the corrections and any other comments (including replies to the Query Form) on a printout of your proof and return by fax, or scan the pages and e-mail, or by post. Please use this proof only for checking the typesetting, editing, completeness and correctness of the text, tables and figures. Significant changes to the article as accepted for publication will only be considered at this stage with permission from the Editor. We will do everything possible to get your article published quickly and accurately. Therefore, it is important to ensure that all of your corrections are sent back to us in one communication: please check carefully before replying, as inclusion of any subsequent corrections cannot be guaranteed. Proofreading is solely your responsibility. Note that Elsevier may proceed with the publication of your article if no response is received.OffprintsThe corresponding author, at no cost, will be provided with a PDF file of the article via e-mail or, alternatively, 25 free paper offprints. If the corresponding author opts for paper offprints, this preference must be indicated via the offprint order form which is sent once the article is accepted for publication. Additional paper offprints can also be ordered via this form for an extra charge. The PDF file is a watermarked version of the published article and includes a cover sheet with the journal cover image and a disclaimer outlining the terms and conditions of use. Keyword List(被省略)。

3 Natural Language Question Answering over RDF - A Graph Data Driven Approach

3 Natural Language Question Answering over RDF - A Graph Data Driven Approach

Natural Language Question Answering over RDF — A Graph Data Driven ApproachLei ZouPeking University Beijing, ChinaRuizhe HuangPeking University Beijing, ChinaHaixun Wang ∗Microsoft Research Asia Beijing, Chinazoulei@ Jeffrey Xu YuThe Chinese Univ. of Hong Kong Hong Kong, Chinahuangruizhe@ Wenqiang HePeking University Beijing, Chinahaixun@ Dongyan ZhaoPeking University Beijing, Chinayu@.hk ABSTRACThewenqiang@zhaody@RDF question/answering (Q/A) allows users to ask questions in natural languages over a knowledge base represented by RDF. To answer a national language question, the existing work takes a twostage approach: question understanding and query evaluation. Their focus is on question understanding to deal with the disambiguation of the natural language phrases. The most common technique is the joint disambiguation, which has the exponential search space. In this paper, we propose a systematic framework to answer natural language questions over RDF repository (RDF Q/A) from a graph data-driven perspective. We propose a semantic query graph to model the query intention in the natural language question in a structural way, based on which, RDF Q/A is reduced to subgraph matching problem. More importantly, we resolve the ambiguity of natural language questions at the time when matches of query are found. The cost of disambiguation is saved if there are no matching found. We compare our method with some state-of-theart RDF Q/A systems in the benchmark dataset. Extensive experiments confirm that our method not only improves the precision but also speeds up query performance greatly.and predicates are edge labels. Although SPARQL is a standard way to access RDF data, it remains tedious and difficult for end users because of the complexity of the SPARQL syntax and the RDF schema. An ideal system should allow end users to profit from the expressive power of Semantic Web standards (such as RDF and SPARQLs) while at the same time hiding their complexity behind an intuitive and easy-to-use interface [13]. Therefore, RDF question/answering (Q/A) systems have received wide attention in both NLP (natural language processing) [29, 2] and database areas [30].1.1MotivationCategories and Subject DescriptorsH.2.8 [Database Management]: Database Applications—RDF, Graph Database, Question Answering1.INTRODUCTIONAs more and more structured data become available on the web, the question of how end users can access this body of knowledge becomes of crucial importance. As a de facto standard of a knowledge base, RDF (Resource Description Framework) repository is a collection of triples, denoted as subject, predicate, object , and can be represented as a graph, where subjects and objects are vertices∗ Haixun Wang is currently with Google Research, Mountain View, CA.Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@. SIGMOD’14, June 22–27, 2014, Snowbird, UT, USA. Copyright 2014 ACM 978-1-4503-2376-5/14/06 ...$15.00. /10.1145/2588555.2610525 ...$.There are two stages in RDF Q/A systems: question understanding and query evaluation. Existing systems in the first stage translate a natural language question N into SPARQLs [29, 6, 13], and in the second stage evaluate all SPARQLs translated in the first stage. The focus of the existing solutions is on query understanding. Let us consider a running example in Figure 1. The RDF dataset is given in Figure 1(a). For the natural language question N “Who was married to an actor that played in Philadelphia ? ”, Figure 1(b) illustrates the two stages done in the existing solutions. The inherent hardness in RDF Q/A is the ambiguity of natural language. In order to translate N into SPARQLs, each phrase in N should map to a semantic item (i.e, an entity or a class or a predicate) in RDF graph G. However, some phrases have ambiguities. For example, phrase “Philadelphia” may refer to entity Philadelphia(film) or Philadelphia_76ers . Similarly, phrase “play in” also maps to predicates starring or playForTeam . Although it is easy for humans to know the mapping from phrase “Philadelphia” (in question N ) to Philadelphia_76ers is wrong, it is uneasy for machines. Disambiguating one phrase in N can influence the mapping of other phrases. The most common technique is the joint disambiguation [29]. Existing disambiguation methods only consider the semantics of a question sentence N . They have high cost in the query understanding stage, thus, it is most likely to result in slow response time in online RDF Q/A processing. In this paper, we deal with the disambiguation in RDF Q/A from a different perspective. We do not resolve the disambiguation problem in understanding question sentence N , i.e., the first stage. We take a lazy approach and push down the disambiguation to the query evaluation stage. The main advantage of our method is it can avoid the expensive disambiguation process in the question understanding stage, and speed up the whole performance. Our disambiguation process is integrated with query evaluation stage. More specifically, we allow that phrases (in N ) correspond313Subject Antonio_Banderas Antonio_Banderas Antonio_Banderas Philadelphia_(film) Jonathan_Demme Philadelphia Aaron_McKie James_Anderson Constantin_Stanislavski Philadelphia_76ers An_Actor_Prepares c1 actor <type> u2 Antonio_Banderas <starring> <spouse> u1 Melanie_Griffith c2Predicate type spouse starring type director type bornIn create type type c3Object actor Melanie_Griffith Philadelphia_(film) film Philadelphia_(film) city Philadelphia An_Actor_Prepares Basketball_team Book Philadelphia city actor play in Disambiguation be married to SPARQL GenerationWho was married to an actor that play in Philadelphia ? Generating a Semantic Query Graph <spouse> <actor> <An_Actor_Prepares> <starring> <playedForTeam> <Philadelphia> <Philadelphia(film)> <Philadelphia_76ers> ?who v1 Who be married to “that” v2 play in actor <spouse, 1.0> <playForTeam, 1.0> <actor, 1.0> <Philadelphia, 1.0> <starring, 0.9> <Philadelphia(film), 0.9> <An_Actor_Prepares, 0.9> <director, 0.5> <Philadelphia_76ers, 0.8> Philadelphia v3 Semantic Query GraphplayedForTeam Philadelphia_76ersfilm <type> u3 Philadelphia_(film) <director> u4 Jonathan_Demme <type> u5 Philadelphia <bornIn > u6 Aaron_McKie c4 Basketball_team <type>SELECT ?y WHERE { ?x starring Philadelphia_ ( film ) . ?x type actor . ?x spouse ?y. } Query EvaluationFinding Top-k Subgraph Matches c1 actor u2 <spouse> u1 Melanie_Griffith <type> Antonio_Banderasu7 James_Anderson<playedForTeam>u10 Philadelphia_76ers u8 c5 Book Constantin_Stanislavski <create> <type> u10 An_Actor_Prepares (a) RDF Dataset and RDF GraphSPARQL Query Engine<starring> u3 Philadelphia_(film)?y: Melanie_Griffith (b) SPARQL Generation-and-Query Framework(c) Our FrameworkFigure 1: Question Answering Over RDF Dataset to multiple semantic items (e.g., subjects, objects and predicates) in RDF graph G in the question understanding stage, and resolve the ambiguity at the time when matches of the query are found. The cost of disambiguation is saved if there are no matching found. In our problem, the key problem is how to define a “match” of question N in RDF graph G and how to find matches efficiently. Intuitively, a match is a subgraph (of RDF graph G) that can fit the semantics of question N . The formal definition of the match is given in Definition 3 (Section 2). We illustrate the intuition of our method by an example. Consider a subgraph of graph G in Figure 1(a) (the subgraph induced → by vertices u1 , u2 , u3 and c1 ). Edge − u− 2 c1 says that “Antonio Ban− − → deras is an actor”. Edge u2 u1 says that “Melanie Griffith is mar→ ried to Antonio Banderas”. Edge − u− 2 u3 says that “Antonio Banderas starred in a film Philadelphia(film) ”. The natural language question N is “Who was married to an actor that played in Philadel→ − − → phia”. Obviously, the subgraph formed by edges − u− 2 c1 , u2 u1 and − − → u2 u3 is a match of N . “Melanie Griffith” is a correct answer. On the other hand, we cannot find a match (of N ) containing Philadelphia _76ers in RDF graph G. Therefore, the phrase “Philadelphia” (in N ) cannot map to Philadelphia_76ers . This is the basic idea of our data-driven approach. Different from traditional approaches, we resolve the ambiguity problem in the query evaluation stage. A challenge of our method is how to define a “match” between a subgraph of G and a natural language question N . Because N is unstructured data and G is graph structure data, we should fill the gap between two kinds of data. Therefore, we propose a semantic query graph QS to represent the question semantics of N . We formally define QS in Definition 2. An example of QS is given in Figure 1(c), which represents the semantic of the question N . Each edge in QS denotes a semantic relation. For example, edge v1 v2 denotes that “who was married to an actor”. Intuitively, a match of question N over RDF graph G is a subgraph match of QS over G (formally defined in Definition 3). N . The coarse-grained framework is given in Figure 1(c). In the question understanding stage, we interpret a natural language question N as a semantic query graph QS (see Definition 2). Each edge in QS denotes a semantic relation extracted from N . A semantic relation is a triple rel,arg 1,arg 2 , where rel is a relation phrase, and arg 1 and arg 2 are its associated arguments. For example, “play in”,“actor”,“Philadelphia” is a semantic relation. The edge label is the relation phrase and the vertex labels are the associated arguments. In QS , two edges share one common endpoint if the two corresponding relations share one common argument. For example, there are two extracted semantic relations in N , thus, we have two edges in QS . Although they do not share any argument, arguments “actor” and “that” refer to the same thing. This phenomenon is known as “coreference resolution” [25]. The phrases in edges and vertices of QS can map to multiple semantic items (such as entities, classes and predicates) in RDF graph G. We allow the ambiguity in this stage. For example, the relation phrase “play in” (in edge v2 v3 ) corresponds to three different predicates. The argument “Philadelphia” in v3 also maps to three different entities, as shown in Figure 1(c). In the query evaluation stage, we find subgraph matches of QS over RDF graph G. For each subgraph match, we define its matching score (see Definition 6) that is based on the semantic similarity of the matching vertices and edge in QS and the subgraph match in G. We find the top-k subgraph matches with the largest scores. For example, the subgraph induced by u1 , u2 and u3 matches query QS , as shown in Figure 1(c). u2 matches v2 (“actor”), since u2 ( Antonio_Banderas ) is a type-constraint entity and u2 ’s type is actor . u3 ( Philadelphia(film) ) matches v3 (“Philadelphia”) and u1 ( Melanie_Griffith ) matches v1 (“who”). The result to question N is Melanie_Griffith . Also based on the subgraph match query, we cannot find a subgraph containing u10 ( Philadelphia_76ers ) to match QS . It means that the mapping from “Philadelphia” to u10 is a false alarm. We deal with disambiguation in query evaluation based on the matching result. Pushing down disambiguation to the query evaluation stage not only improves the precision but also speeds up the whole query response time. Take the up-to-date DEANNA [20] as an example. DEANNA [29] proposes a joint disambiguation technique. It mod-1.2Our ApproachAlthough there are still two stages “question understanding” and “query evaluation” in our method, we do not adopt the existing framework, i.e., SPARQL generation-and-evaluation. We propose a graph data-driven solution to answer a natural language question314Table 1: NotationsNotation G(V, E ) N Q Y D T rel vi /ui Cvi /Cvi vj d Definition and Description RDF graph and vertex and edge sets A natural language question A SPARQL query The dependency tree of qN L The paraphrase dictionary A relation phrase dictionary A relation phrase A vertex in query graph/RDF graph Candidate mappings of vertex vi /edge vi vj Candidate mappings of vertex vi /edge vi vjĂĂFigure 3: Paraphrase Dictionary D Philadelphia(film) and Philadelphia_76ers . We need to know which one is users’ concern. In order to address the first challenge, we extract the semantic relations (Definition 1) implied by the question N , based on which, we build a semantic query graph QS (Definition 2) to model the query intention in N . D EFINITION 1. (Semantic Relation). A semantic relation is a triple rel, arg 1, arg 2 , where rel is a relation phrase in the paraphrase dictionary D, arg 1 and arg 2 are the two argument phrases. In the running example, “be married to”, “who”,“actor” is a semantic relation, in which “be married to” is a relation phrase, “who” and “actor” are its associated arguments. We can also find another semantic relation “play in”, “that”,“Philadelphia” in N . D EFINITION 2. (Semantic Query Graph) A semantic query graph is denoted as QS , in which each vertex vi is associated with an argument and each edge vi vj is associated with a relation phrase, 1 ≤ i, j ≤ |V (QS )| . Actually, each edge in QS together with the two endpoints represents a semantic relation. We build a semantic query graph QS as follows. We extract all semantic relations in N , each of which corresponds to an edge in QS . If the two semantic relations have one common argument, they share one endpoint in QS . In the running example, we get two semantic relations, i.e., “be married to”, “who”,“actor” and “play in”, “that”,“Philadelphia” , as shown in Figure 2. Although they do not share any argument, arguments “actor” and “that” refer to the same thing. This phenomenon is known as “coreference resolution” [25]. Therefore, the two edges also share one common vertex in QS (see Figure 2(c)). We will discuss more technical issues in Section 4.1. To deal with the ambiguity issue (the second challenge), we propose a data-driven approach. The basic idea is: for a candidate mapping from a phrase in N to an entity (i.e., vertex) in RDF graph G, if we can find the subgraph containing the entity that fits the query intention in N , the candidate mapping is correct; otherwise, this is a false positive mapping. To enable this, we combine the disambiguation with the query evaluation in a single step. For example, although “Philadelphia” can map three different entities, in the query evaluation stage, we can only find a subgraph containing Philadelphia_film that matches the semantic query graph QS . Note that QS is a structural representation of the query intention in N . The match is based on the subgraph isomorphism between QS and RDF graph G. The formal definition of match is given in Definition 3. For the running example, we cannot find any subgraph match containing Philadelphia or Philadelphia_76ers of QS . The answer to question N is “Melanie_Griffith” according to the resulting subgraph match. Generally speaking, there are offline and online phases in our solution.els the disambiguation as an ILP (integer liner programming) problem, which is an NP-hard problem. To enable the disambiguation, DEANNA needs to build a disambiguation graph. Some phrases in the natural language question map to some candidate entities or predicates in RDF graph as vertices. In order to introduce the edges in the disambiguation graph, DEANNA needs to compute the pairwise similarity and semantic coherence between every two candidates on the fly. It is very costly. However, our method avoids the complex disambiguation algorithms, and combines the query evaluation and the disambiguation in a single step. We can speed up the whole performance greatly. In a nutshell, we make the following contributions in this paper. 1. We propose a systematic framework (see Section 2) to answer natural language questions over RDF repositories from a graph data-driven perspective. To address the ambiguity issue, different from existing methods, we combine the query evaluation and the disambiguation in a single step, which not only improves the precision but also speed up query processing time greatly. 2. In the offline processing, we propose a graph mining algorithm to map natural language phrases to top-k possible predicates (in a RDF dataset) to form a paraphrase dictionary D, which is used for question understanding in RDF Q/A. 3. In the online processing, we adopt two-stage approach. In the query understanding stage, we propose a semantic query graph QS to represent the users’ query intention and allow the ambiguity of phrases. Then, we reduce RDF Q/A into finding subgraph matches of QS over RDF graph G in the query evaluation stage. We resolve the ambiguity at the time when matches of the query are found. The cost of disambiguation is saved if there are no matching found. 4. We conduct extensive experiments over several real RDF datasets (including QALD benchmark) and compare our system with some state-of-the-art systems. Experiment results show that our solution is not only more effective but also more efficient.2.FRAMEWORKThe problem to be addressed in this paper is to find the answers to a natural language question N over an RDF graph G. Table 1 lists the notations used throughout this paper. There are two key challenges in this problem. The first one is how to represent the query intention of the natural language question N in a structural way. The underlying RDF repository is a graph structured data, but, the natural language question N is unstructured data. To enable query processing, we need a graph representation of N . The second one is how to address the ambiguity of natural language phrases in N . In the running example, “Philadelphia” in the question N may refer to different entities, such as315(a) Natural Language Question1 Who actor 23 1 2 3(b) Semantic Relations Extraction and Building Semantic Query Graph3 5 2?who <spouse, 1.0> 1 <actor, 1.0> 7469 8An_Actor_Prepares5 10Figure 2: Natural Language Question Answering over Large RDF Graphs2.1OfflineTo enable the semantic relation extraction from N , we build a paraphrase dictionary D, which records the semantic equivalence between relation phrases and predicates. For example, in the running example, natural language phrases “be married to” and “play in” have the similar semantics with predicates spouse and starring , respectively. Some existing systems, such as Patty [18] and ReVerb [10], provide a rich relation phrase dataset. For each relation phrase, they also provide a support set with entity pairs, such as ( Antonio_Banderas , Philadelphia(film) ) for the relation phrase “play in”. Table 2 shows two sample relation phrases and their supporting entity pairs. The intuition of our method is as follows: for each relation phrase reli , let Sup(reli ) denotes a set of supporting entity pairs. We assume that these entity pairs also occur in RDF graph. Experiments show that more than 67% entity pairs in the Patty relation phrase dataset occur in DBpedia RDF graph. The frequent predicates (or predicate paths) connecting the entity pairs in Sup(reli ) have the semantic equivalence with the relation phrase reli . Based on this idea, we propose a graph mining algorithm to find the semantic equivalence between relation phrases and predicates (or predicate paths).2.2OnlineThere are two stages in RDF Q/A: question understanding and query evaluation. 1) Question Understanding. The goal of the question understanding in our method is to build a semantic query graph QS for representing users’ query intention in N . We first apply Stanford Parser to N to obtain the dependency tree Y of N . Then, we extract the semantic relations from Y based on the paraphrase dictionary D. The basic idea is to find a minimum subtree (of Y ) that contains all words of rel, where rel is a relation phrase in D. The subtree is called an embedding of rel in Y . Based on the embedding position in Y , we also find the associated arguments according to some linguistics rules. The relation phrase rel together with the two associated arguments form a semantic relation, denoted as a triple rel,arg 1,arg 2 . Finally, we build a semantic query graphQS by connecting these semantic relations. We will discuss more technical issues in Section 4.1. 2) Query Evaluation. As mentioned earlier, a semantic query graph QS is a structural representation of N . In order to answer N , we need to find a subgraph (in RDF graph G) that matches QS . The match is defined according to the subgraph isomorphism (formally defined in Definition 3) First, each argument in vertex vi of QS is mapped to some entities or classes in the RDF graph. Given an argument argi (in vertex vi of QS ) and an RDF graph G, entity linking [31] is to retrieve all entities and classes (in G) that possibly correspond to argi , denoted as Cvi . Each item in Cvi is associated with a confidence probability. In Figure 2, argument “Philadelphia” is mapped to three different entities Philadelphia , Philadelphia(film) and Philadelphia_76ers , while argument “actor” is mapped to a class Actor and an entity An_ Actor_Prepares . We can distinguish a class vertex and an entity vertex according to RDF’s syntax. If a vertex has an incoming adjacent edge with predicate rdf:type or rdf:subclass , it is a class vertex; otherwise, it is an entity vertex. Furthermore, if arg is a wh-word, we assume that it can match all entities and classes in G. Therefore, for each vertex vi in QS , it also has a ranked list Cvi containing candidate entities or classes. Each relation phrase relvi vj (in edge vi vj of QS ) is mapped to a list of candidate predicates and predicate paths. This list is denoted as Cvi vj . The candidates in the list are ranked by the confidence probabilities. It is important to note that we do not resolve the ambiguity issue in this step. For example, we allow that “Philadelphia” maps to three possible entities, Philadelphia_76ers , Philadelphia and Philadelphia(film) . We push down the disambiguation to the query evaluation step. Second, if a subgraph in RDF graph can match QS if and only if the structure (of the subgraph) is isomorphism to QS . We have the following definition about match. D EFINITION 3. (Match) Consider a semantic query graph QS with n vertices {v1 ,...,vn }. Each vertex vi has a candidate list Cvi , i = 1, ..., n. Each edge vi vj also has a candidate list of Cvi vj ,316Joseph_P._Kennedy,_Sr.Table 2: Relation Phrases and Supporting Entity PairsRelation Phrase “play in” “uncle of” ( ( ( ( Supporting Entity Pairs Antonio_Banderas , Philadelphia(film) ), Julia_Roberts , Runaway_Bride ),...... Ted_Kennedy , John_F._Kennedy,_Jr. ) Peter_Corr , Jim_Corr ),......Antonio_BanderashasChildTed_KennedyhasChildJohn_F._KennedyhasChild hasGenderMale John_F._Kennedy,_Jr.starringPhiladelphia(film) (a) Āplay ināwhere 1 ≤ i = j ≤ n. A subgraph M containing n vertices {u1 ,...,un } in RDF graph G is a match of QS if and only if the following conditions hold: 1. If vi is mapping to an entity ui , i = 1, ..., n, ui must be in list Cvi ; and 2. If vi is mapping to a class ci , i = 1, ..., n, ui is an entity whose type is ci (i.e., there is a triple ui rdf:type ci in RDF graph) and ci must be in Cvi ; and → − − → u− 3. ∀vi vj ∈ QS ; − i uj ∈ G ∨ uj ui ∈ G. Furthermore, the − → − − → predicate Pij associated with u− i uj (or uj ui ) is in Cvi vj , 1 ≤ i, j ≤ n. Each subgraph match has a score, which is derived from the probability confidences of each edge and vertex mapping. Definition 6 defines the score, which we will discuss later. Our goal is to find all subgraph matches with the top-k scores. A TA-style algorithm [11] is proposed in Section 4.2.2 to address this issue. Each subgraph match of QS implies an answer to the natural language question N , meanwhile, the ambiguity is resolved. For example, in Figure 2, although “Philadelphia” can map three different entities, in the query evaluation stage, we can only find a subgraph (included by vertices u1 , u2 , u3 and c1 in G) containing Philadelphia_film that matches the semantic query graph QS . According to the subgraph graph, we know that the result is “Melanie_Griffith”, meanwhile, the ambiguity is resolved. Mapping phrases “Philadelphia” to Philadelphia or Philadelphia_76ers of QS is false positive for the question N , since there is no data to support that.hasGender(b) Āuncle ofāFigure 4: Mapping Relation Phrases to Predicates or Predicate Paths Although mapping these relation phrases into canonicalized representations is the core challenge in relation extraction [17], none of the prior approaches consider mapping a relation phrase to a sequence of consecutive predicate edges in RDF graph. Patty demo [17] only finds the equivalence between a relation phrase and a single predicate. However, some relation phrases cannot be interpreted as a single predicate. For example, “uncle of” corresponds to a length-3 predicate path in RDF graph G, as shown in Figure 3. In order to address this issue, we propose the following approach. Given a relation phrase reli , its corresponding support set containing entity pairs that occurs in RDF graph is denoted as Sup(reli ) j 1 m = { (vi , vi1 ), ..., (vi , vim )}. Considering each pair (vi , vij ), j j j = 1, ..., m, we find all simple paths between vi and vi in RDF j graph G, denoted as P ath(vi , vij ). Let P S (reli ) = j =1,...,m j j P ath(vi , vi ). For example, given an entity pair ( Ted_Kennedy , John_F._Kennedy,_Jr. ), we locate them at RDF graph G and find simple pathes between them (as shown in Figure 4). If a path L is frequent in P S (“uncle of”), L is a good candidate to represent the semantic of relation phrase “uncle of”. For efficiency considerations, we only find simple paths with no longer than a threshold1 . We adopt a bi-directional BFS (breathj j first-search) search from vertices vi and vij to find P ath(vi , vij ). Note that we ignore edge directions (in RDF graph) in a BFS process. For each relation phrase reli with m supporting entity pairs, j we have a collection of all path sets P ath(vi , vij ), denoted as j j P S (reli ) = j =1,...,m P ath(vi , vi ). Intuitively, if a predicate path is frequent in P S (reli ), it is a good candidate that has semantic equivalence with relation phrase reli . However, the above simple intuition may introduce noises. For example, we find that (hasGender , hasGender) is the most frequent predicate path in P S (“uncle of”) (as shown in Figure 4). Obviously, it is not a good predicate path to represent the sematic of relation phrase “uncle of”. In order to eliminate noises, we borrow the intuition of tf-idf measure [15]. Although (hasGender ,hasGender) is frequent in P S (“uncle of”), it is also frequent in the path sets of other relation phrases, such as P S (“is parent of”), P S (“is advisor of”) and so on. Thus, (hasGender ,hasGender) is not an important feature for P S (“uncle of”). It is exactly the same with measuring the importance of a word w with regard to a document. For example, if a word w is frequent in lots of documents in a corpus, it is not a good feature. A word has a high tf-idf, a numerical statistic in measuring how important a word is to a document in a corpus, if it occurs in a document frequently, but the frequency of the word in the whole corpus is small. In our problem, for each relation phrase reli , i = 1, ..., n, we deem P S (reli ) as a virtual document. All predicate paths in P S (reli ) are regarded as virtual words. The corpus contains all P S (reli ), i = 1, ..., n. Formally, we define tf-idf value of a predicate path L in the following definition. Note that if L is a length-1 predicate path, L is a predicate P .1 We set the threshold as 4 in our experiments. More details about the parameter setting will be discussed in Section 6.3.OFFLINEThe semantic relation extraction relies on a paraphrase dictionary D. A relation phrase is a surface string that occurs between a pair of entities in a sentence [17], such as “be married to” and “play in” in the running example. We need to build a paraphrase dictionary D, such as Figure 3, to map relation phrases to some candidate predicates or predicate paths. Table 2 shows two sample relation phrases and their supporting entity pairs. In this paper, we do not discuss how to extract relation phrases along with their corresponding entity pairs. Lots of NLP literature about relation extraction study this problem, such as Patty [18] and ReVerb [10]. For example, Patty [18] utilizes the dependency structure in sentences and ReVerb [10] adopts the n-gram to find relation phrases and the corresponding support set. In this work, we assume that the relation phrases and their support sets are given. The task in the offline processing is to find the semantic equivalence between relation phrases and the corresponding predicates (and predicate paths) in RDF graphs, i.e., building a paraphrase dictionary D like Figure 3. Suppose that we have a dictionary T = {rel1 , ..., reln }, where each reli is a relation phrase, i = 1, ..., n. Each reli has a support set of entity pairs that occur in RDF graph, i.e., Sup (reli ) 1 m = { (vi , vi1 ), ..., (vi , vim )}. For each reli , i = 1, ..., n, the goal is to mine top-k possible predicates or predicate paths formed by consecutive predicate edges in RDF graph, which have sematic equivalence with relation phrase reli .317。

IGSPP-Application-Form

IGSPP-Application-Form

APPLICATION FORMInternational Graduate Study Preparation Program (IGSPP)Thank you for considering study at the University of British Columbia (UBC) Continuing Studies. The International Graduate Study Preparation Program (IGSPP) is a university preparation program for graduate level, international students. IGSPP focuses on academic skills development, planning and language training (if required).Applicants should also note that the length of IGSPP will vary depending on each student’s English language fluency when they start the program. Typically IGSPP will include one-two language-training terms followed by an academic-training term of study. Each term is 4 months in length. We estimate that students entering IGSPP with an English language proficiency level of IELTS 5.5 (or equivalent) would require approximately two terms to complete the program. Similarly, students entering IGSPP with a level around IELTS 6.0 we estimate would require one term to complete the program. Students who progress faster than anticipated would be offered full refunds of fees paid for the English language terms they don’t require.IGSPP is not a degree program, nor is it a direct path to graduate studies at UBC or any other universities. For more information about admission to graduate programs at UBC, please visit UBC Faculty of Graduate Studies website at http://www.grad.ubc.caProgram Selection1. Please choose one of the following program streams:□ International Graduate Study Preparation Program (IGSPP) –Regular Stream□ International Graduate Study Preparation Program (IGSPP) –Credit Stream2. Please choose one of the program start dates below:□Winter (January) -2012□Summer (May) -2012□Fall (September) -2012□Winter (January) - 2013□Summer (May) -2013□ Fall (September) -2013Personal Details3. Student InformationTitle:□ Mr. □ Ms. □ Other Family Name:Given Name(s):Preferred Name:Date of birth (day/month/year): Country of birth: Nationality/Citizenship: Passport number: Country of issue:4. Status in Canada○ Canadian Citizen ○ Canadian Permanent Resident / Landed Immigrant ○ Have a Study Permit /Visa ○ Applying for a Study Permit / Visa○ Need to extend Study Permit / Visa ○ Tourist/working holiday○ Have a Work Permit ○ Other (please specify below)5. Contact DetailsMailing address (will appear on your Letter of Acceptance):Street:City: Home telephone:Province: Mobile telephone:Postal Code: Email(s):Country:English ProficiencyIGSPP applicants are required to have an intermediate-advanced proficiency in the English language. The minimum English language requirement is IELTS 5.5 (or equivalent). For more details and a list of how you can meet the language requirement, please refer to Entry Requirements1.1 Please refer to the program website at http://www.cic.cstudies.ubc.ca/igspp/requirements.html6. English LevelExam name:□ TOEFL Paper-Based □ TOEFL Internet-Based □ TOEFL Computer-Based□ IELTS (Academic) □ Other (please specify): ________________________ Score: Date (day/month/year):Education Details:7. College / University AttendedName of the university(s)/college(s) attended:Major area(s) of study:Degree: (include name, institution and year completed):Grade Point Average (GPA):Language of instruction:8. Other degrees/diplomas/certificates (if applicable): (include name, institution and year completed)9. Graduate Study GoalsLevel:□ Master’s Degree □ Doctoral Degree (Ph.D.)□ Others (Please specify)□ Second Bachelor’s DegreeField of Study:□Engineering □Science□Business & Economics□Arts□Education□Others ( Please specify)Agent Details10. If your application is assisted by an authorized IGSPP agent, please complete the following sections.Agency Name:Agent Contact Email:Agent Contact Name:Agent Contact Telephone:Other Information11. Where did you hear about the program?□ Canadian Embassy, Consulate □ Former UBC Student□ Website□ Friend or Family□ Agent (please specify): _____________________________________________________□ Book/Magazine/Study Guide (please specify):___________________________________□ Education Fair (please specify):_______________________________________________□ Other (please specify):______________________________________________________Please send the following documents with your application•Academic transcripts•Copies of your degree certificates (or confirmation of the degree you will receive, if not yet issued)•English Language test result (e.g. TOEFL, IELTS or equivalent) if available•Employment history details if availablePlease send your document copies in their original language and another copy that is translated into English. You can send the documents to us by email (electronic copies are acceptable), mail, or fax. Payment MethodMy program application fee ($200 CAD) will be paid by (please choose one):□Credit Card - or only: (preferred payment method)Credit card holder: __________________________________________Credit card number: _________________________________________Expiry date: _________________Card security code: _________________ (3 digit code on back of card, see cstudies.ubc.ca/csc for examples)□ Bank Draft or Money Order (Date: ___________________ Amount: ______________)□ Wire Transfer* (Date: ___________________ Amount: ______________)* To complete a wire transfer, please make sure that you include the applicant’s name, date of birth, and the program name, as well as the remitter’s name (if applicable) in the notes when you send the wire transfer payment.HSBC BANK OF CANADA885 West Georgia StVancouver, BC V6C 3G1Account Number: 10020-016-437218-017 (Canadian Dollar)SWIFT HKBCCATTBeneficiary: Continuing Studies, the University of British ColumbiaPhone: 604-827-5414Contact Person: David PickingApplication checklist□ I have completed all sections of the Application Form□ I have included the application fee□ I have read and understood the IGSPP’s Registration Policies2 including the refund information. □ It is my responsibility to meet Canadian visa requirements.□ I understand that the Application Fee ($200) is non-refundable and that the Program Deposit ($7,000) is only refundable if Study Permit/visa is denied.□ I agree to pay all program fees according to the Payment Schedule3.□ I understand that completion of IGSPP does not guarantee admission to the graduate programs at UBC or any other post-secondary institutions. Admission to these programs is controlled by each institution’s policies and admission standards.DeclarationBy signing this application form, I declare that the information I have supplied on this form is, to the best of my understanding and belief, complete and correct. I understand that giving the false or incomplete information may lead to the refusal of my application or cancellation of enrollment. I have read and understood the published program information in the brochure and/or on the website and I have sufficient information about the International Graduate Study Preparation Program (IGSPP) to enroll. I understand that if I have applied through an authorized IGSPP agent, all correspondence relating to my application will be forwarded to that agent. I accept liability for payment of all fees as explained in the brochure and on the website, and I agree to abide by the Registration Policies which2 Please refer to the website of “Registration Policies” (http://www.cic.cstudies.ubc.ca/igspp/policies.html)3 Please refer to the website of “Program Fees” (http://www.cic.cstudies.ubc.ca/igspp/fees.html)are current at the time of my application. I also understand that program policies are updated regularly and I should refer to my original correspondence with UBC Continuing Studies for the policies that apply to me.Application’s Signature:Date: / / / (Day/month/year)How to Contact usIGSPP Admissions OfficerUBC Continuing Studies410 - 5950 University BoulevardVancouver, BC Canada V6T 1Z3Phone: +1-604-827-5414Fax: +1-604-822-0388Email: igspp@cstudies.ubc.caWe Respect Your PrivacyPersonal information provided on the registration form is collected pursuant to section 26 of the Freedom of Information and Protection of Privacy Act (“FIPPA”), RSBC 1996, c.165, as amended. The information will be used for the purposes of: admission; registration; academic progress; notification of future courses; and operating other UBC-related programs. UBC collects, uses, retains and discloses information in accordance with FIPPA. UBC may share and disclose personal information within the University to carry out its mandate and operations. Information, in aggregate form only, may also be used for research purposes and statistics.Should you have any questions about the collection of information, please contact Manager, Marketing Services, UBC Continuing Studies, 410-5950 University Boulevard, Vancouver, BC, V6T 1Z3.We respect your privacy. Your contact information is used to send you communications regarding upcoming UBC courses and events that may be of interest to you. Your contact information will not be released to others. If you check these boxes you will still receive communications relating to the administration of your course or program.Please check here if you do not wish to be on our:□Mailing list (if this box is checked, you will not be mailed our course calendar)□email list.。

mySAP_All_in_One_Solution_Brief

mySAP_All_in_One_Solution_Brief

INTEGRATED INDUSTRY-SPECIFIC ENTERPRISE SOLUTIONS FOR MIDSIZE BUSINESSESThe Power to Succeed, Configured for Small and Midsize BusinessesLarge or small, every company can profit from efficient, stream-lined processes, insightful business intelligence, and systems that are flexible enough to grow with changing business needs. But the solutions that deliver these benefits can strain the budgets of even large companies. For small and midsize businesses limited by finite time, IT personnel, and finances, the power of compre-hensive enterprise solutions has seemed out of reach – until now. SAP puts the power of integrated business solutions within the reach of smaller companies with mySAP™ All-in-One, affordable microvertical solutions created and delivered by SAP business partners and qualified by SAP. mySAP All-in-One solutions meet the needs of small and midsize businesses that require a high degree of industry-specific functionality delivered as a preconfigured, fixed-scope solution.mySAP All-in-One solutions are based on the mySAP Business Suite family of business solutions and SAP® Best Practices offer-ings. They support predefined business processes and industry best practices and can be individually configured to meet your needs. Each solution includes tools to ensure rapid and success-ful implementation. Tools for data transformation, along with thorough preparation of end-user training, help you achieve rapid return on investment and quick time to benefit.mySAP™ All-in-One solutions are designed to meet the needs of small and midsize businesses with industry-specific IT requirements. Supported by a comprehensive network of SAP business partners, mySAP All-in-One solutions are microvertically designed, preconfigured, affordable, and quickly implemented, allowing you to streamline business processes, increase efficiency,and achieve a rapid return on investment. Because they are based on the highly scalable and powerful mySAP Business Suite solutions, qualified mySAP All-in-One solutions can grow with your business,protecting your investmentfor the future.SAP Solution Brief mySAP All-in-OneQualified mySAP All-in-One solutions support the continued growth and flexibility that today’s small and midsize businesses demand. You no longer need to piece together hard-to-integrate and difficult-to-maintain best-of-breed solutions or customize rigid applications. Invest instead in a qualified mySAP All-in-One solution that is based on preconfigured business processes tailored to your industry.With this foundation, you can implement mySAP All-in-One solutions quickly and realize a healthy return on investment faster than you thought possible. And when your business needs change – as they inevitably will in today’s dynamic economy –you have the full power of mySAP Business Suite to support you going forward. That’s value that businesses of every size can count on.And SAP is no newcomer to the smaller-business market. Currently, nearly half of all SAP customer installations are in companies with annual revenues of less than US$200 million. Today, more and more small and midsize businesses – including over 6,000 mySAP All-in-One customers – are turning to SAP solutions.Comprehensive Support for Specific Industries mySAP All-in-One solutions are built and supported by a compre-hensive network of business partners, each of which has extensive expertise in specific microvertical markets, industries, and geographies. These partners develop and preconfigure business processes with all the necessary supporting documentation and online support. As a result, each solution is implemented quickly and cost-effectively with maximum flexibility and minimal disruption to the business. After the initial implementation, SAP business partners will work with you to maximize the bene-fits of the underlying applications. Partners can also help you adopt new processes to support areas of your business that may not have been considered in the first phase. SAP will help you identify the best partner for your needs, according to your indus-try segment, geographic location, and specific requirements.mySAP All-in-One solutions offer the following: •Complete integrated business management–Fully integrated business applications, including customerrelationship management, powered by the SAP NetWeaver™platform–Support for industry-leading business processes fromSAP Best Practices offerings, based on industry knowledgegained from nearly 19,000 customers in more than20 industries–Unsurpassed experience in business applications •Investment security–A solution that grows with your business–A robust and secure solution–A financially secure vendor with a forward-looking strategy –Avoidance of costly future migrations•Rapid, cost-effective implementation–Fixed-scope approach–Out-of-the-box solutions based on industry best practicesand templates (developed by SAP and your business partner) –Significant return on investment•Unparalleled adaptability–Preconfigured industry solutions for maximum fit andminimal customization–Solutions that can be extended and changed using theunparalleled power of the mySAP Business Suite familyof business solutions–Support for specific roles and job functions–Microvertical industry expertise of your SAP business partner •Support for e-business and collaboration–Leading-edge e-business processes–Collaboration across the value chain–Setup of flexible supply chains and customer and partnerextranetsProven Value – Within Your Budget Preconfigured mySAP All-in-One solutions help you to col-laborate seamlessly with employees, partners, customers, and suppliers across enterprise boundaries. These solutions also inte-grate users, processes, and data within your organization and beyond, creating unparalleled efficiencies. And a qualified mySAP All-in-One solution empowers your users, delivering the access, information,applications, and services they need to do their jobs and to help the organization grow and succeed. You can count on the following benefits:Rapid Return on InvestmentQualified mySAP All-in-One solutions are installed using rapid implementation techniques that can reduce costs by more than 50% over traditional approaches. And the solutions’ scalability means that you invest only once – even as your organization changes and grows.Enhanced Productivity and Cost ControlThe out-of-the-box functionality of a mySAP All-in-One solution allows users to proficiently manage a selection of financial, supply chain, customer relationship, and other crucial business processes. This flexibility generates new efficiencies across your organization and beyond to your partners and suppliers.Out-of-the-Box Industry Functionality Preconfigured, powerful industry functionality makes even the most unusual business applications common to your industry easy to implement and run. Best of all, you don’t need to buy special software. For example, a qualified mySAP All-in-One solution might come with preconfigured software functions to handle the special needs of aerospace manufacturers during their product development cycles. A qualified mySAP All-in-One solution for the tier-two automotive manufacturing solution might address the scheduled order process, while the business services solution might include time booking, recording, and billing processes. Expanded Cross-Industry FunctionalityCustomer relationship management packages for mySAP All-in-One solutions can help you enhance your bottom and top lines. The packages consist of robust functionality based on SAP Best Practices for Customer Relationship Management and are delivered with fixed-scope implementations. With mySAP Customer Relationship Management functionality, you can realize fast time to benefit and lower total cost of ownership while increasing sales, retaining customers, and enhancing customer loyalty.Reliable Performance from Qualified PartnersmySAP All-in-One solutions are created and delivered by qualified SAP business partners with deep expertise within your industry. They build solutions that provide the reliable perfor-mance your organization needs to grow profitably. These partners have tailored business processes, documentation, and reports to meet your needs. To achieve qualification status, partners must demonstrate extensive industry experience and the ability to deploy solutions – and that means you benefit from a tried-and-tested solution delivered by a competent partner. Moreover, SAP operates a qualification process for solutions included in mySAP All-in-One, ensuring that they deliver func-tions and processes appropriate both for the industry and for the smaller business. The qualification process also takes into account the implementation methodology and supporting collateral, such as training material and online help.Powered by SAP NetWeavermySAP All-in-One solutions are powered by the SAP NetWeaver platform, the open integration and application platform that enables change. SAP NetWeaver helps companies align IT with their business. It allows companies to obtain more business value from existing IT investments and to deploy a services-oriented architecture. SAP NetWeaver reduces total cost of ownership and complexity across the entire IT landscape.SAP NetWeaver powers mySAP Business Suite, SAP xApps™ packaged composite applications, and partner solutions. It provides the best way to integrate all systems running SAP or non-SAP software. SAP NetWeaver unifies integration technolo-gies into a single platform and is preintegrated with business applications, reducing the need for custom integration.Claim Your Power Supported by SAP’s 30 years of business experience, mySAP All-in-One solutions enable small and midsize businesses to drive new business value – increasing revenues through additional business opportunities, supporting higher levels of innovation,improving the effectiveness of sales and marketing campaigns,enhancing supply chain visibility and customer responsiveness,and better anticipating market needs. You can do all this while working more efficiently, reducing costs, and streamlining processes.To learn more about how qualified mySAP All-in-One solutions can bring power and efficiency to your business, or to find your local business partner, visit our Web site at /solutions/smb/allinone . /contactsap50 061 060 (05/04)©2005 by SAP AG. All rights reserved. SAP , R/3, mySAP , mySAP .com, xApps, xApp, SAP NetWeaver, and other SAP products and services mentioned herein as well as their respective logos are trademarks or registered trademarks of SAP AG in Germany and in several othercountries all over the world. All other product and service names mentioned are the trademarks of their respective companies. Data contained in this document serves informational purposes only. National product specifications may vary. Printed on environmentally friendly paper.These materials are subject to change without notice. These materials are provided by SAP AG and its affiliated companies (“SAP Group”)for informational purposes only, without representation or warranty of any kind, and SAP Group shall not be liable for errors or omissions with respect to the materials. The only warranties for SAP Group products and services are those that are set forth in the express warranty state-ments accompanying such products and services, if any. Nothing herein should be construed as constituting an additional warranty.。

ieeee transaction 的latex模板 -回复

ieeee transaction 的latex模板 -回复

ieeee transaction 的latex模板-回复IEEEE Transaction Template in LaTeX1. Introduction to LaTeX:LaTeX is a typesetting system commonly used for academic and technical documents. It is particularly popular in the scientific community for its ability to handle complex mathematical equations, algorithms, and graphs. In this article, we will discuss how to create an IEEEEE transaction in LaTeX using its official template.2. Installing LaTeX:To use LaTeX, you need to install a distribution package, such as MikTeX (Windows) or MacTeX (Mac). These distributions include all the necessary files, packages, and tools to compile LaTeX documents. Once you have installed the distribution, you can use any text editor to write LaTeX code.3. Document Class and Packages:To create an IEEE transaction document, you need to specify the document class and include the necessary packages. Begin your LaTeX code with the following lines:\documentclass[journal]{IEEEtran}\usepackage{cite}\usepackage{graphicx}\usepackage{amsmath}\usepackage{algorithm}\usepackage{algorithmic}Here, we have loaded several commonly used packages such as'cite' for bibliography management, 'graphicx' for handling figures, 'amsmath' for mathematical symbols, and 'algorithm' with'algorithmic' for algorithm implementation.4. Title and Author Information:After including the packages, provide the necessary information about the paper's title, authors, and affiliations:\title{Your Title}\author{Author 1, Author 2, and Author 3\\Department, Institution, City, Postal Code, Country\\Email: author@example}5. Abstract, Keywords, and Body:Next, include the abstract, keywords, and the main body of yourpaper:\begin{document}\maketitle\begin{abstract}Your abstract goes here.\end{abstract}\begin{IEEEkeywords}Keyword 1, Keyword 2, Keyword 3, ... \end{IEEEkeywords}\section{Introduction}Your introduction text.\section{Methodology}Your methodology details.\section{Results}Your result description.\section{Discussion}Your discussion and analysis.\section{Conclusion}Your conclusion statement.\bibliographystyle{IEEEtran}\bibliography{references}\end{document}6. Citations and Bibliography:To include citations and generate a bibliography, provide the references using a .bib file (e.g., references.bib) and add the following commands at the end of your document:\bibliographystyle{IEEEtran}\bibliography{references}7. Compiling the Document:After completing the LaTeX code, save the file with a .tex extension. Open your command prompt or terminal, navigate to the directory where the .tex file is saved, and execute the following commands: pdflatex your_file_name.texbibtex your_file_name.auxpdflatex your_file_name.texpdflatex your_file_name.texBy running these commands, you will compile the LaTeX code and generate a PDF output.8. Conclusion:In this article, we discussed how to create an IEEE transaction using the official LaTeX template. By following the steps outlined, you will be able to produce a well-formatted and professional-looking document for your research or academic work. LaTeX's flexibility, particularly in handling mathematical equations and scientific notations, makes it a valuable tool for publishing in technical journals and conferences.。

学术英语写作_东南大学中国大学mooc课后章节答案期末考试题库2023年

学术英语写作_东南大学中国大学mooc课后章节答案期末考试题库2023年

学术英语写作_东南大学中国大学mooc课后章节答案期末考试题库2023年1.Which of the following is NOT the purpose of nominalization?答案:Express concrete concepts.2.Which of the following statement is TRUE?答案:The sentence nominalization formula consists of 4 steps, writing a simple sentence, nominalizing a main verb or adjective, adding a second verb and writing the additional information.3.To avoid plagiarism, graduate students can________.答案:not use exactly the same language when borrowing ideas4.Which of the following statements is TRUE in terms of paraphrasing?答案:Lexical+syntactic paraphrasing is better than separate use of lexical orsyntactic paraphrasing.5.To begin the Discussion section, you may remind readers of your ______,preferably in a single sentence.答案:goals6.Discussion sections which do not have a Conclusion may end with _________.答案:what the findings imply7.Unlike the Abstract and Introduction, the Conclusions section does not_________.答案:provide background details8.One of the key elements of the Conclusion section is a final _________ on thesignificance of the findings in terms of their implications and impact, along with possible applications to other areas.judgment9.________ answer the question “Why did the event happen?”答案:Causes10.If you can discuss a cause without having to discuss any other causes, thenvery likely it is a ______ cause.答案:direct11. A ________ means two unrelated things happening together.答案:coincidence12.If you are describing ideas and concepts, ________ language is appropriate.abstractpared with the sign ‘HOUSE FOR SALE’, ‘HOME FOR SALE’ may bepreferred for advertisement because the word ‘home’ is full of _________.答案:connotations14.Speaking of basic sentence structures we may think of all of the followingexcept ________.答案:common sentences15. A ___ thesis statement may make a claim that requires analysis to support andevolve it.答案:strong16.“Shopping malls are wonderful places.” is a weak thesis statement in that it_________.答案:offers personal conviction as the basis for the claim17. A weak thesis statement _________.答案:either makes no claim or makes a claim that does not need proving18.Which of the following words or expressions can NOT be used as a sequentialmarker?答案:although19.The authors prefer to use the adjectives such as “apparent” and “obvious”when describing the information of the graphs because they want to____ the significant data.答案:highlight20.Which of the following statements is NOT true when we describe theinformation in a graph and make some comparison?答案:We only compare the information which we are very familiar with.21.Which of the words and expressions can be used to show contrast?答案:on the contrary22.The Method Section provides the information by which the ______ andcredibility of a study can ultimately be judged.答案:validity23.Which of the statements is NOT true about the Method Section?答案:The Method Section is very important because it provides the information of data collection and data analysis.24.When referring to a figure, you can use an expression like ______.答案:As shown in Figure 1…25.To write a literature review, what should you write about after discussing thelimitations of the previous works?答案:The gap revealed by these limitations.26.If you plan to discuss various theories, models, and definitions of keyconcepts in your literature review, which of following method would youadopt to organize it?答案:Theoretical27.Which of the following tenses could be used to refer to ongoing situations, i.e.when authors are still investigating a particular field?答案:The present perfect28.______ is used for communication between the editor and authors.答案:Cover letter29.The register of the following discourse is ____.Dear Professor Adams, I’m texting you to ask for a sick leave for your class of next week. I was just diagnosed as having flu, which is contagious. Can I have your PowerPoint to make it up? Thank you very much for your understanding.答案:consultative30.The register of the following discourse is ____.I’m sick and tired of your crap!答案:personal31.For beginner writers, the title should be as short as possible.答案:错误32.If you find a book highly relevant to your essay, you don't have to search forother materials.答案:错误33. A student should choose a topic for their essay based on professors’ interest.答案:错误34.Nominalization makes writing more “written” and professional.答案:正确35.Keywords can be selected from the method used in a paper.答案:正确36.IEEE style is always used in medicine.答案:错误37.There are only two reference styles.答案:错误38.Reference is used to avoid unethical behaviors in academic writing.答案:正确39.For a paper, properly selected keywords can increase its possibilities of beingread and cited.答案:正确40.Cover letter is written to the author of a paper.答案:错误41.The contact information is unnecessary to be provided in a cover letter.答案:错误42.Acknowledgement sometimes will be omitted in a paper.答案:正确43.Acknowledgement is used to express gratitude to tutors but not fundproviders.答案:错误44.The elements included in the Method Section should be the same in differentjournals.答案:错误45.When you conduct your experiments by following other researchers’methods, you should acknowledge these researchers to avoid plagiarism.答案:正确46.We only use the past tense when writing the Method Section and the ResultsSection.答案:错误47.The purpose of writing a literature review is to produce a thesis statementbased on the current understanding about the research topic.答案:正确48.The simple literature review model not only presents the current state ofknowledge about a topic but also argues how this knowledge reasonablyleads to a problem or to a question requiring original research.答案:错误49.Your professor discussed some interesting ideas in today’s lecture on Plato. Itis not academically dishonest if you decide to use these ideas in your paper without giving the source.答案:错误50.To summarize is to give a shortened version of the written or spokenmaterial, stating the main points and leaving out anything that is notessential.答案:正确。

proofread notice of recordation of assignment -回复

proofread notice of recordation of assignment -回复

proofread notice of recordation ofassignment -回复Notice of Recordation of Assignment[Proofread the following Notice of Recordation of Assignment and write a step-by-step guide on how to fill it out correctly. Your guide should be 1500-2000 words long.]Step 1: Understand the Purpose of the Notice of Recordation of AssignmentBefore we dive into filling out the Notice of Recordation of Assignment, let's first understand its purpose. This document serves to record the transfer of ownership of intellectual property from one party to another. When a patent, trademark, or copyright is being assigned or transferred, this notice ensures that the new owner's rights are officially recognized by the appropriate government authorities.Step 2: Gather the Required InformationTo fill out the Notice of Recordation of Assignment accurately, youwill need to gather the following essential information:1. Assignor: The name and address of the party currently holding the intellectual property rights are being transferred.2. Assignee: The name and address of the party acquiring the intellectual property rights.3. Correspondence Address: The address to which any official communications related to this assignment should be sent.4. Intellectual Property Rights: Specific information about the intellectual property being assigned, such as patent number, trademark registration number, or copyright registration number.5. Effective Date: The date on which the assignment becomes legally valid.6. Execution Date: The date when the assignment was signed by all parties involved.7. Assignor's Execution: The assignor's signature, along with theirname and title.8. Assignee's Execution: The assignee's signature, along with their name and title.Remember, it is crucial to have accurate and up-to-date information. Any errors or omissions in the Notice of Recordation of Assignment could potentially invalidate the transfer of ownership.Step 3: Start the Notice of Recordation of AssignmentBegin by typing "Notice of Recordation of Assignment" at the top of the document. Use bold and capitalize the text to ensure it stands out.Step 4: Provide the Basic InformationBelow the header, start by providing the following basic information:- Intellectual Property State/Country: Indicate the applicable stateor country where the intellectual property rights are being assigned or transferred.- Reel/Frame: This field is typically filled by the government authorities upon submission. Leave it blank for now.- Assignor (Name and Address): Include the assignor's full legal name and complete address.- Assignee (Name and Address): Include the assignee's full legal name and complete address.- Correspondence Address: Provide the address where any official communications regarding this assignment should be sent.Step 5: Specify the Intellectual Property RightsIn this section, you need to provide specific details about the intellectual property rights being assigned. Use separate paragraphs for each different intellectual property type. For example:1. Patents:- Patent Number: Indicate the patent number(s) being assigned. - Title of Invention: Provide the title of the invention covered by the assigned patent(s).2. Trademarks:- Trademark Registration Number: State the registration number(s) of the assigned trademark(s).- Mark: Describe the mark(s) being assigned, e.g., brand name, logo.3. Copyrights:- Copyright Registration Number: Mention the registration number(s) of the assigned copyright(s).- Title of Work: Specify the title(s) of the work(s) covered by the assigned copyright(s).Step 6: Indicate Effective Date and Execution Date- Effective Date: Write down the date on which the assignment becomes legally valid. This should be agreed upon by all parties involved.- Execution Date: Indicate the date when the assignment agreement was signed by the assignor and assignee.Step 7: Assignor's ExecutionIn this section, the assignor needs to sign the document, print their name, and provide their title (if applicable). Leave space for their signature, and make sure it aligns with the printed name and title.Step 8: Assignee's ExecutionSimilar to the assignor's execution, the assignee must sign the document, print their name, and provide their title (if applicable). Allow enough space for their signature, and ensure it corresponds to the printed information.Step 9: Review and Submit the Notice of Recordation of AssignmentBefore submitting the Notice of Recordation of Assignment, carefully review the completed document for accuracy. Ensure allinformation is correct, all parties have signed it, and all necessary details have been provided for each type of intellectual property.Once you are confident that everything is accurate, make a copy of the completed document for your records, and submit the original to the appropriate government authorities. Pay any required fees and await confirmation of the recordation.In conclusion, the Notice of Recordation of Assignment is a crucial document for transferring ownership of intellectual property. By following this step-by-step guide, you can ensure that the notice is filled out correctly and increases the likelihood of a smooth transfer process.。

CONSORT 2010 checklist of information to include when reporting a randomised trial

CONSORT 2010 checklist of information to include when reporting a randomised trial

CONSORT 2010 checklist of information to include when reporting a randomised trial*Section/Topic ItemNo Checklist itemReportedon page NoTitle and abstract1a Identification as a randomised trial in the title1b Structured summary of trial design, methods, results, and conclusions (for specific guidance see CONSORT for abstracts) IntroductionBackground and objectives 2a Scientific background and explanation of rationale 2b Specific objectives or hypothesesMethodsTrial design 3a Description of trial design (such as parallel, factorial) including allocation ratio3b Important changes to methods after trial commencement (such as eligibility criteria), with reasons Participants 4a Eligibility criteria for participants4b Settings and locations where the data were collectedInterventions 5 The interventions for each group with sufficient details to allow replication, including how and when they were actually administeredOutcomes 6a Completely defined pre-specified primary and secondary outcome measures, including how and when they were assessed6b Any changes to trial outcomes after the trial commenced, with reasonsSample size 7a How sample size was determined7b When applicable, explanation of any interim analyses and stopping guidelinesRandomisation:Sequencegeneration 8a Method used to generate the random allocation sequence8b Type of randomisation; details of any restriction (such as blocking and block size)Allocationconcealmentmechanism 9 Mechanism used to implement the random allocation sequence (such as sequentially numbered containers),describing any steps taken to conceal the sequence until interventions were assignedImplementation 10 Who generated the random allocation sequence, who enrolled participants, and who assigned participants to interventionsBlinding 11a If done, who was blinded after assignment to interventions (for example, participants, care providers, thoseassessing outcomes) and how11b If relevant, description of the similarity of interventionsStatistical methods 12a Statistical methods used to compare groups for primary and secondary outcomes 12b Methods for additional analyses, such as subgroup analyses and adjusted analysesResultsParticipant flow (a diagram is strongly recommended) 13a For each group, the numbers of participants who were randomly assigned, received intended treatment, and were analysed for the primary outcome13b For each group, losses and exclusions after randomisation, together with reasonsRecruitment 14a Dates defining the periods of recruitment and follow-up14b Why the trial ended or was stoppedBaseline data 15 A table showing baseline demographic and clinical characteristics for each groupNumbers analysed 16 For each group, number of participants (denominator) included in each analysis and whether the analysis was by original assigned groupsOutcomes and estimation 17a For each primary and secondary outcome, results for each group, and the estimated effect size and its precision (such as 95% confidence interval)17b For binary outcomes, presentation of both absolute and relative effect sizes is recommendedAncillary analyses 18 Results of any other analyses performed, including subgroup analyses and adjusted analyses, distinguishingpre-specified from exploratoryHarms 19 All important harms or unintended effects in each group (for specific guidance see CONSORT for harms)DiscussionLimitations 20 Trial limitations, addressing sources of potential bias, imprecision, and, if relevant, multiplicity of analysesGeneralisability 21 Generalisability (external validity, applicability) of the trial findingsInterpretation 22 Interpretation consistent with results, balancing benefits and harms, and considering other relevant evidenceOther informationRegistration23 Registration number and name of trial registryProtocol24 Where the full trial protocol can be accessed, if availableFunding25 Sources of funding and other support (such as supply of drugs), role of funders*We strongly recommend reading this statement in conjunction with the CONSORT 2010 Explanation and Elaboration for important clarifications on all the items. If relevant, we also recommend reading CONSORT extensions for cluster randomised trials, non-inferiority and equivalence trials, non-pharmacological treatments, herbal interventions, and pragmatic trials. Additional extensions are forthcoming: for those and for up to date references relevant to this checklist, see .。

历届诺贝尔经济学奖获得者演讲词

历届诺贝尔经济学奖获得者演讲词

10 Economic Sciences 19691. T HE L URES OF U NSOLVABLE P ROBLEMSDeep in the human nature there is an almost irresistible tendency to concen-trate physical and mental energy on attempts at solving problems that seem to be unsolvable. Indeed, for some kinds of active people only the seemingly un-solvable problems can arouse their interest. Other problems, those which can reasonably be expected to yield a solution by applying some time, energy and money, do not seem to interest them. A whole range of examples illustrating this deep trait of human nature can be mentioned.The mountain climber. The advanced mountain climber is not interested in fairly accessible peaks or fairly accessible routes to peaks. He becomes enthu-siastic only in the case of peaks and routes that have up to now not been con-quered.The Alchemists spent all their time and energy on mixing various kinds of matter in special ways in the hope of producing new kinds of matter. To produce gold was their main concern. Actually they were on the right track in prin-ciple, but the technology of their time was not advanced far enough to assure a success.The alluring symmetry problem in particle physics. Around 1900, when the theory of the atom emerged, the situation was to begin with relatively simple. There were two elementary particles in the picture: The heavy and positively charged PROTON and the light and negatively charged ELECTRON. Subsequently one also had the NEUTRON, the uncharged counterpart of the proton. A normal hydrogen atom, for instance, had a nucleus consisting of one proton, around which circulated (at a distance of 0.5. 10-18 cm) one electron. Here the total electric charge will be equal to 0. A heavy hydrogen atom (deuterium) had a nucleus consisting of one proton and one neutron around which circu-lated one electron. And similarly for the more complicated atoms.This simple picture gave rise to an alluring and highly absorbing problem. The proton was positive and the electron negative. Did there exist a positively charged counterpart of the electron? And a negatively charged counterpart of the proton? More generally: Did there exist a general symmetry in the sense that to any positively charged particle there corresponds a negatively charged counter-part, and vice versa? Philosophically and mathematically and from the view-point of beauty this symmetry would be very satisfactory. But it seemed to be an unsolvable problem to know about this for certain. The unsolvability, however, in this case was only due to the inadequacy of the experimental technology of the time. In the end the symmetry was completely established even experimentally. The first step in this direction was made for the light particles (because here the radiation energy needed experimentally to produce the counterpart, although high, was not as high as in the case of the heavy particles). After the theory of Dirac, the positron, i.e. the positively charged counterpart of the electron, was produced in 1932. And subsequently in 1955 (in the big Berkeley accelerator) the antiproton was produced.The final experimental victory of the symmetry principle is exemplified in the following small summary tableR. A. K. Frisch11Electric charge0-1Note. Incidentally, a layman and statistician may not be quite satisfied with the terminology, because the “anti” concept is not used consistently in connection with the electric charge. Since the antiproton has the opposite charge of the proton, there is nothing to object to the term anti in this connection. The difference between the neutron and the antineutron, however, has nothing to do with the charge. Here it is only a question of a difference in spin (and other properties connected with the spin). Would it be more logical to reserve the terms anti and the corresponding neutr to differences in the electric charge, and use expressions like, for instance counter and the corresponding equi when the essence of the difference is a question of spin (and other properties connected with the spin)? One would then, for in-stance, speak of a counterneutron instead of an antineutron.The population explosion in the world of elementary particles. As research pro-gressed a great variety of new elementary particles came to be known. They were extremely short-lived (perhaps of the order of a microsecond or shorter), which explains that they had not been seen before. Today one is facing a variety of forms and relations in elementary particles which is seemingly as great as the macroscopic differences one could previously observe in forms and relations of pieces of matter at the time when one started to systematize things by considering the proton, the electron and the neutron. Professor Murray Gell-Mann, Nobel prize winner 1969, has made path-breaking work at this higher level of systematization. When will this drive for systematization result in the discovery of something still smaller than the elementary particles?Matter and antimatter. Theoretically one may very precisely consider the existence of the “anti” form of, for instance, a normal hydrogen atom. This anti form would have a nucleus consisting of one antiproton around which circulated one positron. And similarly for all the more complicated atoms. This leads to the theoretical conception of a whole world of antimatter. In theory all this is possible. But to realize this in practice seems again a new and now really unsolvable problem. Indeed, wherever and whenever matter and anti-matter would come in contact, an explosion would occur which would produce an amount of energy several hundred times that of a hydrogen bomb of the same weight. How could possibly antimatter be produced experimentally? And how could antimatter experimentally be kept apart from the normal matter that surrounds us? And how could one possibly find out if antimatter exists in some distant galaxes or metagalaxes? And what reflections would the12 Economic Sciences 1969existence of antimatter entail for the conception of the “creation of the world”, whatever this phrase may mean. These are indeed alluring problems in physics and cosmology which - at least today - seem to be unsolvable problems, and which precisely for this reason occupy some of the finest brains of the world today.Travelling at a speed superior to that of light. It is customary to think that this is impossible. But is it really? It all depends on what we mean by “being in a certain place”. A beam of light takes about two million years to reach from us to the Andromeda nebula. But my thought covers this distance in a few seconds. Perhaps some day some intermediate form of body and mind may permit us to say that we actually can travel faster than light.The astronaut William Anders, one of the three men who around Christmas time 1968 circled the moon in Apollo 8 said in an interview in Oslo (2):“Nothing is impossible . . .it is no use posting Einstein on the wall and say: Speed of light-but not any quicker . . .30 nay 20, years ago we said: Impos-sible to fly higher than 50 000 feet, or to fly faster than three times the speed of sound. Today we do both.”The dream of Stanley Jevons. The English mathematician and economist Stanley Jevons (1835-1882) dreamed of the day when we would be able to quantify at least some of the laws and regularities of economics. Today - since the break-through of econometrics - this is not a dream anymore but a reality. About this I have much more to say in the sequel.Struggle, sweat and tears. This slight modification of the words of Winston Churchill is admirably suited to caracterize a certain aspect of the work of the scientists - and particularly of that kind of scientists who are absorbed in the study of “unsolvable” problems. They pass through ups and downs. Some-times hopeful and optimistic. And sometimes in deep pessimism. Here is where the constant support and consolation of a good wife is of enormous value to the struggling scientist. I understand fully the moving words of the 1968 Nobel prize winner Luis W. Alvarez when he spoke about his wife: “She has provided the warmth and understanding that a scientist needs to tide him over the periods of frustration and despair that seem to be part of our way of life” (3).2. A P HILOSOPHY OF C HAOS. T HE E VOLUTION TOWARDS A M AMMOTH S INGULAR T RANSFORMATIONIn the The Concise Oxford Dictionary (4) - a most excellent book - "philo-sophy"is defined as“love of wisdom or knowledge, especially that which deals with ultimate reality, or with the most general causes and principles of things”.If we take a bird’s eye-view of the range of facts and problems that were touched upon in the previous section, reflections on the “ultimate reality”quite naturally come to our mind.A very general point of view in connection with the “ultimate reality” I developed in lectures at the Institut Henri Poincaré in Paris in 1933. Subse-quently the question was discussed in my Norwegian lectures on statistics (5).R. A. K. Frisch 13The essence of this point of view on “ultimate reality” can be indicated by a very simple example in two variables. The generalization to many variables is obvious. It does not matter whether we consider a given deterministic, em-pirical distribution or its stochastic equivalence. For simplicity consider an empirical distribution.Let x 1 and x 2 be the values of two variables that are directly observed in aseries of observations. Consider a transformation of x 1 and x 2 into a new setof two variables y 1 and y 2. For simplicity let the transformation be linear i.e.The b’s and a’s being constants.(2.2)is the Jacobian of the transformation, as it appears in this linear case.It is quite obvious - and well known by statisticians - that the correlation coefficient in the set (y 1y 2) will be different from-stronger or weaker than-thecorrelation coefficient in the set (x 1x 2) (“spurious correlation”). It all dependson the numerical structure of the transformation.This simple fact I shall now utilize for my reflections on an “ultimate reality”in the sense of a theory of knowledge.It is clear that if the Jacobian (2.2)is singular, something important happens.In this case the distribution of y 1 and y 2 in a (y 1y 2) diagram is at most one-dimensional, and this happens regardless of what the individual observations x 1 and x 2 are - even if the distribution in the (x 1x 2) diagram is a completelychaotic distribution. If the distribution of x 1 and x 2 does not degenerate to apoint but actually shows some spread, and if the transformation determinant is of rank 1, i.e. the determinant value being equal to zero but not all its elements being equal to zero, then all the observations of y 1 and y 2 will lie on a straight linein the (y l y2) diagram. This line will be parallel to the y 1 axis if the first row ofthe determinant consists exclusively of zeroes, and parallel to the y 2 axis if thesecond row of the determinant consists exclusively of zeroes. If the distribution of x 1 and x 2 degenerates to a point, or the transformation determinant is of rankzero (or both) the distribution of y 1 and y 2 degenerates to a point.Disregarding these various less interesting limiting cases, the essence of the situation is that even if the observations x 1 and x 2 are spread all over the (x 1x 2)diagram in any way whatsoever, for instance in a purely chaotic way, the corresponding values of y 1 and y 2 will lie on a straight line in the (y 1y 2) diagramwhen the transformation matrix is of rank 1. If the slope of this straight line is finite and different from zero, it is very tempting to interpret y 1 as the “cause”of y 2 or vice versa. This “cause”,however, is not a manifestation of somethingintrinsic in the distribution of x 1 and x 2, but is only a human figment, a humandevice, due to the special form of the transformation used.What will happen if the transformation is not exactly singular but only14Economic Sciences 1969near to being singular? From the practical viewpoint this is the crucial question. Here we have the following proposition:(2.3)Suppose that the absolute value of the correlation coefficient r x i n(x1x2) is not exactly 1. Precisely stated, suppose that(2.3.1)0 1.This means that ε may be chosen as small as we desire even exactly 0, but it must not be exactly 1. Hence |rX|may be as small as we please even exactly 0, but not exactly 1.Then it is possible to indicate a nonsingular transformation from x1 and x2to the new variables y1 and y2with the following property: However small wechoose the positive, but not 0, number δ, the correlation coefficient rYi n(yl y2) will satisfy the relation(2.3.2) |rY|( 0R. A. K. Frisch 15 techniques. The latter is only an extension of the former. In principle there is no difference between the two. Indeed, science too has a constant craving for regularities. Science considers it a triumph whenever it has been able by some partial transformation here or there, to discover new and stronger regularities. If such partial transformations are piled one upon the other, science will help the biological evolution towards the survival of that kind of man that in the course of the millenniums is more successful in producing regularities. If “the ultimate reality” is chaotic, the sum total of the evolution over time - biological and scientific - would tend in the direction of producing a mammoth singular transformation which would in the end place man in a world of regularities. How can we possibly on a scientific basis exclude the possibility that this is really what has happened? This is a crucial question that con-fronts us when we speak about an “ultimate reality”. Have we created the laws of nature, instead of discovering them? Cf. Lamarck vs. Darwin.What will be the impact of such a point of view? It will, I believe, help us to think in a less conventional way. It will help us to think in a more advanced, more relativistic and less preconceived form. In the long run this may indirectly be helpful in all sciences, also in economics and econometrics.But as far as the concrete day to day work in the foreseeable future is con-cerned, the idea of a chaotic “ultimate reality” may not exert any appreciable influence. Indeed, even if we recognize the possibility that it is evolution of man that in the long run has created the regularities, a pragmatic view for the fore-seeable future would tell us that a continued search for regularities - more or less according to the time honoured methods - would still be “useful” to man.Understanding is not enough, you must have compassion. This search for regularities may well be thought of as the essence of what we traditionally mean by the word “understanding”. This “understanding”is one aspect of man’s activity. Another - and equally important - is a vision of the purpose of the understand-ing. Is the purpose just to produce an intellectually entertaining game for those relatively few who have been fortunate enough through intrinsic abilities and an opportunity of top education to be able to follow this game? I, for one, would be definitely opposed to such a view. I cannot be happy if I can’t believe that in the end the results of our endevaours may be utilized in some way for the betterment of the little man’s fate.I subscribe fully to the words of Abba Pant, former ambassador of India to Norway, subsequently ambassador of India to the United Arab Republic, and later High Commissioner of India to Great Britain:“Understanding is not enough, you must have compassion.” (6).3. A B RIEF S URVEY OF THE D EVELOPMENT OF E CONOMICS IN THE L AST C ENTURY Turning now to the more specifically economic matters, it is inevitable that I should begin by making a brief survey of the development of economics in the last century.In the middle of the 19th century John Stuart Mill (1806-1873) in his famous work “Principles of Economics”said that so far as general principles are concerned the theory of value and price was now completely elaborated.16 Economic Sciences 1969There was nothing more to add, he said, neither for himself nor any other author. To us with our relativistic view on knowledge and the development of science, it is difficult to understand that such a statement could be made. But to the generation that lived at that time these words by Mill appeared to be very close to the truth. In Mill’s “Principles” the ideas of Adam Smith (1723-1790), David Ricardo (1772-l823)and Thomas Robert Malthus (1766-1834) had been knit together into an organic, logically and seemingly complete whole.Subsequent developments have thoroughly denounced Stuart Mill’s words. Two break-throughs have emerged in economic theory since the time of Stuart Mill.The classical theory of value - as we find it streamlined in Stuart Mill - was essentially a theory of production costs based on the thinking of the private entrepreneur. The entrepreneur will think about as follows: “If I could only cut my selling price I would be able to draw the customers to me. This, how-ever, is also the way my competitors think. So, there emerges a sort of gravita-tional force that pulls prices down. The cost of production is so to speak the solid base on to which the prices fall down and remain. Hence the cost of production is “the cause”of prices. This general viewpoint the classical economists applied with great sagacity to a whole range of commodities , to the relation between wages and profits and to the theory ofinternational prices etc.This theory contains, of course, an irrefutable element of truth. But it is too simple to give even a crude presentation of the forces at play. The economic process is an equilibrium affair where both technological and subjective forces. are at play. The subjective element was nearly left out by the classicists.On this point economic theory was completely renewed in the years between 1870 and 1890 when a number of Austrian economists headed by Karl Menger (1840-1921) undertook a systematic study of the human wants and their place in a theory of prices. Similar thoughts were expressed also by the Swiss Léon Walras (1834-1910) and the Englishman Stanley Jevons (1835-l882). This was the first break-through since Stuart Mill.The Englishman Alfred Marshall (1842-1924) subsequently did much to combine the subjective viewpoint and the cost of production viewpoint. This led to what we now usually speak of as the neo-classical theory.Neither the classicists nor the neo-classicists did much to verify their theo-retical results by statistical observations. The reason was partly that the statistics were poor, and partly that neither the classical nor the neo-classical theory was built out with the systematic statistical verification in view. The architec-tural plan of the theory had so to speak not made room for this verification. This fact was criticized by the German historical school under the leadership of Gustav Schmoller (1838-1917) and by the American institutionalists. These schools, however, had an unfortunate and rather naive belief in something like a “theory-free” observation.“Let the facts speak for themselves”. The impact of these schools on the development of economic thought was therefore not very great, at least not directly. Facts that speak for themselves, talk in a very naive language.A. A. K. Frisch17In the first part of the 20th century the picture changed. Partly under the influence of the criticism of the historical school and the institutionalists the theoreticians themselves took up a systematic work of building up the theory in such a way that the theory could be brought in immediate contact with the observational material. One might say that from now on economics moved into that stage where the natural sciences had been for a long time, namely the stage where theory derives its concepts from the observational technique, and in turn theory influences the observational technique.For the first time in history it now seemed that the work on the theoretical front in economics - now to a large extent mathematically formulated - and the work on the outer descriptive front should converge and support each other, giving us a theory that was elaborate enough to retain the concrete observatio-nal material, and at the same time a mass ofobservations that were planned and executed with a view to be filled into the theoretical structure.Of course, there had been forerunners for such a combination of economic theory, mathematics and statistics even earlier. It was represented by such men as Johan Heinrich von Thünen (1783-l850), Augustin Cournot (1801-1877), A. J. Dupuit (1804-1866) and Hermann Heinrich Gossen (1810-1858). But from the first part of the 20ieth century the movement came in for full. This was the beginning of the econometric way of thinking. And this is what I would call the second break-through since Stuart Mill.A crucial point in this connection is the quantification of the economic concepts, i.e. the attempts at making these concepts measurable. There is no need to insist on what quantitative formulation of concepts and relations has meant in the natural sciences. And I would like to state that for more than a generation it has been my deepest conviction that the attempted quantification is equally important in economics.The quantification is important already at the level of partial analysis. Here one has studied the demand for such important commodities as sugar, wheat, coffe, pig iron, American cotton, Egyptian cotton etc.And the quantification is even more important at the global level. Indeed, at the global level the goal of economic theory is to lay bare the way in which the different economic factors act and interact on each other in a highly complex system, and to do this in such a way that the results may be used in practice to carry out in the most effective way specific desiderata in the steering of the economy.As long as economic theory still works on a purely qualitative basis without attempting to measure the numerical importance of the various factors, practically any “conclusion”can be drawn and defended. For instance in a depression some may say: A wage reduction is needed because that will increase the profits of the enterprises and thus stimulate the activity. Others will say: A wage increase is needed because that will stimulate the demand of the consumers and thus stimulate activity. Some may say: A reduction of the interest rate is needed because this will stimulate the creation of new enter-prises. Others may say: An increase of the interest rate is needed because that18Economic Sciences1969will increase the deposits in the banks and thus give the banks increased capacity of lending money.Taken separately each of these advocated measures contains some particle of truth, taken in a very partial sense when we only consider some of the obvious direct effects, without bothering about indirect effects and without comparing the relative strengths of the various effects and countereffects. Just as one would say: If I sit down in a rowing boat and start rowing in the ordinary way, the boat will be driven backwards because of the pressure exerted by my feet in the bottom of the boat.In a global analysis that shall be useful for practical applications in economic policy in the nation as a whole, the gist of the matter is to study the relative strengths of all relevant effects and countereffects, hence the need for quanti-fication of the concepts.This perhaps is the most general and most salient formulation of the need for econometrics. How far we would be able to go in this direction was of course another question. But at least the attempt had to be made if economics were to approach the state of an applied science.It goes without saying that econometrics as thus conceived does not exhaust all the contents of economics. We still need - and shall always need - also broad philosophical discussions, intuitive suggestions of fruitful directions of research, and so on. But this is another story with which I will not be concerned here (7). Let me only say that what econometrics - aided by electronic computers - can do, is only to push forward by leaps and bounds the line of demarcation from where we have to rely on our intuition and sense of smell.4. S OME H ISTORICAL N OTES ON THE F OUNDING OF T HE E CONOMETRIC S OCIETY In the files of the Oslo University Institute of Economics I have located a folder containing letters and copies of letters dating from the years when the plans for an econometric society took shape. Here are interesting ideas and opinions from outstanding people in different parts of the world. Most of these people have now passed away.One of them was my good friend professor Francois Divisia. His letter of 1 September 1926 from his home in Issy les Moulineaux (Seine) was handwritten in his fine characters, 8 pages to the brim with every corner of the paper used. Most of the letter contained discussions on specific scientific questions, but there were also some remarks of an organizational sort. He spoke for instance of his correspondence with professor Irving Fisher of Yale. About this he said: ”Je suppose qu'il s’agit d’une liste destinée àétablir une liason entre les écono-mistes mathématiciens du monde entier”.Whether this was an independent initiative on the part of Fisher in connection with a plan for a society, or it was an outcome of my previous correspondence with Fisher, I have not been able to ascertain, because the files are missing. Divisia continues:“Dans la politique, je ne suis pas très partisan des organismes internationaux . . .mais dans les domaines desinteresses comme celui de la science, j’en suis au contraire partisan sans restriction”.Answering Divisia in a letter of 4 September 1926 I said inter alia: “JeR. A. K. Frisch19 saisis avec enthousiasme l’idee d’une liste ou d’un autre moyen de communication entre les économistes mathematiciens du monde entier. J’ai eu moi-même l’idée de tâcher de réaliser une association avec un périodique consacré à ces questions. Il est vrai que les périodiques ordinaires tels que la Revue d’économie politique ou l’Economic Journal, etc. acceptent occasionnellement des memoires mathematiques, mais toujours est-il que l’auteur d’un tel memoire se trouve duns l’obligation de restreindre autant que possible l’emploi de symboles mathematiques et le raisonnement par demonstration mathematique.Je connais déjà plusieurs economistes-mathématiciens dans differents pays, et j'ai pensé érire un jour ou l’autre une lettre à chacun d’eux pour avoir leur opinion sur la possiblité d’un périodique, (que dites-vous d’une “Econometrica”?, la soeur du”Biometrika”.) Maintenant je serai heureux d’avoir votre opinion d’abord. Si vous pensez que cela vaut la peine on pourra peut-être commencer par former un cercle restreint qui s’adressera plus tard au public. Dans les années à venir j’aurai probablement l’occasion de voyager souvent en Amérique et en Europe, alors j'aurai l’occasion de faire la connaissance des économistes qui pourront s’intéresser à ce projet, et j’aurai l’occasion de faire un peu de propagande. Peut-être pourra-t-on obtenir l’appui d’une des grandes fondations américaines pour la publication du périodique.Voici une liste de quelque personnes que je connais par correspondance comme étant très intéressées au sujet de l’économie pure: Jaime Algarra, Professeur d’éc. pol. UniversitéBarcelone, L. von Bortkievicz, Professeur de Stat. Univ. Berlin, E. Bouvier, Prof. de S C. fin. Univ. Lyon, K. Goldziher, Prof. Techn. Hochschule, Budapest, K. G. Hagström, Actuaire, Stockholm, Charles Jordan, Docteur és S C., Budapest, Edv. Mackeprang, Dr. polit., Copenhague, W. M. Persons, Prof. de Stat. Harvard Univ. Cambridge. Mass. U.S.A., E. Slutsky, Moscou, A. A. Young, Prof. d’éc. polit., Harvard Univ. Cam-bridge. Mass. U.S.A., P. Rédiadis. Contreamiral, Athènes.”I mentioned also a number of others, among whom were: Anderson, Prof. Ecole Supérieure de Commerce, Varna, Bulgarie, Graziani, Prof. d’éc. pol. Univ. Napoli, Italie, Huber, Dir. de la Stat.gén. de la France, Paris, Ricci, Prof. Univ. Roma, Gustavo del Vecchio R. Univ. Commerciale, Trieste.In a letter of 22 September 1926 Divisia answered inter alia: “Je suis, vous le savez, tout à fait d’accord avec vous sur l’utilité d’une Association Internationale d’Éco-nomie pure et j'aime beaucoup le titre d’"Econometrica" auquel vous avez songé pour un périodique. Toutefois, avant de passer aux realisations, je pense qu’il est indispensable de réunir tout d’abord un certain nombre d’adhésions. .. . je me demande s’il ne serait pas aussi possible et opportun de s’aboucher à une organisation existente comme l’lnstitut international de statistique. . . .Enfin, d’ores et déjà, tout mon concours vous est acquis.”In a letter of 1 November 1926 I wrote to Divisia: “Mon départ pour l’Amérique a été ajourné de quelques mois. J’en ai profité pour écrire aux personnes suivantes: Bortkievicz, Université de Berlin, A. L. Bowley, London School of Economics, Charles Jordan,Université de Budapest, Eugen Slutsky, Moscou, pour avoir leur opinion sur l’utilité et la possibilité de réaliser d’abord un cercle restreint et plus turd peut-être une association formelle . . .J’ai trouvé que je n’ai pas pû expliquer la chose d’une meilleure fagon qu’en copiant certains passages de votre dernière lettre . . .C’est peut-être là une petite indiscretion dont je me suis rendu coupable.”The same day 1 November 1926 I wrote to the four persons in question. In。

3GPP 5G基站(BS)R16版本一致性测试英文原版(3GPP TS 38.141-1)

3GPP 5G基站(BS)R16版本一致性测试英文原版(3GPP TS 38.141-1)

4.2.2
BS type 1-H.................................................................................................................................................. 26
4.3
Base station classes............................................................................................................................................27
1 Scope.......................................................................................................................................................13
All rights reserved. UMTS™ is a Trade Mark of ETSI registered for the benefit of its members 3GPP™ is a Trade Mark of ETSI registered for the benefit of its Members and of the 3GPP Organizational Partners LTE™ is a Trade Mark of ETSI registered for the benefit of its Members and of the 3GPP Organizational Partners GSM® and the GSM logo are registered and owned by the GSM Association

postscript language reference -回复

postscript language reference -回复

postscript language reference -回复PostScript Language Reference: A Step-by-Step GuideIntroduction to PostScript Language:PostScript is a programming language primarily used for document printing and typesetting. It is a page description language that can describe both text and graphics for output devices, such as printers and displays. In this article, we will explore the various aspects of the PostScript language, including its syntax, data types, operators, and control structures.1. Syntax:The syntax of PostScript is based on the Reverse Polish Notation (RPN), where operators appear after their operands. For example, to add two numbers, the syntax is: "2 3 add". Multiple operands can be written in a space-separated manner.2. Data Types:PostScript supports various data types, including numbers, strings, booleans, arrays, dictionaries, and procedures. Numbers can be either integers or real numbers. Strings are enclosed within parentheses, and characters within are represented by their ASCIIvalues. Booleans can be either true or false.3. Operators:PostScript provides a wide range of operators to manipulate data. Arithmetic operators (addition, subtraction, multiplication, division) work with numbers. Logical operators (and, or, not) work with booleans. String operators (concatenation, length, substring) work with strings. Stack manipulation operators (dup, exch, pop) manipulate the operand stack.4. Control Structures:PostScript allows the use of control structures to control program flow. The if-else construct allows condition-based execution of code blocks. The for loop provides a way to iterate over a range of values. The while loop repeatedly executes a block of code as long as a specified condition is true. The repeat loop executes a block of code a specified number of times.5. Graphics Operations:PostScript excels in describing graphics for output devices. It provides a wide range of drawing operators to create lines, shapes, and curves. The moveto operator sets the current point, and thelineto operator draws a line from the current point to a specified coordinate. Fill and stroke operators control the filling and stroke style of graphics objects.6. Procedures:Procedures are blocks of code that can be defined and executed later. They are created using the { } syntax. Procedures can take arguments and return values. Using procedures helps organize and modularize code, making it easier to read and maintain.7. Built-in Functions:PostScript provides a set of built-in functions that perform specific tasks. These functions help with mathematical calculations, string manipulation, file operations, and more. Examples include sin, cos, sqrt, readline, and file.8. PostScript and Printers:One of the primary uses of PostScript is in printers, especially laser printers. PostScript files can be sent directly to printers, which interpret and render the page description commands to produce high-quality printed output. PostScript's scalability anddevice-independence make it a standard in the printing industry.Conclusion:PostScript is a powerful and versatile programming language used for printing, typesetting, and graphics. Its unique syntax and data types, along with a wide range of operators and control structures, make it an ideal language for describing complex documents and graphics. Whether you are a printer manufacturer, a graphic designer, or a programmer working with printers, a good understanding of PostScript can be valuable for optimizing print output and troubleshooting issues.。

软件测试部分中英文对照

软件测试部分中英文对照

软件测试部分中英文对照A Acceptance test ing:验收测试Acceptance Testing:可接受性测试Accessibi l i t y test:软体适用性测试actual outcome:实际结果Ad hoc test ing:随机测试Algorithm analysis:算法分析algori thm:算法Alpha test ing:α测试analysis:分析anomaly:异常applicat ion software:应用软件Applicat ion under test(AUT) :所测试的应用程序Architecture:构架Arti fact:工件AS Q:自动化软件质量(Automated Software Quality)Assertion checking :断言检查Associat ion:关联Audit:审计audit trai l:审计跟踪Automated Testing:自动化测试软件测试部分中英文对照BBackus-Naur Form:BNF范式baseline:基线Basic Block:基本块basis test set:基本测试集Behaviour:行为Bench test:基准测试benchmark:标杆/指标/基准Best practise:最佳实践Beta test ing:β测试Black Box Testing:黑盒测试Blocking bug :阻碍性错误Bottom-up test ing:自底向上测试boundary value coverage:边界值覆盖boundary value test ing:边界值测试Boundary values :边界值Boundry Value Analysis:边界值分析branch condit ion combination coverage:分支条件组合覆盖 branch condit ion combination test ing:分支条件组合测试 branch condit ion coverage:分支条件覆盖branch condit ion test ing:分支条件测试branch condit ion:分支条件Branch coverage :分支覆盖branch outcome:分支结果branch point:分支点branch test ing:分支测试branch:分支Breadth Testing:广度测试Brute force test ing:强力测试Buddy test:合伙测试Buffer:缓冲Bug:错误Bug bash :错误大扫除bug f ix:错误修正Bug report:错误报告Bug tracking system: 错误跟踪系统bug:缺陷Build:工作版本(内部小版本)Build Verficat ion tests(BVTs):版本验证测试Build-in:内置软件测试部分中英文对照CCapabil i ty Maturity Model (CM M): 能力成熟度模型Capabil i ty Maturity Model Integrat ion(CM MI):能力成熟度模型整合capture/playback tool:捕获/回放工具Capture/Replay Tool:捕获/回放工具CAS E:计算机辅助软件工程(computer aided software engineering)CAST:计算机辅助测试cause-effect graph:因果图cert i f i cat ion:证明change control:变更控制Change Manage ment :变更管理Change Request :变更请求Character Set :字符集Check In:检入Check Out :检出Closeout :收尾code audit:代码审计Code coverage :代码覆盖Code Inspection:代码检视Code page :代码页Code rule:编码规范Code sytle:编码风格Code W alkthrough:代码走读code-based test ing:基于代码的测试coding standards:编程规范Co m m o n sense :常识Co mpatibi l i t y Testing:兼容性测试complete path test ing:完全路径测试 completeness:完整性complexity:复杂性Co mponent test ing:组件测试Co mponent:组件computation data use:计算数据使用computer system security:计算机系统安全性 Concurrency user :并发用户Condit ion coverage :条件覆盖condit ion outcome:条件结果condit ion:条件configurat ion control:配置控制Configurat ion i tem :配置项configurat ion manage ment:配置管理Configurat ion test ing:配置测试conformance cri ter ion: 一致性标准Conformance Testing: 一致性测试consistency : 一致性consistency checker: 一致性检查器Control f low graph :控制流程图control f low graph:控制流图control f low:控制流conversion test ing:转换测试Core team:核心小组correct ive maintenance:故障检修correctness :正确性coverage :覆盖率coverage i tem:覆盖项crash:崩溃cri t i ca l i t y analysis:关键性分析cri t i ca l i t y:关键性CR M(change request manage ment):变更需求管理Customer-focused mindset :客户为中心的理念体系Cyclomatic complexity:圈复杂度软件测试部分中英文对照D data corruption:数据污染data defini t ion C-use pair:数据定义C-use使用对 data defini t ion P-use coverage:数据定义P-use覆盖 data defini t ion P-use pair:数据定义P-use使用对 data defini t ion:数据定义data defini t ion-use coverage:数据定义使用覆盖 data defini t ion-use pair:数据定义使用对 data defini t ion-use test ing:数据定义使用测试 data dict ionary:数据字典Data Flow Analysis:数据流分析data f low analysis:数据流分析data f low coverage:数据流覆盖data f low diagram:数据流图data f low test ing:数据流测试data integri ty:数据完整性data use:数据使用data validat ion:数据确认dead code:死代码Debug:调试Debugging:调试Decision condit ion:判定条件Decision coverage :判定覆盖decision coverage:判定覆盖decision outcome:判定结果decision table:判定表decision:判定Defect:缺陷defect density:缺陷密度Defect Tracking :缺陷跟踪Deployment :部署Depth Testing:深度测试design for sustainabi l i t y:可延续性的设计 design of experiments:实验设计design-based test ing:基于设计的测试Desk checking :桌前检查desk checking:桌面检查Determine Usage Model :确定应用模型Determine Potential Risks :确定潜在风险 diagnostic:诊断DIF(decimation in frequency) :按频率抽取dirty test ing:肮脏测试disaster recovery:灾难恢复DIT (decimation in t ime):按时间抽取 documentation test ing:文档测试 domain test ing:域测试domain:域DTP DETAIL TEST PLAN详细确认测试计划Dyna mic analysis:动态分析dynamic analysis:动态分析Dyna mic Testing:动态测试软件测试部分中英文对照E embedded software:嵌入式软件emulator:仿真End-to-End test ing:端到端测试Enhanced Request :增强请求enti ty relat ionship diagram:实体关系图 Encryption Source Code Base: 加密算法源代码库 Entry cri ter ia:准入条件entry point:入口点Envisioning Phase:构想阶段Equivalence class :等价类Equivalence Class:等价类equivalence part i t ion coverage:等价划分覆盖Equivalence part i t ion test ing:等价划分测试equivalence part i t ion test ing:参考等价划分测试equivalence part i t ion test ing:等价划分测试Equivalence Parti t ion ing:等价划分Error:错误Error guessing :错误猜测error seeding:错误播种/错误插值error:错误Event-driven :事件驱动Exception handlers:异常处理器exception:异常/例外executable statement:可执行语句Exhaustive Testing:穷尽测试exit point:出口点expected outcome:期望结果Exploratory test ing:探索性测试软件测试部分中英文对照FFailure:失效Fault:故障fault:故障feasible path:可达路径feature test ing:特性测试Field test ing:现场测试FM E A:失效模型效果分析(Failure Modes and Effects Analysis)FM E C A:失效模型效果关键性分析(Fai lure Modes and Effects Crit ical i t y Analysis) Framework :框架FTA:故障树分析(Fault Tree Analysis)functional decomposit ion:功能分解Functional Specif icat ion:功能规格说明书Functional test ing:功能测试Functional Testing:功能测试软件测试部分中英文对照GG11N(Globalizat ion):全球化Gap analysis:差距分析Garbage characters:乱码字符glass box test ing:玻璃盒测试Glass-box test ing:白箱测试或白盒测试Glossary :术语表G UI(Graphical User Interface):图形用户界面软件测试部分中英文对照H-MHard-coding :硬编码Hotfix:热补丁IGKL M NI18N(Internat ional izat ion):国际化Identi fy Exploratory Tests –识别探索性测试IEEE:美国电子与电器工程师学会(Inst i tu te of Electr ical and Electronic Engineers)Incident事故Incremental test ing:渐增测试incremental test ing:渐增测试infeasible path:不可达路径input domain:输入域Inspection :审查inspection:检视instal labi l i t y test ing:可安装性测试Instal l i ng test ing:安装测试instrumentation:插装instrumenter:插装器Integrat ion:集成Integrat ion test ing:集成测试interface :接口interface analysis:接口分析interface test ing:接口测试interface:接口inval id inputs:无效输入isolat ion test ing:孤立测试Issue :问题Iterat ion:迭代Iterat ive development:迭代开发job control language:工作控制语言Job:工作Key concepts :关键概念Key Process Area :关键过程区域Keyword driven test ing:关键字驱动测试Kick-off meeting :动会议L10N(Localizat ion):本地化Lag t ime :延迟时间LCSAJ:线性代码顺序和跳转(Linear Code Sequence And Jump)LCSAJ coverage:LCSAJ覆盖LCSAJ test ing:LCSAJ测试Lead t ime :前置时间Load test ing:负载测试Load Testing:负载测试Localizabi l i t y test ing:本地化能力测试Localizat ion test ing:本地化测试logic analysis:逻辑分析logic-coverage test ing:逻辑覆盖测试Maintainabi l i t y:可维护性maintainabi l i t y test ing:可维护性测试Maintenance :维护Master project schedule :总体项目方案Measurement :度量Me m ory leak :内存泄漏Migration test ing:迁移测试Milestone :里程碑Mock up :模型,原型modified condit ion/decision coverage:修改条件/判定覆盖 modified condit ion/decision test ing:修改条件/判定测试 modular decomposit ion:参考模块分解Module test ing:模块测试Monkey test ing:跳跃式测试Monkey Testing:跳跃式测试mouse over:鼠标在对象之上mouse leave:鼠标离开对象MTB F:平均失效间隔实际(mean t ime between fai lures)MTP M AIN TEST PLAN主确认计划MTTF:平均失效时间 (mean t ime to fai lure)MTT R:平均修复时间(mean t ime to repair)multip le condit ion coverage:多条件覆盖mutation analysis:变体分析软件测试部分中英文对照N-RN/A(Not applicable):不适用的Negative Testing :逆向测试,反向测试,负面测试negative test ing:参考负面测试Negative Testing:逆向测试/反向测试/负面测试non-functional requirements test ing:非功能需求测试nominal load:额定负载N-switch coverage:N切换覆盖N-switch test ing:N切换测试N-transit ions:N转换off by one:缓冲溢出错误Off-the-shelf software :套装软件operational test ing:可操作性测试output domain:输出域paper audit:书面审计Pair Program ming:成对编程part i t ion test ing:分类测试Path coverage :路径覆盖path coverage:路径覆盖path sensit iz ing:路径敏感性path test ing:路径测试path:路径Peer review :同行评审Performance :性能Performance indicator:性能(绩效)指标Performance test ing:性能测试Pilot:试验Pilot test ing:引导测试Portabi l i t y:可移植性portabi l i t y test ing:可移植性测试Posit ive test ing:正向测试Postcondit ion:后置条件Precondit ion:前提条件precondit ion:预置条件predicate data use:谓词数据使用predicate:谓词Prior i ty:优先权program instrumenter:程序插装progressive test ing:递进测试Prototype :原型Pseudo code :伪代码pseudo-local izat ion test ing:伪本地化测试pseudo-random:伪随机Q C:质量控制(quali ty control)Quality assurance(QA):质量保证Quality Control(QC) :质量控制Race Condit ion:竞争状态Rational Unified Process(以下简称RU P):瑞理统一工艺Recovery test ing:恢复测试recovery test ing:恢复性测试Refactoring:重构regression analysis and test ing:回归分析和测试 Regression test ing:回归测试Release :发布Release note :版本说明release:发布Reliabi l i t y:可靠性rel iabi l i t y assessment:可靠性评价rel iabi l i t y:可靠性Requirements manage ment tool:需求管理工具Requirements-based test ing:基于需求的测试Return of Investment(R OI):投资回报率review:评审Risk assessment :风险评估risk:风险Robustness :强健性Root Cause Analysis(RCA):根本原因分析软件测试部分中英文对照S-Z safety cri t i ca l:严格的安全性safety:(生命)安全性Sanity test ing:健全测试Sanity Testing:理智测试Sche ma Repository:模式库Screen shot :抓屏、截图SDP:软件开发计划(software development plan)Security test ing:安全性测试security test ing:安全性测试security.:(信息)安全性serviceabil i t y test ing:可服务性测试Severity:严重性Shipment :发布simple subpath:简单子路径Simulation:模拟Simulator:模拟器SLA(Service level agreement):服务级别协议SLA:服务级别协议(service level agreement)S moke test ing:冒烟测试Software development plan(SDP):软件开发计划Software development process:软件开发过程software development process:软件开发过程 software diversi ty:软件多样性software element:软件元素software engineering environment:软件工程环境software engineering:软件工程Software l i fe cycle :软件生命周期source code:源代码source statement:源语句Specif icat ion:规格说明书specif ied input:指定的输入spiral model :螺旋模型SQ A P SOFT W A R E QU ALITY ASS U R E N C E PLAN软件质量保证计划SQL:结构化查询语句(structured query language)Staged Delivery:分布交付方法state diagram:状态图state transit ion test ing:状态转换测试 state transit ion:状态转换state:状态Statement coverage :语句覆盖statement test ing:语句测试statement:语句Static Analysis:静态分析Static Analyzer:静态分析器Static Testing:静态测试stat is t i ca l test ing:统计测试Stepwise ref inement :逐步优化storage test ing:存储测试Stress Testing :压力测试structural coverage:结构化覆盖structural test case design:结构化测试用例设计structural test ing:结构化测试structured basis test ing:结构化的基础测试structured design:结构化设计structured program ming:结构化编程structured walkthrough:结构化走读stub:桩sub-area:子域Su m m ary: 总结SVV P SOFT W A R E Vevif icat ion&Validat ion PLAN: 软件验证和确认计划symbolic evaluation:符号评价symbolic execution:参考符号执行symbolic execution:符号执行symbolic trace:符号轨迹Synchronizat ion:同步Syntax test ing:语法分析system analysis:系统分析System design :系统设计system integrat ion:系统集成System Testing :系统测试TC TEST CAS E测试用例TCS TEST CAS E SPE CIFICATIO N测试用例规格说明TDS TEST DESIG N SPE CIFICATION测试设计规格说明书technical requirements test ing:技术需求测试Test :测试test automation:测试自动化Test case :测试用例test case design technique:测试用例设计技术test case suite:测试用例套test comparator:测试比较器test completion cri ter ion:测试完成标准test coverage:测试覆盖Test design :测试设计Test driver:测试驱动test environment:测试环境test execution technique:测试执行技术test execution:测试执行test generator:测试生成器test harness:测试用具Test infrastructure:测试基础建设test log:测试日志test measurement technique:测试度量技术Test Metrics:测试度量test procedure:测试规程test records:测试记录test report:测试报告Test scenario:测试场景Test Script:测试脚本Test Specif icat ion:测试规格Test strategy :测试策略test suite:测试套Test target:测试目标Test ware :测试工具Testabil i t y:可测试性testabi l i t y:可测试性Testing bed :测试平台Testing coverage :测试覆盖Testing environment :测试环境Testing i tem :测试项Testing plan :测试计划Testing procedure :测试过程Thread test ing:线程测试t ime sharing:时间共享t ime-boxed :固定时间TIR test incident report测试事故报告ToolTip:控件提示或说明top-down test ing:自顶向下测试TPS TEST PE O C E S S SPE CIFICATIO N测试步骤规格说明Traceabil i t y:可跟踪性traceabil i t y analysis:跟踪性分析 traceabil i t y matrix:跟踪矩阵Trade-off:平衡transaction:事务/处理transaction volume:交易量transform analysis:事务分析trojan horse:特洛伊木马truth table:真值表TST TEST SU M M A R Y REP O R T测试总结报告Tune System:调试系统T W TEST W A R E:测试件Unit Testing :单元测试Usabil i ty Testing:可用性测试Usage scenario:使用场景User acceptance Test :用户验收测试User database :用户数据库User interface(UI):用户界面User profi le:用户信息User scenario:用户场景V&V(Verif icat ion&Validat ion):验证&确认validat ion:确认veri f icat ion:验证version :版本Virtual user :虚拟用户volume test ing:容量测试VSS(visual source safe) :VTP Verif icat ion TEST PLAN验证测试计划VTR Verif icat ion TEST REP O R T验证测试报告W alkthrough :走读W aterfal l model :瀑布模型W eb test ing:网站测试W hite box test ing:白盒测试W ork breakdown structure(WBS):任务分解结构。

相关主题
  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

For the master’s courses “European Political Economy” and “Environmental Assessment and Management”/ “Environmental Sciences” taught in English
Applicants, who are applying for one of the master’s courses taught in English and whose native language is not English, must demonstrate a sufficient level of English language proficiency. In these cases, the requirement of proof of German language proficiency will be waived. Proof of a sufficient level of English language proficiency may be shown by taking an internationally acknowledged examination: Cambridge Certificate in Advanced English; Test of English as a Foreign Language (TOEFL), scoring at least 550 points in the hand-written test, 215 in the computerised test, or at least 80 points in the internet-based test; at least 6.0 points from the International English Language Testing System (IELTS); UNIcert level III; proof of C1 language proficiency according to the CEF (Common European Framework); or a corresponding level in an equivalent test. Upon application for admission to a degree course, certification of this should not usually date back more than 3 years. Also equivalent to on one of the aforementioned tests is proof of at least 6 school years of English in secondary education or at least 5 points in English at “Abitur” level. Applicants, who have spent at least two years studying abroad in an English speaking country within the last two years before receipt of their application of admission, are exempt from the need to take one of these tests. Please also refer to additional information, which will be sent out with the application forms. For any other questions, feel free to contact Ms. Raatz, Building V, Room 26, Tel.: + 49 /651/201-2715 and Ms. Meyer, Building V, Room 27, Tel.: + 49/651/201-2814
German Language Examinations for courses in German
Applicants, who cannot attend a preparatory college or are not required to take the assessment test (“Feststellungsprüfung”) by a preparatory college (“Studienkollegien”) , must take the German Language Examination for University Entrance (DSH) prior to starting their studies. It usually takes place at the start of the lecture period; the applicant will be informed of the dates on the notification of admission. (Exemption from this is also possible under certain conditions) Trier University only offers languages courses at an advanced level for preparation of the DSH. This means that applicants must prove they have already completed an Intermediate level (“Mittelstufe”) of German language proficiency; otherwise the application will be rejected. Applicants who applied to immediately take the DSH, but did not pass, can then enrol in the language course provided their language proficiency can be shown to be of the required standard. Those who pass the DSH (with at least the level of DSH-2) may then begin their degree course. The DSH can be repeated once. Those who fail the DSH twice will not be accepted by Trier University.
In Germany, official certifications of copies may be issued by the following authorities: office of the mayor or chief magistrate, local government, civic authorities (town hall), Rectories – only when the rector carries out the certification personally-, county/district council, the police department/headquarters, the courts, notaries. Problems may arise with the certification of papers issued in other languages. In such cases, applicants should contact their embassy or consulate. Official certifications may not be issued by the following: charitable institutions, interpreters, health insurers, students’ union, banks, building societies etc. Schools, preparatory colleges (“Studienkollegien”) and universities may only certify their own certificates.
Other
Original Certificates
Official Certification
In countries other than Germany, the following offices are authorised to issue official certifications: diplomatic missions of the Federal Republic of Germany or the authorities in the respective country, which are authorised to issue certifications.

Notification of Admission/Rejection
A copy of a certified copy is not valid and will not be accepted. Intermediate replies cannot be given, neither in writing nor by telephone.
BRIEF INFORMATION FOR INTERNATIONAL APPLICANTS Application deadlines: for the winter semester for the summer semester 15 July 15 January
相关文档
最新文档