Formal Model of Joint Maintenance Intention

合集下载

知识产权英语词汇

abandonment of a patent 放弃专利权abandonment of a patent application 放弃专利申请abridgment [ə'brɪdʒmənt]文摘词根：bridg=short,表示"短,缩短"abstract 文摘(摘要)abuse of patent 滥用专利权action for infringement of patent 专利侵权诉讼action of a patent 专利诉讼address for service 文件送达地址affidavit [ˌæfəˈdeɪvɪt]宣誓书allowance [ə'laʊəns]准许amendment 修改[ə'men(d)m(ə)nt]annual fee 年费[ˈænjuəl fi:]annuity 年费[əˈnju:əti]anticipation 占先[ænˌtɪsɪˈpeɪʃn]appeal 上诉appellation of origin 原产地名称[ˌæpəˈleɪʃən ɔv ˈɔridʒin applicant for patent 专利申请人application date 申请日期application documents 申请案文件application fee 申请费application for patent 专利申请(案)application laying open for public inspection 公开供公众审查的申请application number 申请号application papers 申请案文件arbitration 仲裁[ˌɑ:bɪˈtreɪʃn]art 技术article of manufacture 制品assignee 受让人[ˌæsaɪ'ni:]assignment 转让[ə'saɪnmənt]assignor 转让人author of the invention 发明人author's certificate 发明人证书basic patent 基本专利Berne Convention 伯尔尼公约英[bə:n,bɛən]美[bɚn, bɛrn]Berne Union 伯尔尼联盟best mode 最佳方式bibliographic data 著录资料[ˌbibliəˈɡræfik ˈdeitə]参考文献资料，目录资料着录资料；著录资料；书目数据BIRPI 保护知识产权联合国国际局.board of appeals 申诉委员会breach of confidence 泄密Budapest Treaty on the International Recognition of the Deposit[dɪ'pɒzɪt]of Microorganisms ,maikrəu'ɔ:ɡənizəm]for the Purposes of Patent Procedure[prə'siːdʒə]国际承认用于专利程序的微生物保存布达佩斯条约burden of proof 举证责任case law 判例法caveat 预告['kævɪæt; 'keɪ-]certificate of addition 增补证书certificate of correction 更正证明书certificate of patent 专利证书certified copy 经认证的副本Chemical Abstracts 化学文摘citation 引证[saɪ'teɪʃ(ə)n]claim 权项classifier 分类员['klæsɪfaɪɚ]co-applicants 共同申请人co-inventors 共同发明人color coding 色码制commissioner 专利局长[kə'mɪʃ(ə)nə]Community Patent Convention 共同体专利公约complete application 完整的申请案complete description 完整的叙述complete specification 完整的说明书comptroller 专利局长[kəm'trəʊlə; kɒmp-]compulsory license 强制许可证['laɪsns]conception 概念conception date 概念日期confidential application 机密申请confidential information 保密情报conflict award 冲突裁定conflict procedure 冲突程序[prə'siːdʒəconflicting applications 冲突申请案continuation application 继续申请continuation-in-part application 部分继续申请案contractual license 契约性许可证contributory infringement 简介侵犯[kən'trɪbjʊt(ə)rɪ] convention application 公约申请convention country 公约国convention date 公约日期Convention Establishing the World Intellectual Property Organization 建立世界知识产权组织公约convention period 公约期限convention priority 公约优先权[praɪ'ɒrɪtɪ]copyright 版权correction slip 勘误表counter pleadings 反诉状counterclaim 反诉country code 国家代号cross license 交叉许可证data 资料data exchange agreement 资料交换协议data of application 申请日期date of grant 授予日期date of issue 颁发日期['ɪʃu:]date of patent 专利日期date of publication 公布日期dedication to the public 捐献于公众defendant 被告人defenses 辩护defensive publication 防卫性公告deferred examination 延迟审查dependent claim 从属权项dependent patent 从属专利Derwent Publications Ltd. 德温特出版有限公司design patent 外观设计专利development 发展disclaimer 放弃权项disclosure 公开division 分案divisional application 分案申请domination patent 支配专利drawing 附图duration of patent 专利有效期[djuˈreɪʃn]economic patent 经济专利effective filing date 实际申请日期employee’s invention 雇员发明EPO 欧洲专利局European Patent Office 欧洲专利局ESARIPO 英语非洲工业产权组织esripouEuropean Patent Convention 欧洲专利公约evidence 证据examination 审查examination countries 审查制国家examination for novelty 新颖性审查examiner 审查员examiner’s report 审查员报告exclusive license 独占性许可证exclusive right 专有权experimental use 实验性使用expired patent 期满专利[iks'paiəd]exploitation of a patent 实施专利[eksplɒɪ'teɪʃ(ə)n] exposition priority 展览优先权expropriation 征用[eks,prəʊprɪ'eɪʃən]extension of term of a patent 延长专利期限fee 费用[ɪk'stenʃ(ə)n; ek-]FICPI 国际工业产权律师联合会file copy 存档原件filing date 申请日期filing fee 申请费filing of an application 提出申请final action 终局决定书first-to-file principle 先申请原则first-to-invention principle 先发明原则force majeure 不可抗力[mæ'ʒɜ:foreign patent application 外国专利申请formal examination 形式审查gazette 公报[ɡə'zet]Geneva Treaty on the International Recording of Scientific Discoveries 关于科学发现国际注册日内瓦条约[dʒə'ni:və]grace period 宽限期grant of a patent 授予专利权holder of a patent 专利持有人ICIREPAT 专利局间情报检索国际合作巴黎联盟委员会Paris Union Committee for International Cooperation in Information Retrieval among Patent Offices 专利局间情报检索国际合作巴黎联盟委员会[rɪˈtri:vl]IFIA 国际发明人协会联合会International Federation of Inventor’s Association 国际发明人协会联合会IBB 国际专利研究所Institut International des Brevets 国际专利研究所imitation 仿造impeachment 控告improvement 改进improvement patent 改进专利independence of patents 专利独立indication of source 产地标记indirect infringement 间接侵犯industrial applicability 工业实用性industrial design 工业品外观设计industrial property 工业产权information in the public domain 公开情报infringement of a patent 侵犯专利权infringement of a trade mark 侵犯商标权INID 著录资料识别码ICIREPAT Numbers for the Identification of Data 著录资料识别码INPADOC 国际专利文献中心INSPEC 国际物理学和工程情报服务部insufficient disclosure 公开不允分intellectual property 知识产权interdependent patents 相互依存的专利interference procedure 抵触程序interlocutory injunction 中间禁止令interlocutory order 中间命令International Convention for the Protection of New Varieties of Plants 保护植物新品种国际公约International Patent Classification Agreement 国际专利分类协定International Preliminary Examining Authority 国际初审单位international protection 国际保护International Searching Authority 国际检索单位invalidation 无效invention 发明inventive step 独创性inventor 发明人inventor’s certificate 发明人证书IPC 国际专利分类International Patent Classification 国际专利分类issue of a patent 办法专利joint applicants 共同申请人joint invention 共同发明joint inventors 共同发明人joint patentees 共同专利权人journal 公报judgment 判决junior party 后申请方know-how 技术诀窍lapsed patent 已终止的专利lawsuit of a patent 专利诉讼legal person 法人legend 说明LES International 国际许可贸易执行人协会Licensing Executives Society International 国际许可贸易执行人协会letters patent 专利证书license 许可证license agreement 许可证协议license of course 当然许可证licensing 许可证贸易licensor 许可人Lisbon Agreement for the Protection of Appellations of Origin and their International Registration 保护原产地名称及国际注册里斯本协定Locarno Agreement Establishing an International Classification for Industrial Design 建立工业品外观设计国际分类洛迦诺协定loss of a patent 专利权的丧失Madrid Agreement Concerning the International Registration of Marks 商标国际注册马德里协定Madrid Agreement for the Repression of False or Deceptive Indications of Source on Goods 制止商品产地虚假或欺骗性标记马德里协定main patent 主专利maintenance fee 维持费marking 标记memorandum of understanding 谅解备忘录method 方法microforms 微缩文件minimum documentation 最少限度检索文献minimum royalties 最低提成费misuse of patent 滥用专利权mixed license 混合许可证model laws 示范法most-favoured provision 最惠条款name of invention 发明名称national treatment 国民待遇natural person 自然人neighboring rights 邻接权new varieties of plants 植物新品种Nice Agreement Concerning the International Classification of Goods and Services for the Purposes of the Registration of Marks 商标注册用商品与服务国际分类尼斯协定non-examining countries 不审查制国家non-exclusive license 非独占性许可non-obviousness 非显而易见性non-use of a patent 不实施专利notary public 公正机关notice of infringement 侵权通知novelty 新颖性OAPI 非洲知识产权组织objection 异议office action 专利局审查决定书opposition 异议originality 独创性owner of a patent 专利所有人parent application 原申请Paris Convention 巴黎公约Paris Union 巴黎联盟patent 专利patent act 专利法patent agent 专利代理人patent applied for 已申请专利patent attorney 专利律师patent classification 专利分类patent documentation 专利文献patent documents 专利文件patent families 同族专利patent for an invention 发明专利patent law 专利法patent license 专利许可证patent number 专利号patent of addition 增补专利patent of confirmation 确认专利patent of importation 输入专利patent of introduction 引进专利patent of revalidation 再效专利patent office 专利局patent pending 专利未决patent right 专利权patent rules 专利实施细则patent system 专利制度patentability 专利性patented invention 专利发明patentee 专利权人patenting 授予专利权PCT 专利合作条约PCT Union 专利合作条约pending application 未决申请period of a patent 专利有效期person skilled in the art 所属技术领域的专业人员petition 请求书petty patent 小专利plaintiff 原告人plant patent 植物专利pleadings 起诉状precautional patent 预告专利precedents 判例prescription 时效prevention of unfair competitionprincipal patent 主专利prior art 先有技术prior use 先用priority 优先权priority claim 优先权声明priority declaration 优先权声明process patent 方法专利processing of an application 申请案的处理product patent 产品专利provisional specification 临时说明书publication 公布reclassification 再分类reexamination 复审refusal 驳回register of patents 专利登记册registered patent 登记专利registered trade mark 注册商标registration 登记registration countries 登记制国家reissue patent 再颁发专利rejection 驳回remedy 补救renewal fee 续展费request 请求书restoration of a lapsed patent 恢复已终止的专利restricted conditions 限制条款review 复审revival of an abandoned application 恢复已放弃的申请revocation of a patent 撤销专利royalties 提成费Science Abstracts 科学文摘scientific discovery 科学发现scope of protection 保护范围seal 盖章search 检索secret patent 机密专利service invention 职务发明service mark 服务标记signature 签署simple license 普通许可证single applicant 单独申请人sliding scale of royalties 滑动提成费sole license 排他性许可证specification 说明书state of the art 先有技术水平statement of claim 诉讼陈述statement of defense 辩护陈述substance patent 物质专利substantive examination 实质性审查succession 继承sufficiency of description 充分描述technical assistance 技术协助technical data 技术资料technology transfer 技术转移temporary protection 临时保护term of a patent 专利有效期世贸组织WTO WORLD TRADE ORGANIZATION关税及贸易总协定《GATT》 GENERAL AGREEMENT ON TARIFFS ANDTRADE亚太经济合作组织《APEC》ASIA PACIFIC ECONOMIC COOPERATION与贸易有关的知识产权协议《TRIPS》 AGREEMENT ON TRADE RELATED ASPECTS OF INTELLECTUAL PROPERTY RIGHTS世界知识产权组织《WIPO》 WORLD INTELLECTUAL PROPERTY ORGANIZATION保护知识产权联合国际局INTERNATIONAL BOARD OF INTELLECTUALPROPERTY RIGHT保护工业产权巴黎公约PARIS CONVENTION FOR THE PROTECTION OF INDUSTRIAL PROPERTY商标国际注册马德里协定 MADRID AGREEMENT CONCERNING THE INTERNATIONAL REGISTRATION OF MARKS商标注册条约《TRT》 TRADE MARK REGISTRATION TREATY商标注册用商品与国际分类尼斯协定NICE AGREEMENT CONCERNING THE INTERNATIONAL CLASSIFICATION OF GOODS AND SERVICES FOR THEPURPOSE OF THE REGISTRATION OF MARKS建立商标图形要素国际分类维也纳协定VIENNA AGREEMENT FOR ESTABLISHING AND INTERNATIONAL CLASSIFICATION OF THE FIGURATIVE ELEMENTS OF MARKS专利合作条约《PCT》 PATENT CO－OPERATION TREATY共同体专利公约 COMMUNITY PATENT CONVENTION斯特拉斯堡协定《SA》 STRASBOURG AGREEMENT工业外观设计国际保存海牙协定THE HAGUE AGREEMENT CONCERNING THE INTERNATIONAL DEPOSIT OF INDUSTRIAL DESIGNS工业外观设计国际分类洛迦诺协定LOCARNO AGREEMENT ON ESTABLISHING AND INTERNATIONAL CLASSIFICATION FOR INDUSTRIAL DESIGNS商标，外观设计与地理标记法律常设委员会（SCT） STANDINGCOMMITTEE ON THE LAW OF TRADEMARK， INDUSTRIAL DESIGN AND GEOGRAPHICALINDICATION国际专利文献中心《INPADOC》INTERNATIONAL PATENT DOCUMENTATION CENTER欧洲专利局《EPO》 EUROPEAN PATENT OFFICE欧洲专利公约 EUROPEAN PATENT CONVENTION比荷卢商标局 TRADE MARK OFFICE OF BELGIUM－HOLLAND－LUXEMBURG法语非洲知识产权组织ORGANIZATION OF AFRICAN INTELLECTUAL PROPERTY国际商标协会 THE INTERNATIONAL TRADEMARK ASSOCIATION中华人民共和国商标法TRADEMARK LAW OF THE PEOPLES REPUBLIC OF CHINA英国商标法TRADEMARK LAW OF UNITED KINGDOM OF GREAT BRITAIN AND NORTHERN IRELAND美国商标法TRADEMARK LAW OF THE UNITED STATES OF AMERICA日本商标法 JAPANESE TRADEMARK LAW商标 TRADE MARK商标局 TRADE MARK OFFICCE商标法 TRADE MARK LAW文字商标 WORD MARK图形商标 FIGURATIVE MARK组合商标 ASSOCIATED MARK保证商标 CERTIFICATION MARK集体商标 COLLECTIVE MARK驰名商标 WELL－KNOWN MARK著名商标 FAMOUS MARK近似商标 SIMILAR MARK防御商标 DEFENSIVE MARK服务标记 SERVICE MARK注册商标 REGISTERED MARK商标注册申请人 TRADE MARK REGISTRANT注册申请日 APPLICATION DATE OF TRADE MARK注册申请号 APPLICATION NUMBER商标注册证 TRADE MARK REGISTRATION CERTIFICATE商标注册号 TRADE MARK REGISTRATION NUMBER商标注册日 TRADE MARK REGISTRATION DATE 商标注册簿 TRADE MARK REGISTERED BOOK注册有效期 THE TERM OF VALIDITY商标注册官 EXAMINATION FOR TRADE MARK REGISTRATION注册查询 TRADE MARK ENQUIRIES注册续展 RENEWAL OF TRADE MARK分别申请 SEPARATE APPLICATION重新申请 NEW REGISTRATION别行申请 NEW APPLICATION变更申请 APPLICATION REGARDING CHANGES注册代理 TRADE MARK AGENCY注册公告 TRADE MARK PUBLICATION申请注册 APPLICATION FOR REGISTRATION续展注册 RENEWAL OF REGISTRATION转让注册 REGISTRATION OF ASSIGNMENT变更注册人名义／地址／其它注册事项 MODIFICATION OF NAME ／ADDRESS OF REGISTRANT／OTHER MATTERS补发商标证书 REISSUANCE OF REGISTRATION CERTIFICATE注销注册商标 REMOVAL证明 CERTIFICATION异议 OPPOSITION使用许可合同备案 RECORDAL OF LICENSE CONTRACT驳回商标复审 REVIEW OF REFUSED TRADEMARK驳回续展复审 REVIEW OF REFUSED RENEWAL驳回转让复审 REVIEW OF REFUSED ASSIGNMENT撤销商标复审 REVIEW OF ADJUDICATION ON OPPOSITION异议复审 REVIEW OF ADJUDICATION ON OPPOSITION争议裁定 ADJUDICATION ON DISPUTED REGISTERED TRADEMARK 撤销注册不当裁定ADJUDICATION ON CANCELLATION OF IMPROPERLY REGISTERED TRADEMARK撤销注册不当复审 REVIEW ON CANCELLATION OF IMPROPERLY REGISTERED TRADEMARK处理商标纠纷案件 DEALING WITH INFRINGEMENT优先权 PRIORITY注册申请优先日 DATE OF PRIORITY注册商标使用人 USER OF REGISTERED TRADE MARK注册商标专用权EXCLUSIVE RIGHT TO USE REGISTERED TRADE MARK注册商标的转让 ASSIGNMENT OF REGISTERED TRADE MARK商标的许可使用 LICENSING OF REGISTERED TRADE MARK使用在先原则 PRINCIPLE OF FIRST TO USE注册在先原则 PRINCIPLE OF FIRST APPLICATION商标国际分类 INTERNATIONAL CLASSIFICATION OF GOODS专利 PATENT 专利权 PATENT RIGHT 专利权人 PATENTEE专利代理 PATENT AGENCY 产品专利 PRODUCT PATENT专利性 PATENTABILITY专利申请权 RIGHT TO APPLY FOR A PATENT实用新颖 UTILITY MODEL 专有性 MONOPOLY专利的新颖性 NOVELTY OF PATENT专利的实用性 PRACTICAL APPLICABILITY专利的创造性 INVENTIVE专利文件 PATENT DOCUMENT专利申请文件 PATENT APPLICATION DOCUMENT专利请求书 PATENT REQUEST专利说明书 PATENT SPECIFICATION专利要求书 PATENT CLAIM专利证书 LETTER OF PATENT商标淡化法 TRADEMARK DILUTION ACT商标权的权利穷竭 EXHAUSTION TRADEMARK平行进口 PARALLEL IMPORT灰色进口 GRAY IMPORT反向假冒 REVERSE PASSING－OFF显行反向假冒 EXPRESS REVERSE PASSING－OFF隐形反向假冒 IMPLIED REVERSE PASSING－OFF附带使用 COLLATERAL USE知识产权 INTELLECTUAL PROPERTY工业产权 INDUSTRIAL PROPERTY外观设计 DESIGN发明 INVENTION发明人 INVENTOR货源标记 INDICATION OF SOURCE原产地名称 APPELLATION OF ORIGIN （AOS）地理标记 GEOGRAPHICAL INDICATION （GI）1.A patent is a governmental grant of an exclusive monopoly as an incentive and a reward for a new invention.专利权是政府对一项新发明授予的独立性权利，以给予发明鼓励和奖励。

汽车差速器

author. Email: Geoﬀrey.Virlez@ulg.ac.be.
˙ and q ¨ are the generalized displacements, vewhere q , q locities and acceleration coordinates, M (q ) is the mass ˙ , t) = g gyr (q , q ˙ ) + g int (q , q ˙ ) − g ext (t), with matrix, g (q , q gyr g the vector of the complementary inertia forces, ˙ ) the vector of the internal forces, e.g., elasg int (q , q tic and dissipations forces, and g ext (t) the vector of the external forces. According to the augmented Lagrangian method, the constraint forces are formulated by ΦT q (pΦ + k λ), where λ is the vector of Lagrange multipliers related to the algebraic bilateral constraints (Φ = 0); k and p are respectively a scaling and a penalty factor to improve the numerical conditioning. Equations (1) and (2) form a system of nonlinear diﬀerential-algebraic equations. The solution is evaluated step by step using a second order accurate time

An empirical examination of CobiT as an internal control framework for information technology

An empirical examination of CobiT as an internal controlframework for information technologyBrad Tuttle ⁎,Scott D.Vandervelde 1University of South Carolina,Moore School of Business,1705College Street,Columbia,SC 29208,USAReceived 26September 2006;received in revised form 25September 2007;accepted 30September 2007AbstractOne commonly used framework for developing and evaluating technology intensive information systems is CobiT.This framework was originally a benchmark of best control practices developed and maintained by the Information Technology Governance Institute,the umbrella organization to the Information Systems Audit and Control Association.We empirically examine the conceptual model that underlies the CobiT internal control framework as it applies to an audit setting (including operational,compliance,and financial audit settings).We find that superimposing CobiT's conceptual model onto audit relevant assessments made by a panel of highly experienced IT auditors confirms the internal consistency between the underlying constructs of CobiT.Furthermore,we find that CobiT's conceptual model predicts auditor behavior in the field related to their seeking help and giving help as evidenced by their postings to a general IT audit listserv.Given the results of this study,we propose future research aimed at developing a general theory of internal control applicable to information technology based on CobiT.©2007Elsevier Inc.All rights reserved.Keywords:Internal controls;IT controls;Internal control frameworks;CobiT1.IntroductionOrganizations and their auditors use frameworks to guide their design and evaluation of internal controls.This use of internal control frameworks has dramatically increased in importance since the passage of the Sarbanes –Oxley Act of 2002and since the release of the Public Company Accounting Oversight Board's (PCAOB)Auditing Standard No.2(AS2)in 2004.Presumably,the International Journal of Accounting Information Systems8(2007)240–263⁎Corresponding author.Tel.:+18037776639;fax:+18037770712.E-mail addresses:tuttle@ (B.Tuttle),vandervelde@ (S.D.Vandervelde).1Tel.:+18037776075;fax:+18037770712.1467-0895/$-see front matter ©2007Elsevier Inc.All rights reserved.doi:10.1016/j.accinf.2007.09.001use of a framework to guide the assessment of internal controls results in more comprehensive,reliable,and complete assessments.To achieve these goals in today's information technology (IT)intensive environment,a control framework must conceptualize the important aspects of internal control within an IT context in a complete and logically consistent manner.In the absence of a comprehensive and conceptually sound framework,the complexity of modern systems can overwhelm an auditor.This suggests that the quality of the internal control audit assessment depends on the conceptual model upon which a framework rests.This paper looks at Control Objectives for Information Related Technology (CobiT)by examining its conceptual consistency in an audit setting.Within IT intensive environments,CobiT is a widely recognized control framework that is emerging as the supplemental framework of choice to the Treadway Commission's Committee of Sponsoring Organizations (COSO)eval-uation framework (IT Governance Institute,2005;see also Colbert and Bowen,1996;Netegrity,2004;Ramos,2004).Fedorowicz and Gelinas (1998)state that CobiT complements the COSO framework for assessing the internal controls and overall corporate governance of an organization.Likewise,Lainhart (2001,19–20)states that CobiT is a tool that “helps enterprises balance IT risk and investment in controls.”These sentiments are echoed by Dennis Reynolds,KPMG partner and head of the Financial Services Risk Governance in London (KPMG,200313),The Committee of Sponsoring Organizations of the Treadway Committee (COSO)evaluation framework is recommended by the Commission as an appropriate basis for management's assessments.Most international organizations are adopting the COSO framework for their evaluation,but are supplementing its control criteria with those recommended by the Control Objectives for Information and related Technology (CobiT) (2)CobiT was originally intended for use by an organization's management as a benchmarking tool consisting of the best practices related to IT controls.Since then and because of its strong control focus,both internal and external auditors have applied CobiT to financial statement audits as well as to operational and compliance audits.In regards to financial statement audits,AS2mandates that management use a control framework in order to assess the effectiveness of internal controls over financial reporting.The use of the term “framework ”in this paper is in the same vein as used in AS2.While CobiT is apparently useful for financial statement audit purposes,this study takes a broader view to include internal controls related to operational and compliance audits.Despite the importance of using a sound conceptual model,no practitioner developed internal control framework,that we are aware of,has undergone rigorous academic examination in the same manner that researchers routinely examine the conceptual models developed by other academics.The objective of the present study is to examine the internal consistency of CobiT's conceptual model within an audit setting by investigating whether auditor perceptions of audit risk related to complexity,client importance,client attention,and process risk combine to represent IT process risk in the manner asserted by CobiT.(See Appendix A for definitions and Section 3.1for a discussion of these measures of risk.)The present study provides further 2Perhaps one measure that CobiT is generally regarded as an appropriate supplement to COSO is found in the following entry to the Wikipedia dictionary (/wiki/Sarbanes-Oxley_Act ):“The PCAOB suggests considering the COSO framework in management/auditor assessment of controls.Auditors have also looked to the IT Governance Institute's “CobiT":Control Objectives of Information and Related Technology for more appropriate standards of measure.This framework focuses on IT processes while keeping in mind the big picture of COSO's control activities and information and communication.”The authors did not submit this entry to the dictionary just so we could include it in our paper.241B.Tuttle,S.D.Vandervelde /International Journal of Accounting Information Systems 8(2007)240–263242 B.Tuttle,S.D.Vandervelde/International Journal of Accounting Information Systems8(2007)240–263 collaborating evidence as to whether the extent to which auditors seek and give IT audit assistance reflects the conceptual model underlying the CobiT framework.An examination of the consistency of CobiT's conceptual model is important for three reasons. First,users of CobiT as a framework in order to maintain effective IT control would benefit from knowing if the underlying conceptual model holds together under scrutiny.In this manner, internal audit functions can use CobiT with increased confidence as a framework for any type of IT audit they perform,whether it is an operational audit,compliance audit,or financial audit. Second,based on discussions with practicing auditors,the major public accounting firms use either CobiT,or something very similar,when working on clients with significant IT controls. Policy-makers would benefit from evidence that either supports or calls into question the conceptual foundations of current audit practice.Having this data would greatly aid policy-makers who must set auditing standards related to internal controls for publicly traded companies. Third,it is possible that examining CobiT's conceptual model is a first step toward the devel-opment of a more general theory of internal control.Although no academic theory of internal control exists,the profession is essentially proposing CobiT as a process oriented theory of internal control based on IT processes,IT domains,information criteria and the IT resources employed to generate information.Further development of a formal theory of internal control, especially as it relates to IT,should lead to more effective compliance and operational audits.This study uses audit related assessments of CobiT constructs provided by a panel of experts together with postings from the Information Systems Audit and Control Association's(ISACA) general listserv to provide empirical support for CobiT as an IT internal control framework to support the audit function(including operational,compliance,and financial audits).First,a panel of12highly experienced IT auditors evaluated key aspects of CobiT's conceptual model using the following measures of audit risk with regards to IT:complexity,client importance,client attention,and process risk.Analysis shows that responses from the expert panel combine in a manner that is generally consistent with CobiT's underlying conceptual model.We discuss departures in our findings from the CobiT model in the final section of the paper.Second,the12 IT auditors along with17non-IT auditors evaluated each of the CobiT processes based on the level of risk to a typical organization.These ratings correlate with data obtained from the ISACA listserv.The analysis suggests that the conceptual model upon which the CobiT framework is based is associated with(1)the number of threads or topics discussed on the ISACA listserv,and (2)the total number of messages posted.To further support the CobiT conceptual model,all relevant listserv messages were successfully coded to specific CobiT control objectives based on their content.That is,CobiT appears to be sufficiently comprehensive to encompass the audit specific questions posted in our sample from the listserv.The remainder of the paper proceeds as follows.Section2provides the background,theoretical framework,and research propositions.Section3provides the first phase of the CobiT validation based on experienced auditors.Section4provides the second phase of the CobiT validation using archival information.Finally,Section5provides a discussion of our results.2.Background and theoryThe well-established COSO framework relies on the idea that the achievement of the following objectives is important for strong internal controls:effectiveness and efficiency of operations, reliability of financial reporting,and compliance with applicable laws and regulations(COSO, 2004).Its underlying conceptual model suggests that internal control objectives are achieved by paying attention to five components of control:(1)the control environment,(2)risk assessment,(3)control activities,(4)information and communication,and (5)monitoring.By conceptualizing internal controls in this manner,control frameworks are meant to accomplish three objectives:(1)ensure completeness in coverage,(2)aid in identifying high risk areas,and (3)help to accurately assess the impact of controls (COSO,1992).As a practical matter,however,COSO is a highly abstract conceptual framework and does not identify control objectives at a level of specificity sufficient to design detailed audit tests.Furthermore,the general nature of COSO does not address the complexity and special risks inherent in IT (Colbert and Bowen,1996).Given the reliance on technology within most organizations,organizations need a framework to address technology to be functional in today's audit environment.Furthermore,because COSO expresses its components at a very high level of abstraction,it may not be possible to design an empirical test of its internal conceptual consistency.For these reasons,organizations and auditors in computerized environments are adopting specialized frameworks,such as CobiT,to supplement COSO.Every major international accounting firm has adopted CobiT or at a minimum its major constructs in connection with their review of internal control.This trend extends beyond the U.S.as evidenced by the European Union's recent adoption of CobiT as an Auditing Standard (Summerfield,2005).Unlike COSO's five components,which are structured by semantic category,the CobiT framework relies on a process model that is organized around a system life cycle approach containing four primary domains (see Fig.1).These domains are labeled:Plan and Organise;Acquire and Implement;Deliver and Support;and Monitor and Evaluate.Within each domain there are specific processes that an organization should address to achieve detailed and specific IT related control objectives.For instance,within the Deliver and Support domain is the process,“DS4Ensure Continuous Service.”This process is associated with 10detailed control objectives (not listed in the figure)that IT best practices suggest should be met in order to achieve a high level of control.An example control objective from this process is objective DS4.6,“IT Continuity Plan Training ”which states,“Ensure that all concerned parties receive regular training sessions regarding the procedures and their roles and responsibilities in case of an incident or disaster.Verify and enhance training according to the results of the contingency tests ”(IT Governance Institute,2005,116).These detailed control objectives are further supplemented by audit guidelines for each CobiT process.It is important to note that the control objectives in CobiT are specific enough to be easily implementable;yet general enough to be applicable to various types of audits (e.g.,operational,compliance,and financial).CobiT's underlying conceptual model asserts that to satisfy business requirements,information must meet seven criteria:(1)Effectiveness,(2)Efficiency,(3)Confidentiality,(4)Integrity,(5)Availability,(6)Compliance,(7)and Reliability (Appendix B provides detailed descriptions for each criterion as presented in CobiT 4.0).The conceptual model relates each CobiT process to the information criteria that the process affects,and therefore,should provide an auditor with a means of directly assessing specific controls for their effect on the quality of information,whether the audit is operational,compliance,or financial in nature (see Fig.1).Furthermore,there are clear linkages between the CobiT information criteria and COSO's objectives related to effectiveness and efficiency of operations,compliance with laws and regulations,and reliability of information.3Achieving the CobiT information criteria,therefore,has important implications for financial statement assertions as well as broader implications for the efficiency and effectiveness of operations.3See CobiT 4.0Appendix II,“Mapping IT Processes To IT Governance Focus Areas,COSO,CobiT IT Resources And CobiT Information Criteria ”(IT Governance Institute 2005).243B.Tuttle,S.D.Vandervelde /International Journal of Accounting Information Systems 8(2007)240–263Fig.1.CobiT Version 4.0conceptual model.244 B.Tuttle,S.D.Vandervelde /International Journal of Accounting Information Systems 8(2007)240–263For each CobiT process,the IT resources (i.e.,assets)that the process affects are also identified.These resources consist of (1)People,(2)Information or data,(3)Applications,and(4)Infrastructure.4Melville et al.(2004)provide a related business valuation model based on existing research that shows the important components of a good IT structure.The primary components of Melville et al.'s model consist of physical capital,human capital,and organizational capital.We note that each component of Melville et al.'s model maps directly into at least one of the IT resources within the CobiT framework.CobiT expands this model by adding Information as a critical IT resource.As is identified by Melville et al.(2004),research has shown that strong IT improves organizational performance.Given the importance of IT to organizational performance and the direct link between the primary components of the business value model and the IT resources of CobiT,one can expect risk assessments for a particular process to correlate with the IT resources it affects.For example,if CobiT's conceptual model is internally consistent and the IT resource,people ,is considered a relatively high risk factor,then the assessed risk of not satisfying a particular CobiT process that is closely associated with the people resource should reflect this heightened risk.Likewise,a test of internal consistency within an audit context involves examining whether risk assessments for the various CobiT processes correlate with those information criteria which the conceptual model purports the process to affect.That is,suppose the information criterion of integrity is more complex,difficult to audit,or otherwise risky in comparison to the other information criteria.In this case,the risk of not satisfying a CobiT process associated with the integrity criterion should reflect its underlying complexity,etc.These arguments suggest that if CobiT is internally consistent,then the information criteria and IT resource constructs should exhibit construct validity.This leads to our first proposition:Proposition 1.Risk assessments for CobiT processes will be correlated with the underlying audit related characteristics for the information criteria and IT resources CobiT purports that the process affects.An additional proposition is set forth in relation to the propensity of auditors to seek additional information and assistance via postings to the Information Systems Audit and Control Association (ISACA)IT audit listserv.5This particular listserv consists of audit related questions posed by IT auditors to other IT auditors and is distinct from a separate listserv maintained by ISACA that addresses specific CobiT issues.6Hence,message threads on the listserv provide an unobtrusive measure of the need to obtain assistance and information on specific topics within a broad IT audit setting.Furthermore,the total number of postings (i.e.,questions and responses)provides a measure of what it takes to provide a satisfactory answer.The number of postings related to a specific topic is a proxy for the complexity or the importance of the topic to auditors.The more complex the issue,the less likely that one response to a posted question will be sufficient to provide a complete solution,and will therefore lead to more posted responses and follow-up questions.The more important the topic,the more likely multiple people will respond to the posted message with a response.Therefore,a strong test of the internal consistency of CobiT's underlying conceptual model is to examine its association with the frequency with which auditors seek assistance via the listserv.4CobiT 3.0identified five IT resources.CobiT 4.0,which was released in November of 2005,combined the Technology and Facilities IT resources into Infrastructure,thus reducing to four IT resources.5See .6ISACA maintains several specialized ing the general audit listserv provides a stronger test of CobiT's applicability to an audit setting than using the listserv dedicated solely to CobiT issues.245B.Tuttle,S.D.Vandervelde /International Journal of Accounting Information Systems 8(2007)240–263246 B.Tuttle,S.D.Vandervelde/International Journal of Accounting Information Systems8(2007)240–263 Data from the listserv provides a stronger test of the CobiT model's internal consistency than would data about purposeful auditor behavior,such as data about audit plans and tests.This is because auditors might adopt and use an internally inconsistent conceptual model based on their training and culture without being aware of the model's shortcomings.Seeking and giving help,on the other hand,is a spontaneous behavior that is likely to reflect audit needs associated with the risk associated with the particular issue.For instance,if CobiT constitutes an internally consistent conceptual model in an audit setting,one expects ITauditors to serendipitously seek help with CobiT processes when the information criteria associated with that process embody important audit characteristics related to various aspects of risk,such as its complexity,importance.That is,a process,which is complex,and that impacts information criteria should create a greater need for audit assistance.It should elicit,therefore,greater assistance from other auditors.This logic suggests that the help auditors seek in relation to a CobiT process will be influenced by the information criteria related to that process.The same expectation exists in regards to IT resources.This leads to our second proposition:Proposition2.CobiT's conceptual model(i.e.,processes,information criteria,and IT resources) predicts the extent to which an auditor will seek and give assistance related to an IT audit topic.Proposition2is a strong test of the theoretical consistency of CobiT's conceptual model because in order to support its premise the CobiT processes must be valid categories of IT activities within an audit context.7Otherwise,if CobiT processes are not audit relevant then no association between CobiT and the need for information and assistance in an audit context(i.e., listserv postings)will result.Furthermore,CobiT's assertions regarding which information criteria and which IT resources are affected by each process are subject to the same logic.If CobiT does not extend to an audit context then no association will result between the amount of information an auditor seeks and the need for information related to the listserv topic as implied by the information criteria and IT resources asserted by the CobiT framework.In addition to the information criteria and IT resource taxonomy,beginning with Version4.0, CobiT identifies the importance level it places on each CobiT process as shown in Fig.1.If the CobiT framework is applicable to an audit setting,then the importance level(i.e.,H=high, M=medium,or L=low)should be useful in audit planning and should correlate with the propensity of auditors to seek and give advice on the listserv.We,therefore,present our third and final proposition:Proposition3.There is a positive association between the perceived importance level of an IT audit topic and the extent to which auditors seek assistance related to that particular ITaudit topic.3.Test of CobiT using responses from experienced auditors3.1.IT and non-IT auditor assessmentsAs a first step to test our propositions regarding CobiT's conceptual model,audit relevant assessments of CobiT constructs were obtained from an expert panel consisting of12highly experienced IT auditors and17non-IT auditors.8The IT auditors have a mean full-time work 7Regardless of the results of this study,CobiT may still be a valid framework for IT related purposes other than as an internal control framework in an audit setting.8Of the17non-IT auditors one did not complete the demographic questions of the questionnaire,so the information for only16is reported here.experience of approximately 11.9years,whereas the non-IT auditors have a mean work experience of approximately 2.1years.Seven IT auditors held four-year college degrees and six held graduate degrees.Sixteen non-IT auditors held graduate degrees.Eight of the IT auditors work for a “professional assurance/consulting firm,”while four work in “insurance,real estate,finance,banking,and accounting.”Fifteen of the non-IT auditors work for a “professional assurance/consulting firm,”while one works in “insurance,real estate,finance,banking and accounting.”The professional designations possessed by our IT auditors include three CPAs,eight CISAs,three CIAs,one CCNA,one CFE,one CFSA,and one CISSP.Two panel members did not indicate a professional designation.The non-IT auditors include eight CPAs.The mean self-assessed knowledge of the IT concepts in the questionnaire for the IT auditor and non-IT auditor groups respectively is 6.6and 6.0on a nine-point scale with one being “low knowledge of the concepts ”and nine being “high knowledge of the concepts.”The mean self-assessed familiarity with CobiT is 7.0and 4.6on a nine-point scale with one being “very unfamiliar with CobiT ”and nine being “very familiar with CobiT,”for the IT auditor and non-IT auditor groups,respectively.The non-IT auditors responded (mean =3.1)to the question,“Please indicate the extent to which you personally apply CobiT in your day-to-day work activities ”on a nine-point scale with one being “Very infrequently ”to nine being “Very frequently.”These results suggest that the IT auditors have significant familiarity with CobiT and that even the non-IT auditors have some familiarity.The 12highly experienced IT auditors performed three tasks in which they evaluated the following:(1)each of the information criteria,(2)each of the IT resources,and (3)assessed the risk associated with each of the 34CobiT processes.9The evaluation tasks took approximately 40min to complete.The 17non-IT auditors assessed only the risk associated with each of the 34CobiT processes (i.e.,task 3).The evaluation of each of the information criteria and each of the IT resources was based on providing evaluations for four measures of audit risk:complexity,client importance,client attention,and process risk.10Consistent with the desirability of obtaining multiple measures of a single construct,each of these evaluations is expected to capture slightly different aspects of audit risk in an IT setting so that when combined,a better overall measure of IT audit risk emerges.Our expectation is that an auditor will seek more information about a CobiT process associated with an information criterion or IT resource that is complex,important,requires more attention or high risk.The motivation for each measure appears below.plexityComplexity in a process or transaction increases the risk of material misstatement,and therefore,increases audit risk.As an example,in reference to revenue recognition,in Messier,Glover,and Prawitt's 5th edition auditing textbook they state “recognition of revenue may involve complex calculations ….In such circumstances,the auditor should assess the risk of material misstatement to be high ”(2008,p.386).As pointed out by Ridley et al.(2004,p.7)the more complex the IT governance of an organization,“it is likely that there will be more interest in IT control from these organizations ”(Ridley et al.,2004,p.7).“The challenges include 9At the time of the expert panel participation,CobiT 3.0was being used.Therefore,the panel made judgments on five IT resources.As indicated in note two,CobiT 4.0combines Technology and Facilities.During the analysis of the expert panel responses,these two IT resources are combined to reflect CobiT 4.0.10Audit difficulty was also measured but is not correlated with the other risk measures and is therefore not included in any analyses.Initially audit difficulty was included as it seemed reasonable that it would impact auditor risk judgments.As it turns out,it appears that our participants viewed audit difficulty more as being related to detection risk in the audit risk model,while the other factors relate to inherent risk and control risk associated with the client's system.247B.Tuttle,S.D.Vandervelde /International Journal of Accounting Information Systems 8(2007)240–263248 B.Tuttle,S.D.Vandervelde/International Journal of Accounting Information Systems8(2007)240–263identifying a hornet's nest of controls and interfaces among decentralized business units and trying to manage the efforts with scarce resources”(Hoffman,2004,p.2).3.1.2.ImportanceAs a whole,“the importance of IT governance can be appreciated in light of Gartner Group's finding that large organizations spend over50%of their capital investment on IT”(Ridley et al., 2004,p.1).More specifically,we expect management to place more importance on IT areas that are high risk.For instance,self-assessment programs recognize the relationship between risk and,“how important the process is for their business objectives”(Lainhart,2001,p.21).The more important the IT process,the more likely auditors are to seek assistance when a question arises.3.1.3.AttentionSimilar to importance,we argue that organizations focus their attention with respect to IT governance on areas of higher risk.This notion is consistent with self-assessment programs and the risk-based audit approach applied by major accounting firms.“Management can concentrate on the areas of high risk identified through auditors'assessments and then use CoBiT's high level and detailed control objectives to determine cost-effective means for mitigating these risks”(Lainhart,2001,pp.21–22).3.1.4.Process riskThe risk associated with a process failing,regardless of the“type”of risk(i.e.,inherent risk, control risk,business risk,or fraud risk)increases audit risk.“COBIT is a breakthrough tool that helps enterprises balance IT risk and investment in controls”(Lainhart,2001,pp.19–20).Each evaluation was elicited on a scale from one to nine with one being“very low[insert one of the four measures]”and nine being“very high[insert one of the four measures]”(i.e.,“very low complexity”and“very high complexity”)as it relates to a“typical organization.”Table1shows mean ratings from the IT auditors for each information criteria and IT resource for each measure. Although the IT auditors expressed a high level of familiarity with the concepts in the survey and with CobiT,to ensure reliability the IT auditors first read the CobiT definitions of the information criteria and IT resources before completing their assessments(IT Governance Institute,2000).11 We perform an exploratory factor analysis to determine whether the above measures load on a single risk factor.This analysis suggests that complexity,client importance,client attention,and process risk load on the same factor.Table1also shows what we label a“Combined Assessment,”for each information criterion and each IT resource.The combined assessment represents an“overall”risk measure score that is derived by weighting the assessments for each of the four different risk measures(complexity, client importance,client attention,and process risk)by their factor scores and then summing the products(this process is described in more detail below).The combined assessments are used to11The manner in which we obtain the ratings makes it highly likely that the responses result from knowledge gained from experience rather than from training in CobiT.For instance,Fig.1of the paper shows that there are226instances in which an Information Criteria or IT Resource apply to one of the34CobiT processes.In addition,three importance levels are associated with34separate IT processes.Both facets of the framework far exceed a person's ability to recall from memory based on training alone.More importantly,it is unlikely that our auditors previously encountered ratings of risk, complexity,client attention,etc.as they apply to the specific Information Criteria or IT Resources or CobiT processes.In contrast,the IT auditors do encounter circumstances during their audits in which they learn to associate these factors together.。

Data structure repair using goal-directed reasoning

Data Structure Repair Using Goal-Directed ReasoningBrian DemskyLaboratory for Computer Science Massachusetts Institute of T echnology Cambridge,MA02139Martin RinardLaboratory for Computer Science Massachusetts Institute of Technology Cambridge,MA02139ABSTRACTModel-based data structure repair is a promising technique for enabling programs to continue to execute successfully in the face of otherwise fatal data structure corruption er-rors.Previous research in thisﬁeld relied on the developer to write a speciﬁcation to explicitly translate model repairs into concrete data structure repairs,raising the possibility of1)incorrect translations causing the supposedly repaired concrete data structures to be inconsistent,and2)repaired models with no corresponding concrete data structure rep-resentation.We present a new repair algorithm that uses goal-directed reasoning to automatically translate model repairs into con-crete data structure repairs.This new repair algorithm elim-inates the possibility of incorrect translations and repaired models with no corresponding representation as concrete data structures.Unlike our old algorithm,our new algo-rithm can also repair linked data structures such as a list ora tree.1.INTRODUCTIONPrograms usually make assumptions about the states of the data structures that they manipulate.A software error or some other event may cause the data structures to violate consistency assumptions that the software relies on.Data structure repair is a useful technique for restoring consis-tency properties,enabling the program to continue to exe-cute successfully.Our previous work[9,10,8]introduced a model-based approach in which the developer uses a speciﬁ-cation language to identify the required data structure con-sistency properties and provided an experimental evaluation of this approach in which the repair algorithm was used to improve the reliability of four diﬀerent benchmarks.This model-based approach involves two views:a concrete view of the data structures as they are represented in the memory and an abstract view that models the data struc-tures as sets of objects and relations between objects.A set of model deﬁnition rules translates the concrete data struc-tures to the sets and relations in the abstract model.The key consistency constraints are expressed using the sets and relations in this model.There are three challenges in making this approach eﬀective:1)maintaining a correspondence be-This research was supported in part by a fellowship from the Fannie and John Hertz Foundation,DARPA ContractF33615-00-C-1692,NSF Grant CCR00-86154,and NSF Grant CCR00-63513.tween the abstract model and the concrete data structures, 2)generating a set of repairs that is suﬃcient to repair any error,and3)ensuring that all repairs terminate.Our previous work[9,10,8]performed repairs on the abstract model and relied on a set of user-deﬁned external consistency constraints to faithfully translate these model repairs to the actual data structures.While this approach automates much of the repair process,the presence of the ex-ternal consistency constraints has several undesirable prop-erties:•An error in the external consistency constraints maycause the repair algorithm to fail to correctly trans-late the model repair into data structure updates.Inthis case the data structures would remain inconsistenteven after the repair.•The repair algorithm may generate abstract modelsthat can not be represented as concrete data struc-tures.To avoid this possibility,the developer may needto add additional model constraints that prevent therepair process from constructing such a model.Our new algorithm replaces the external consistency con-straints with a goal-directed reasoning algorithm on the model deﬁnition rules.The new approach has several advantages over the previous approach:•It eliminates the possibility of errors in the externalconsistency constraints and guarantees that repairs arecorrectly translated from the model to the concretedata structures.•It eliminates the possibility that the repair algorithmmay produce a model with no corresponding concretedata structure representation.•It provides enhanced support for linked data struc-tures,enabling the new repair algorithm to add or re-move objects from the data structures as required tosatisfy the consistency constraints.1.1Repair Algorithm GeneratorA set of model deﬁnition rules deﬁnes a translation from the concrete data structures to an abstract representation. Each rule consists of a quantiﬁer,a guard,and an inclusion constraint that speciﬁes an object(or a tuple)to include in a speciﬁc set(or relation).These rules place objects into sets based on criteria such as the values of theﬁelds in the object and the reachability of the object from other objects. The key consistency constraints are expressed using the setsand relations in the abstract model.Our speciﬁcation lan-guage supports constraints between the values of variables and objectﬁelds,on the referencing relationships between objects,and on the absence or presence of certain objects. When invoked,our repair algorithm constructs the model and examines it toﬁnd any inconsistencies.Whenever the repair algorithm discovers an inconsistency,it selects an ap-propriate model repair action to repair the inconsistency in the model.Our repair algorithm generator uses goal-directed reasoning to map model repair actions to concrete data structure updates.To implement a model repair action that removes an object from a given set,for example,the al-gorithm generator analyzes the model deﬁnition rules toﬁnd all rules whose inclusion constraint may cause the object to be inserted into the set.It then analyzes the guards and the quantiﬁers of the rules to extract a set of data structure properties whose satisfaction ensures that no rule speciﬁes that the object should be a member of that set.Finally,it computes and applies(as necessary)a set of data structure updates that force all of these properties to hold.The ef-fect is to remove the object from the set.Note that there may also be potentially undesirable side eﬀects which cause additional inconsistencies.The algorithm must then apply additional repairs to correct these inconsistencies.At each step in the repair process,the repair algorithm may be forced to choose between several alternatives—in general,there may be several distinct sets of model repair actions that cause a given violated constraint to become satisﬁed,several distinct sets of data structure updates that implement a given model repair action,and several diﬀerent ways to eliminate any undesirable side eﬀects of the data structure updates.A naive repair strategy can easily fail to terminate—it can get into a loop in which it repeatedly repairs a violated constraint,only to have the constraint repeatedly invalidated as a side eﬀect of a subsequent action taken to repair another constraint violated as a side eﬀect of theﬁrst repair action.Our algorithm uses a repair dependence graph to reason about the termination of the repair process.The nodes in this graph represent constraints and repair actions.The edges represent dependences between the constraints,repair actions,and choices in the repair process.The absence of certain cycles in the graph ensures that all repairs will termi-nate.In addition to analyzing the graph to determine termi-nation,our algorithm may also(when possible and subject to certain graph consistency conditions)remove nodes or edges to eliminate undesirable cycles.These removals con-strain the actions of the repair algorithm and ensure that it will never choose a repair strategy that leads to an inﬁnite repair loop.1.2ContributionsThis paper makes the following contributions:•Basic Repair Approach:It presents an approach that allows the developer to use an abstract model to express important data structure consistency prop-erties.Violations of these properties are repaired by automatically translating model repairs back through the model deﬁnition rules to automatically derive a set of data structure updates that implement the repair.•Repair Translation:It presents an algorithm that uses goal-directed reasoning to translate repairs in theabstract model back through the model deﬁnition rulesto derive a set of data structure updates that imple-ment the repair.•Repair Dependence Graph:It introduces the re-pair dependence graph,which captures dependencesbetween consistency constraints,repair actions,andchoices in the repair process.This graph supports for-mal reasoning about the eﬀect of repairs to both themodel and the data structures.It also presents a set of conditions on the repair depen-dence graph.These conditions identify a class of cycleswhose absence guarantees that all repairs will success-fully terminate.It also presents an algorithm that,when possible,removes nodes and edges in the graphto eliminate problematic cycles.These removals pre-vent the repair algorithm from choosing repair strate-gies that may not terminate.•Linked Data Structures:It presents support foradding and removing objects from linked data struc-tures.This support enables the developer to expressconstraints on membership in a linked data structure,and enables the repair algorithm to regenerate dam-aged backpointers in linked data structures.2.EXAMPLEWe next present an example that illustrates the operation of our repair algorithm.We start with the concrete data structure in our example.Figure1presents the structure deﬁnitions for the example data structure;these deﬁnitions give the physical layout of the objects comprising the con-crete data structures.The process object participates in both a tree and a list structure.It contains a left pointer, which references its left child in the tree;a right pointer, which references its right child in the tree;a next pointer, which references the next process object in a list;and the activeﬂag,which indicates whether the process is active.1 Figure2graphically presents a concrete instance of an(in-consistent)process list and tree.struct process{process*left;process*right;process*next;bool active;...}process*tree;process*list;Figure1:Structure Deﬁnitions2.1Set and Relation DeﬁnitionsFigure3contains the deﬁnitions for the sets and relations in the model.Our model consists of the set ActiveProcesses, which contains the process objects in the list,and the set Processes,which contains the process objects in the tree. The Next,Left,Right,and Active relations model the values of the next,left,right,and activeﬁelds in the 1Our algorithm also supports mode conventional implemen-tations of the data structure.23Figure2:Inconsistent Process Structureset ActiveProcesses of processset Processes of processrelation Next:process->processrelation Left:process->processrelation Right:process->processrelation Active:process->boolFigure3:Set and Relation Deﬁnitionsprocess object.In this example,the relations closely paral-lel the contents of the data structureﬁelds.In general,the relations tend to be more abstract and capture conceptual properties further removed from the concrete data struc-tures.2.2Model Deﬁnition RulesThe model deﬁnition rules specify a translation from the concrete data structures to an abstract model.Conceptu-ally,these rules specify how to traverse the data structures to build the sets and relations in the model.Furthermore, they provide the developer with a means to separate objects into diﬀerent sets and to apply diﬀerent model constraints to these diﬀerent sets.Each rule speciﬁes a quantiﬁer that identiﬁes the scope of the variables in the body.The body contains a guard and an inclusion condition.The inclusion condition speciﬁes an object(or a pair)that must be in a speciﬁc set(or relation)if the guard is true.The leastﬁxed point of the model deﬁnition rules applied to the concrete data structure generates the abstract model.The model def-inition rules for the example are given in Figure4.Theﬁrst rule speciﬁes that the process object referenced by the tree pointer is in the Processes set.The second rule speciﬁes that the process object referenced by the list pointer is in the ActiveProcesses set.The next two rules specify that the left and right children of any object in the Processes set are also in the Processes set.The next three rules con-struct the Left,Right,and Active relations to model the left,right,and activeﬁelds of objects in the Processes set.The eighth rule speciﬁes that an object referenced by the nextﬁeld of an object in the ActiveProcesses set is 1.tree!=null=>tree in Processes2.list!=null=>list in ActiveProcesses3.for p in Processes,p.left!=null=>p.left in Processes4.for p in Processes,p.right!=null=>p.right in Processes5.for p in Processes,p.left!=null=><p,p.left>in Left6.for p in Processes,p.right!=null=><p,p.right>in Right7.for p in Processes,true=><p,p.active>in Active8.for p in ActiveProcesses,p.next!=null=>p.next in ActiveProcesses9.for p in ActiveProcesses,p.next!=null=><p,p.next>in NextFigure4:Model Deﬁnition RulesProcessesActiveProcessesFigure5:Inconsistent Abstract Modelalso in the ActiveProcesses set.Theﬁnal rule constructs the Next relation to model the nextﬁeld of objects in the ActiveProcesses set.The leastﬁxed point of the model deﬁnition rules is evaluated on the concrete data structure shown in Figure2to construct the abstract model in Fig-ure5.The bold circles in the Venn diagram represent ob-jects in the data structure,the edges represent the relations, and the large circles represent the sets.2.3Model ConstraintsThe model constraints identify the consistency properties that must hold in the model.Many of these rules use the size predicate,which is used both to relate the number of objects in a set to a value in a relation and to con-strain the number of objects in a set.For example,the ﬁrst constraint in Figure6ensures that each process ob-ject in the ActiveProcesses set has an in-degree of at most one.2The second constraint ensures that each process in the Processes set has an in-degree of at most one.Theﬁnal constraint ensures that each process in the Processes set 2Note that we use the notation Next.p to indicate the image of p under the inverse of the Next relation;i.e.,the set of all m such that m,p in Next.either has its activeﬂag set to false,or is in theActiveProcesses set.Note that the process object la-beled p2in Figure5is in the Processes set,has the active ﬂag set,and is not in the ActiveProcesses set.This vio-lates theﬁnal consistency constraint,for p in Processes, !p.Active or p in ActiveProcesses.for p in ActiveProcesses,size(Next.p)<=1for p in Processes,(size(Left.p)<=1and size(Right.p)=0)or(size(Left.p)=0and size(Right.p)<=1)for p in Processes,!p.Active or p in ActiveProcesses Figure6:Model Constraints2.4Previous Repair AlgorithmOur previous repair algorithm[9,10,8]constructs an ab-stract representation of the data structures to be repaired, performs repairs on this abstract representation,and then uses a set of external consistency constraints to translate the abstract repairs to the concrete data structure.Figure7presents a set of external consistency constraints for the process example.3The constraints shown ensure that the Left,Right,Next,and Active relations are written to the left,right,next,and activeﬁelds of the process objects.for<p1,p2>in Left,true=>p1.left=p2for<p1,p2>in Right,true=>p1.right=p2for<p1,p2>in Next,true=>p1.next=p2for<p,a>in Active,true=>p.active=aFigure7:External Consistency Constraints for Pre-vious Repair AlgorithmThe model construction phase of our previous repair al-gorithm generates an identical abstract model to the model that appears in Figure5.Our previous repair algorithm would detect that since object p2is in the Processes set,has the activeﬂag set,and is not in the ActiveProcesses set, it violates the consistency constraint for p in Processes, !p.Active or p in ActiveProcesses.As a result,our pre-vious repair algorithm would add the object p2to the ActiveProcesses set,generating the abstract model shown in Figure8.Since this model is consistent with all of the consistency constraints,the repair algorithm would then perform the up-dates speciﬁed by the external consistency constraints.Un-fortunately,this fails to generate a consistent concrete data structure.The problem is that although the instance of the abstract model shown in Figure8satisﬁes the model con-straints,it does not correspond to any concrete data struc-ture.As a result,this instance of the abstract model cannot be faithfully translated to a concrete data structure by any set of external consistency constraints.As this example shows,the correctness of the previous repair algorithm relies on the developer ensuring that the repair process generates a consistent model that corresponds to a concrete data structure(i.e.,that the abstract model corresponds to the leastﬁxed point of the model deﬁnition 3Note that the external constraints are not used by the re-pair algorithm presented in this paper.ProcessesFigure8:Incorrectly Repaired Abstract Model rules evaluated on some concrete data structure)and that the external consistency constraints faithfully translate the consistent abstract model to a consistent data structure. Our new repair algorithm eliminates all of these problems. It guarantees the correspondence of the abstract model to the leastﬁxed point of the application of the model deﬁ-nition rules to the concrete data structures.This enables the repair algorithm to handle cases such as this example. Furthermore,the new algorithm requires less work on the part of the developer and eliminates the possibility of er-rors in the external consistency constraints.The result is an algorithm that can handle linked data structures,is eas-ier to use,and eliminates the possibility of bad repairs due to errors in the external consistency constraints.2.5Repair AlgorithmOur new repair algorithm constructs an abstract repre-sentation of the data structures to repair,identiﬁes model repairs to perform on the abstract representation,and then translates the model repairs into data structure updates.It then performs the data structure update on the concrete data structure,and recomputes the model to ensure that the model corresponds to the leastﬁxed point of the model deﬁnition rules applied to the concrete data structures. Notice that in Figure5,the object p2is in the Processes set,has its activeﬂag set,and is not in the ActiveProcesses set.This violates theﬁnal constraint shown in Figure6.To repair this violation,the algorithm must either remove p2 from the Processes set,set p2’s activeﬂag to false,or add p2to the ActiveProcesses set.4Assume that the algo-rithm chooses to add the object p2to the ActiveProcesses set.An examination of the model deﬁnition rules reveals that the model deﬁnition rule,for p in ActiveProcesses, p.next!=null=>p.next in ActiveProcesses,inserts ob-jects into the ActiveProcesses set.Examination of this rule reveals that its guard is p.next!=null and its inclusion condition is p.next in ActiveProcesses.Goal-directed rea-soning makes it clear that the repair algorithm must set the 4Note that the repairs correspond to satisfying one of the conjunctions in the disjunctive normal form(DNF)of the constraint or to removing an object(or tuple)from the set (or relation)that the model constraint is quantiﬁed over.nextﬁeld of p1to p2and the nextﬁeld of p2to null(since the previous value of p2.Next was{}).After the nextﬁelds are updated,the algorithm recomputes the abstract model using aﬁxed point calculation.Note that this data structure update has additional ef-fects.Speciﬁcally,the tuple p1,p2 is added to the Next relation.At this point,the model is consistent and the re-pair process terminates.Figure9shows the abstract model after the repair algorithm hasﬁnished,and Figure10shows the concrete data structures after the repair algorithm has ﬁnished.Note that the model in Figure9contains a refer-ence in the Next relation from the object p1to the p2that is absent in Figure8.ProcessesFigure9:Correctly Repaired Abstract Model23Figure10:Consistent Process Structure2.6Repair Algorithm GenerationAs illustrated in the preceding section,a successful repair algorithm must perform several steps:1)traverse the model toﬁnd an inconsistency,2)analyze the model deﬁnition rules toﬁnd updates to the concrete data structures that will elim-inate the inconsistency,3)perform the updates,4)repeat to eliminate any remaining or newly introduced inconsisten-cies,and5)terminate.The key challenges areﬁnding the data structure updates and reasoning about termination.As described above,the algorithm uses goal-directed reasoning to extract conditions from the model deﬁnition rules;the execution of data structure updates that satisfy these con-ditions implements the model repair.The algorithm uses the repair dependence graph to rea-son about termination.The nodes in this graph model constraints and repair actions;the edges represent depen-dences.In our example the graph contains(in addition to other edges as described below in Section7)nodes for each model deﬁnition rule,nodes for repair actions,and nodes for the conjunctions in the disjunctive normal form(DNF)of the model constraints such as for p in ActiveProcesses, size(Next.p)<=1.The conjunction nodes correspond to the diﬀerent options for satisfying a given model constraint. The graph contains an edge from the node representing the conjunction size(Next.p)<=1to the node representing the action of removing a tuple from the Next relation.This edge captures the fact that the repair algorithm may choose to re-pair a violation of this constraint by removing a tuple from the Next relation.In general,the graph edges model the propagation of the eﬀects of repair actions.The absence of certain kinds of cycles ensures that the eﬀect of every repair action will propagate only aﬁnite distance,ensuring that repairs terminate.3.SPECIFICATION LANGUAGEOur speciﬁcation language consists of the structure deﬁ-nition language,model deﬁnition language,and model con-straint language.The structure deﬁnition language is sim-ilar to that of C,but supports a wider range of primitive data types.3.1Model Deﬁnition LanguageThe model deﬁnition language allows the developer to de-clare the sets and relations in the model and to specify the rules that deﬁne the model.The model deﬁnition rules de-ﬁne a translation from the concrete data structures into the abstract model.Figure11presents the grammar for the set and relation declarations and the model deﬁnition rules. The model constructed by the repair algorithm is the least ﬁxed point generated by the application of this set of model deﬁnition rules.3.2Model Constraint LanguageFigure12presents the grammar for the model constraint language.Each constraint consists of an optional quantiﬁer Q followed by a body B.The body uses logical connectives (and,or,not)to combine basic propositions P.We treat undeﬁned values in this semantics by appropriately extend-ing arithmetic operations to work with undeﬁned values and logical operations to work with maybe according to the laws of three-valued logic.In many cases,relations are used as functions.To en-sure that these uses are well formed,the repair algorithm requires the speciﬁcation to include additional constraints that constrain the relations to be functions.For example, our system requires that speciﬁcations containing expres-sions of the form E.R also contain another constraint eitherD:=set S of T|S partition(S,)∗|S subset(S,)∗|relation R:S->S|relation R:T->TM:=(Q,)∗G=>IQ:=for V in S|for V,V in RG:=G and G|G or G|!G|(G)|PP:=F E=E|F E<E|F E<=E|F E>=E|F E>E|true|E in S| E,E in RI:=F E in S| F E,F E in RE:=F E|number|string|E+E|E-E|E*E|E/EF E:=V|V.fieldFigure11:Model Deﬁnition LanguageC:=Q,C|BQ:=for V in S|for V,V in RB:=B and B|B or B|!B|(B)|PP:=V E=E|V E<E|V E<=E|V E>E|V E>=E|V in SE|size(SE)=c|size(SE)>=c|size(SE)<=cV E:=V.R|V E.RE:=V|number|string|E+E|E-E|E*E|E/E|E.R|size(SE)|(E)SE:=S|V E|R.VFigure12:Model Constraint Languageof the form size(V.R)=1or V.R=E where V quantiﬁes over a set containing all the possible sets of values for E. 3.3Desugaring Partition and Subset Constraints The repair algorithm enforces the partition constraints and subset constraints by desugaring these constraints into model constraints and model deﬁnition rules.The repair algorithmﬁrst analyzes the partition and subset constraintstoﬁnd cyclic dependencies.If the repair algorithm discoversa cyclic dependency,the repair algorithm simply collapsesall sets in the cyclic dependency to a single set.Then the repair algorithm removes any constraints that are discoveredto be extraneous as a result of collapsing sets in a cyclic dependency to a single set.As a result,we can safely assume that the partition and subset constraints do not include any cycles.We then desugar the partition constraint S partition S1,...,S n into the model constraint:for V in S,(V in S1and!V in S2...and!V in S n)or(!V in S1and V in S2...and!V in S n)or...or(!V in S1and!V in S2...and V in S n).Furthermore,if the subset or partition constraints imply ∀s,s∈S1=>s∈S2,then a new model deﬁnition rule will be created for any model deﬁnition rule that adds an element to S1;this new rule will be the original rule modiﬁedto add the same element to S2.We optionally allow relation declarations to declare do-main and range sets.We desugar relation declarations of the form relation R:S1->S2into model constraints of the form:for V1,V2 in R,(V1in S1)and(V2in S2).In some cases,this model constraint is not necessary.For example,our algorithm does not generate the model con-straint for S i if for each model deﬁnition rule of the form (Q,)∗G⇒ F E1,F E2 in R there is a model deﬁnition rule of the form(Q,)∗G⇒F E1in S i.4.MODEL CONSTRUCTIONThe model deﬁnition rules deﬁne a translation from the concrete data structures to the abstract model.The model construction phase constructs the abstract model by com-puting the leastﬁxed point of the model deﬁnition rules applied to the concrete data structure.Finally,the model construction algorithm keeps track of the memory layout to ensure that the concrete data structures are physically well formed(that they reside in allocated memory and that they don’t illegally overlap).4.1Denotational SemanticsFigure21in Appendix C gives the denotational semantics R[M]h l m of a single rule C.A model m is a mapping from set names and relation names to the corresponding sets of objects or relations between objects.This mapping is rep-resented using a set of tuples.We deﬁne m(s)to be the set{ v,s | v,s ∈m}.The set h models the heap in the running program using a set of tuples representing the refer-ences in the heap.The set h contains tuples that represent a mapping of each legal pairing of object andﬁeld;or object,ﬁeld,and integer index to exactly one HeapV alue.Given a set of concrete data structures h,a naming environment l that maps variables to data structures or values,and a cur-rent model m,R[M]h l m is the new model after applying the rule to m in the context of h and l.Note that l provides the values of both the program variables that the rules use to reference the concrete data structures and the variables bound in the quantiﬁers.Each model deﬁnition contains a set of model deﬁnition rules M1,...,M n.Given a model containing these rules,a set of concrete data structures h,and a naming environment l for the program variables,the model is the leastﬁxed point of the functionalλm.(R[M1]h l)...(R[M n]h l m).4.2Negation and the Rule Dependence Graph The presence of negation in the model deﬁnition language complicates the computation of the leastﬁxed point.For ex-ample,negation makes it possible for a rule to specify that an object is in a given set only if another object is not in an-other set.We address this complication by requiring the set of model deﬁnition rules to have no cycles that go through rules with negated inclusion constraints in their guards. We formalize this constraint using the concept of a rule dependence graph.There is one node in this graph for each rule in the set of model deﬁnition rules.There is a directed edge between two rules if the inclusion constraint from the ﬁrst rule has a set or relation used in the quantiﬁers or guard of the second rule.If the graph contains a cycle involving a rule with a negated inclusion constraint,the set of model deﬁnition rules is not well founded and we reject it.Given a well-founded set of constraints,our model construction algorithm performs oneﬁxed point computation for each strongly connected component in the rule dependence graph, with the computations executed in an order compatible with the dependences between the corresponding groups of rules.。

海事劳工符合声明第一部分中英双语

海事劳工符合声明第一部分中英双语Maritime Safety Administration ofthe People’s Republic of China海事劳工符合声明-第I部分Declaration of Maritime Labour Compliance-Part I(注：本声明必须附于船舶的海事劳工符合证明之后)（Note:This Declaration must be attached to the ship’s Statement of Maritime Labour Compliance）签发This Declaration is issued by the Maritime Safety Administration of People’s Republic of China就《2006年海事劳工公约》的规定而言，下述船舶With respect to the provisions of the Maritime Labour Convention,2006,the following referenced ship:与公约标准A5.1.3保持一致：Is maintained in accordance with Standard A5.1.3 of the Convention:下面的签字者代表上述主管当局声明：The undersigned declares, on behalf of the abovementioned competent authority ,that:(a) 《海事劳工公约》的规定已充分体现在下述国家要求之中：(a) the provisions of the Maritime Labour Convention are fully embodied in the following national requirements referred to below;(b) 这些国家要求收录在下文所述的国家规定中；凡必要时提供了关于这些规定内容的解释：(b) these national requirements are contained in the national provisions stated below; explanations concerning the content of those provisions are provided necessary;(c) 根据第六条第3款和第4款的任何实质上等效的细节在下述部分提供：(c) the details of any substantial equivalencies under Article VI, paragraphs 3 and 4, are provided in the following sections;(d) 主管机关根据标题三所准予的任何免除在下文专门部分明确指出；(d) any exemptions granted by the competent authority in accordance with Title 3 are clearly indicated in the section provided for this purpose below; and(e) 在有关要求中还提及了国家立法中对任何船舶类型的具体要求。

软件工程领域会议等级

A类期刊和会议：中国科学Journal of ACMACM Transactions on Programming Languages and SystemsACM Transactions on Software Engineering and MethodologyACM Transactions on Embedded Computing SystemsFormal Methods in System DesignIEEE Transactions on Software EngineeringIEEE Transactions on Dependable and Secure ComputingInternational Conference on Computer Aided Verification (CAV)IEEE Symposium on Logic in Computer Science (LICS)International Conference on Model Driven Engineering Languages and Systems (MODELS) ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL) IEEE Real-Time Systems Symposium (RTSS)International Conference on Embedded Software (EMSOFT)International Conference on Cyber-Physical Systems (ICCPS)International Conference on Formal Methods on Computer Aided Design (FMCAD) International Conference on Hybrid Systems: Computation and Control (HSCC)IEEE International Conference on Program Comprehension (ICPC)ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE)B类期刊和会议：ACM Transactions on Autonomous and Adaptive SystemsACM Transactions on Design Automation of Electronic SystemsAutomated Software EngineeringFormal Aspects of ComputingIET SoftwareInformation and Software TechnologyInternational Journal of Software Tools and Technology TransferInnovations in Systems and Software EngineeringJournal of Logic and Algebraic ProgrammingJournal of Software Maintenance and Evolution: Research and PracticeJournal of Systems and SoftwareReal-Time SystemsScience of Computer ProgrammingSoftware: Practice and ExperienceSoftware Testing, Verification and ReliabilitySoftware and Systems ModelingSoftware Quality JournalThe Computer JournalInternational Conference on Aspect-Oriented Software Development (AOSD)International Conference on Automated Software Engineering (ASE)International Conference on Concurrency Theory (CONCUR)European Joint Conferences on Theory and Practice of Software (ETAPS)International Symposium on Formal Methods (FM)International Symposium on Software Testing and Analysis (ISSTA)Design, Automation & Test in Europe Conference (DATE)C类期刊和会议：计算机学报、软件学报、电子学报Annual ACM Symposium on Applied Computing (ACM SAC)Asia-Pacific Software Engineering Conference (APSEC)International Conference on Reliable Software Technologies (Ada-Europe)European Conference on Model Driven Architecture® - Foundations and Applications (ECMDA-FA) International IEEE EDOC Conference (EDOC)International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS) International Conference on Formal Methods for Networked and Distributed Systems (FORTE) Haifa Verification Conference (HVC)International Colloquium on Automata, Languages and Programming (ICALP)International Conference on Formal Engineering Methods (ICFEM)IEEE International Conference on Software Maintenance (ICSM)IEEE International Conference on Software Testing, Verification and Validation (ICST)IEEE International Conference on Web Services (ICWS)International Conference on Integrated Formal Methods (IFM)International Conference on Real-Time and Network Systems (RTNS)IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM) International SDL Forum (SDL)International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) International Conference on Runtime Verification (RV)D类期刊和会议导师组认可的国际期刊和国际会议注：Short papers、Tool papers酌情减分。

工商管理专业英语词汇[1]

工商管理专业英语词汇手册商学院2009年1月目录管理学 (3)组织行为学 (5)市场营销学 (11)经济学 (28)商务谈判 (34)财务管理 (40)质量管理 (47)管理学absenteeism缺勤率achievement-oriented leadership成就取向型领导acquisition购买adaptability适应性administrative ability行政管理能力administrator 行政人员advanced technology先进技术affection情感affiliation needs 归属的需要affiliation归属aggressiveness进取性antagonism 敌对appraisal tool评价工具appraisal鉴定approval procedure 批准程序approval批准aspiration抱负assessment 评估attitude态度authority职权autocratic leader专制式领导balance sheet资产负债表behavior science行为科学behavior表现board of director董事会bonus奖金budget预算business ethics competitive price有竞争力的价格business 商业capacity to produce生产能力capital outlay 资本支出capital shortage资金短缺cash flow现金流量cash position 现金状况company image公司形象company公司compensation报酬controlling 控制confidence信心conflict of interests利益冲突conflict 冲突conglomerate resource大型联合企业资源consistency strategy应变策略consistency一致性control device控制手段coordinate协调counselor顾问customer service strategy顾客服务策略delegation of authority授权democratic leader民主式领导demographic factor人口因素derivative policy派生政策desire欲望deviation偏差devotion 奉献discretion 灵活性diversification多种经营dividend股息division general manager分公司总经理dynamic 动态的eclectic折中economic system经济体系effectiveness 效果efficiency效率end result 最终结果enterprise企业enthusiasm热情entrepreneur企业家equipment 设备esteem needs尊敬的需要esteem尊敬expense account开支帐户external environment外部环境feasibility可行性feedback反馈flexible灵活的followership追随franchise 特许经营free—rein leader自由放任式领导general manager总经理geographic factor地理因素group objective 集体目标growth goal增长目标human input人力投入human relation人际关系hygiene motivator保健激励因素individuality个性industry产业ingredient要素innovation 创新inspection record检验记录inspire鼓舞instrumental leadership 指导型领导intelligence智力internal environment内部环境interpersonal skills人际交往能力inventory 存货joint venture 合资企业labor dispute劳资纠纷labor-hour工时latitude自主权law法律layoff解雇leader behavior领导行为leading 领导liquidation strategy 破产政策loyalty忠诚machine—hour机时machinery机器maintenance 维持major decision主要决定management by objectives目标管理managerial decision管理决策商业道德managerial function管理职能manager经理market share市场占有率merit system考绩制度mission/ objective 目标modern operational management现代经营管理morale士气motivate 激励motivational techniques激励方法motivation激励needs for self—actualization自我实现的需要obedience 服从opportunity机会optimistic乐观的organizational culture组织文化organizing 组织overall budget总预算participative leadership参与型领导payroll工资表performance业绩performance业绩personal interest个人利益persistence毅力personal responsibility个人责任personal worth个人价值personality性格pervasiveness fear普遍性忧虑pessimistic悲观的physiological needs生理的需要planning计划power权利policy 政策portfolio matrix资产组合距阵practitioner实际工作者prejudice偏见pressure 压力primacy 领先性principle原理priority 优先probability概率procedure程序process步骤procurement采购productivity生产率productivity生产率product产品product line产品系列profitability利润率public responsibility社会责任profit利润promotion晋升program规划proprietary product专利产品psychology心理学public relation公共关系quality of products产品质量quantitative objective 定量目标定性目标record of labor—hours lost误工记录recruit招聘regulation 法规reinforcement theory强化理论resentment 忿恨resistance 抵制responsibility职责retail零售retrenchment strategy紧缩政策return on investment投资回报review审查reward奖励rival竞争对手rule规则safety安全sales volume销售量satisfaction满意satisfaction满足scientific management 科学管理staffing人事supervisor主管人员security needs 安全的需要select 选拔self—actualization自我实现service服务sick leave病假size of the organization组织规模static 静止的status地位stock option 股票期权strength优势structure结构style 作风subconscious潜意识subordinate下级supplier供货商supportive leadership支持型领导surplus盈余synergy共同作用tactics战术tax rate 税收率technique方法the commitment principle投入原则the contingency approach随机制宜法the cooperative social systems approach协作社会系统法the decision theory approach 决策理论法the empirical approach经验法the group behavior approach集体行为法the interpersonal behavior approach人际行为法the mathematical approach数学法the managerial grid管理方格图the managerial roles approach管理任务法the operational approach经营法the social—technical systems approach社会技术系统法the systems approach系统法threat威胁train 培训trait 品质turnover人员流动vacation休假value 价值vendor 小贩wage rate工资率weakness 弱点welfare 福利wholesale批发work efficiency工作效率zeal热诚组织行为学absences 缺勤achievement motivation 成就动机acquired immune deficiency syndrome( aids ）爱滋病action research 行动研究active listening 主动的倾听adult ego state）成人自我心态affiliation motivation 亲和动机affirmative action 认可性行动alienation疏离appraisal interview考评面谈area of job freedom工作自由领域assertiveness果断at—risk pay风险工资attitudes态度attribution归因autocratic leaders独裁型领导者autocratic model独裁模型autonomy自主baseline information基准信息bases of power权力基础behavioral bias行为偏见behavioral intentions行为意向biofeedback生理反馈body language身体语言boundary roles边缘角色boundary spanners边界人员brainstorming头脑风暴法change agents变革顾问changing变革charisma领导魅力child ego state儿童自我心态clarified thinking澄清思维closed-end questions封闭式问题closed questions集中式问题cluster chain簇式沟通链coach教练codetermination协同决定coercive power强制性权力cognitive dissonance认知失调cohesiveness凝聚力collectivism集体主义collegial model合作模型committee委员会communication沟通communication overload 沟通过度communication process沟通过程comparable worth可比较的价值competence motivation能力动机complementary transaction互补式交互作用complete pay program完全工资方案conceptual skills概念技能conditional strokes有条件的肯定conflict冲突conformity服从confronting正视consensus一致意见consideration关怀consultative management协商式管理contingency approach to ob ob的权变方法contingency model of leadership领导的权变模型core dimension工作的核心维度corrective discipline纠正性纪律cost-benefit analysis成本收益分析cost—reward comparison成本回报比较counseling咨询服务counseling functions咨询功能credibility gap信用差距cross-cultural communication跨文化沟通crossed transaction交叉式交互作用cultural contingency文化权变cultural distance文化距离cultural diversity文化多样性cultural empathy文化认同cultural shock文化冲击custodial model监护模型decision—making model of leadership领导的决策模型defensive reasoning防御型推理deferred judgment延迟判断delegation授权development level发展程度devil’s advocate魔鬼代言人dialectic decision method( ddm）辩证决策法directive counseling指导式咨询discharge解雇discipline纪律discrimination歧视division of work工作划分double-loop learning双回路学习downward communication下行沟通drives驱力dysfunctional effect消极影响ecological control生态控制economic incentive system经济刺激系统ego states自我心态elaborating夸大electronic brainstorming电子化头脑风暴法electronic grapevine电子化的小道消息electronic mail （e-mail）电子邮件electronic monitoring电子监控emotional catharsis感情宣泄employee assistance program支持员工方案employee ownership员工所有制employee territories员工领地employment enrichment就业丰富化empowerment授权enhancers for leadership领导的放大器enriched sociotechnical work system丰富的社会技术工作体系equal employment opportunity （eeo) 均等就业机会equal pay act of 1963 1963年公平报酬法案equity sensitivity公平敏感度equity theory公平理论e-r-g model e—r-g模型escalating commitment投入的升级ethical imperative道德约束ethical leadership有道德的领导ethical treatment有道德的对待ethnocentrism民族优越感existence needs生存需要expatriates外派人员expectancy期望expectancy model期望模型experiential learning体验式学习expert power专家性权力extinction消退extrinsic motivators外部激励因素face saving维持脸面facilitators协调员fact premises事实前提feedback反馈feedback-seeking behavior寻求反馈的行为feminine societies女性化社会filtering过滤flexible work schedule弹性工作时间表followership skills追随性技能formal groups正式群体free-rein leaders无控制的领导者frustration挫折感functional effect有益效果fundamental attribution bias基本归因偏差gain sharing收益分享gain—sharing plan收益分享计划genetic monitoring基因监控genetic testing基因测试geocentric organizations地球中心组织goal setting目标设置goals目标goals of organizational behavior组织行为的研究目标gossip chain流言链grapevine小道消息group decision support system群体决策支持系统group dynamics群体动态性groupthink群体思维growth need成长需要hawthorne effect霍桑效应hidden agendas隐蔽的情绪hierarchy of needs需要层级high context culture高度情境文化higher—order needs高级需要holistic ob 整体obhomeostasis内平衡honesty tests诚实测试human relations人际关系human resources approach to ob ｏｂ的人力资源方法human skill人际技能humanistic values人文价值观hygiene factors保健因素iceberg model of counseling冰山咨询模型impairment testing机能损伤测试imposter phenomenon骗子现象impression management印象管理incentives诱因individual differences个体差异individualism个体主义individualization个性化industrial democracy企业民主inference推断informal groups非正式群体informal leader非正式的领导者informal organization非正式组织information technology信息技术initiation of action行为的触发inputs投入instrumentality工具性interventions干预intrinsic motivators内源性动机因素job breadth工作广度job content工作内容job context工作环境job depth工作深度job diagnostic survey工作诊断调查job enlargement工作扩大化job enrichment工作丰富化job involvement工作投入job rotation工作轮换job satisfaction工作满意度job satisfaction survey工作满意度调查job scope工作范围just—in—time training即时培训kaizen改善lateral communication同级沟通law of diminishing returns回报递减法则law of effect效果法则law of individual differences个体差异性法则layoff survivor's sickness裁员幸存者忧虑症leader—member exchange model领导者－成员交换模型leader—member relations领导者－成员关系leader-position power领导者的职位权力leadership领导leadership style领导风格learned helplessness习得性无助legitimacy of organizational influence组织影响的合法性legitimate power法定性权力liaison individuals传播小道消息的人life position人生立场linking pin联结点locus of control控制点long—term orientation长期取向loose rates宽松的标准low context culture低度背景文化lower-order needs低级需要macro motivation宏观激励management by objectives ( mbo）目标管理management by walking around （mbwa）走动式管理managerial grid管理方格论manipulation of people操纵别人masculine societies男性化社会matrix organization矩阵组织mechanistic organization机械化的组织mentor辅导员micro motivation微观激励middle-management committees中层管理委员会mission使命models of ob组织行为模型morale士气motivating potential score ( mps）激励潜在指数动机motivationmotivational factors激励因素multi—skilling多面手multiculturalism多元文化主义multinational organizations跨国组织mutuality of interest互惠利益natural work module自然工作模块natural work team自然工作团队negative reinforcement阴性强化negative strokes负面肯定neighborhoods of offices相邻办公室network关系网network charts网络图networking组网行为neutralizers缓冲器noise噪音nominal group名义组织nondirective counseling非指导式咨询nonverbal communication非语言沟通norm of reciprocity互助规范norms规范ombudsperson咨询员open—book management开放式管理open—door policy开门政策open-end questions开放式问题open questions开放问题open system开放系统operant conditioning操作条件作用organic organizations有机的组织organization development （od）组织开发organizational behavior （ob）组织行为学organizational behavior modification （ob mod) 组织行为校正organizational behavior system组织行为系统organizational citizens组织公民organizational citizenship behavior组织公民的行为organizational commitment组织忠诚度organizational culture组织文化organizational learning curve for change组织变革学习曲线organizational politics组织政治organizational socialization组织社会化outcomes结果/产出output restriction产出限制over participation参与过度paper-and—pencil test纸-笔测验paradigms范式parent ego state家长式自我心态parochialism乡土观念participation参与participative counseling参与式咨询participative leaders参与型领导者participative management参与型管理path—goal leadership路径－目标领导perceived control知觉到的控制perception知觉perceptual set知觉定式performance appraisal绩效评估performance feedback绩效反馈performance gaps绩效偏差performance monitoring绩效监视performance-satisfaction—effort loop绩效－满意－努力环路personal barriers个人障碍personal power个性权力personal wellness个人幸福philosophy of ob组织行为哲学physical barriers物理障碍physical withdrawal行为退化piece rate计件工资polarization极端化political power政治权力politics政治polygraph多导仪positive reinforcement阳性强化positive strokes正面的肯定post-traumatic stress disorder创伤后遗症power权力power distance权力距离power motivation权力动机practice实践prejudice偏见preventive discipline预防性纪律primary needs基本需要primary outcomes首要产出proactive主动procedure工作程序process consultation进展咨询productivity劳动生产率profit sharing利润分享progressive discipline累进式纪律psychic costs精神代价psychological contract心理契约psychological distance心理距离psychological stress evaluator心理压力测评器psychological support心理支持psychological withdrawal心理退化punishment惩罚quality circles质量小组quality of work life ( qwl）工作生活质量quick fixes快速到位rate setting标准设定reactive反应性的readability可读性realistic job previews实际工作预览reference group参照群体refreezing巩固reinforcement强化reinforcement, continuous连续性强化reinforcement，fixed—interval固定间隔的强化reinforcement，fixed-ratio固定比率的强化reinforcement，variable-interval可变间隔的强化reinforcement，variable-ratio可变比率的强化程序reinforcement schedules强化程序relatedness need关系需要relaxation response放松反应reliability信度reorientation再定位repatriation归国人员research研究resilience弹性resistance to change对变革的抵制result-oriented approach to obｏｂ的结果导向方法retraining再培训reverse cultural shock逆向文化冲击reward power奖赏权力rights of privacy隐私权risky shift风险偏移role角色role ambiguity角色模糊role conflict角色冲突role models角色模型role perceptions角色知觉rumor谣言sabbatical leaves安息日假期sanctions奖惩制度secondary needs次级需要secondary outcomes次级产出selective perception选择性知觉self—actualization自我实现self-appraisal自我评价self-concept自我概念self—efficacy自我效能感self—fulfilling prophecy自我实现预期self—leadership自我领导self—managing teams自我管理团队self—perceived task ability自己知觉的工作能力self-serving bias自我服务偏差semantic barriers语义障碍semantics语义学sexual harassment性骚扰shaping塑造short—circuiting超近路short-term orientation短期取向single-loop learning单路学习situational leadership model情境领导模型skill—based pay技能工资skill variety技能多样化social cues社会线索social culture社会文化social desirability bias社会赞许性偏差social equilibrium社会均衡social facilitation群体敦促social information processing社会信息处理socialization社会化social leader社交领导social learning theory社会学习理论social loafing群体惰性social desirable responses社会赞许性反应social responsibility社会责任social support社会支持social system社会系统socioeconomic model of decision making决策的经济社会模型sociotechnical system ( sts）approach社会技术系统模型spillover effect溢出效应stages of team development组织发展的演变status地位status anxiety地位焦虑status deprivation地位丧失status symbols地位象征status system地位系统stress压力stressors压力源stress—performance model压力—绩效模型stress threshold压力阀stroking肯定structure结构substitutes for leadership领导的替代品suggestion programs建议计划super leadership超级领导superordinate goal超凡的目标supportive model支持模型surface agenda表面议题surveillance devices监视设施systems approach to obob的系统方法tardiness迟到task identity任务完整性task leader任务领导task significance任务的重要性task structure任务结构task support任务支持task team任务团队team building团队建设teamwork团队合作technical skill技术技能telecommuting电子通勤theft偷窃行为theories理论theory xｘ理论theory yｙ理论theory zｚ理论360-degree feedback３６０度反馈total quality management tqm全面质量管理training multiplier effect培训放大效应traits特质transactional analysis（ta）交互作用分析tran cultural employees跨文化员工transfer of training培训转换transformational leaders转换型领导者trauma创伤triple—reward system三方受益的系统trust信任tunnel vision管窥turnover离职率two-factor model of motivation双因素激励模型two-way communication process双向沟通过程type a people a型人type b people b型人uncertainty avoidance不确定性规避unconditional strokes无条件肯定under participation参与不足unfreezing解冻upward communication上行沟通valence效价validity效度value premises价值观假设valuing diversity重视多样化violence暴力行为virtual offices虚拟办公室vision远景wage incentives奖金刺激whistle—blowing内部员工揭发willingness to accept the influence of others接受他人影响的意愿win—win outcome of conflict冲突的双赢结果work change工作变革work ethic工作伦理workplace trauma工作场所创伤workplace violence工作场所的暴力行为xenophobia排外市场营销学absorption of costs 成本分配accessibility 可进入性accessory equipment markets 附属设备市场account management policies 客户管理策略acquisition new—product development strategy 新产品开发收购战略activity-based costing 以活动为基础的成本系统adaptability 适应性adaptation to market variations 适应市场变化adaptive positioning 适应性定位additions to existing product lines 现有产品线的增加adequate size 准确的大小/足够的规模administered vertical marketing systems 管理式垂直营销系统administrative relationships 管理关系adopter categories 采购者的类型adoption process 采购过程advertising and market segmentation 广告与市场细分advertising and sales promotion 广告和销售促进advertising effects 广告效果advertising ethics 广告伦理道德advertising feedback 广告反馈advertising frequency 广告频率advertising media 广告媒体advertising message 广告信息advertising reach 广告接受人数advertising source 广告信息来源advertising 广告aerobic enthusiasts 增氧健身运动爱好者aesthetics 美感affinity club 同族俱乐部after tests 事后测试agent middleman 代理商agent/merchant middleman 代理中间商allowance 折让alteration 退换AMA Code of Ethics 美国营销协会职业道德标准Amazon。

模联英文发言稿

模联英文发言稿【篇一：模拟联合国立场发言稿】立场发言稿谢谢主席。

thank you for the chair.尊敬的主席，尊敬的各国代表，下面我谨代表菲律宾政府陈述我国对待如何应对全球气候变化的建议。

honerable chair and dear delegate ,this is the representative of phillipine,here is my brief speech 近些年来全球气候异常，各国对于气候变化愈加关注。

在多国的努力下，达成了京都议定书等公约。

然而公约的执行并不如人意，应对气候变化仍是当前迫在眉睫的问题。

菲律宾作为一个负责任的国家，一直以来密切关注着气候变化问题，积极参与关于气候变化的各个国际会议，是京都议定书缔约国之一。

与此同时，在国内，菲律宾政府也积极推动低碳环保政策，并于2009年颁布了气候变化法。

during recent years, the world’s climate changes abnormally,every country pays more and more attention to climate changes.with efforts of many countries,kyoto protocal has been reached.however,the implementation is below expectation.dealing with climate changes staring us in the face.as a responsible country,philippine has been keeping an eye on climate changes and taking an active part in many meetings on climate changes.at the same time,we enact climate change law in 2009 and promote low-carbon enviromental friendly policy.关于应对全球气候变化，菲律宾有如下建议：about how to deal with global climate changes,philippine has following suggestions:1、建立双赢的技术推广机制和互利技术合作。

英语模联句型(3)

英语模联句型(3)模联英文词组以下是英文模拟联合国中常用句型和词汇，所有模板以UK为例1、表明自己国家立场的词汇（在陈述时使用）UKthinks/believes/realizes/affirms/claims/s tates/addresses/declares/notices/consider s/reminds/recalls/observes that….UK is aware of…UK bears in mind /keeps in mind2、表明自己国家意愿UK hopes/wishes /desires thatUK appeals to /expects to/devotes attention to/would like toUK accepts sth..UK encourages…3、强调自己国家立场UK reiterates/emphasizes/reaffirms/UK takes sth into account/ notes with deep concern/takes sth into consideration4、呼吁建议别国做某事UK calls upon/suggests/purposes/commends/recommend s/demands/requires/appeals thatUK urges to/calls for5、表达反对观点UK disapproves/赞同他国代表的话UK expresses its appreciation/ express its satisfaction /notes with approval/views with appreciationUK supports/endorses thatUK highly appreciates sth/ is delighted to/ is eager to,表达愤怒同情等感情UK strongly condemns/deplores/ deeply regret /feels deeply disturbed/ solemnly affirms thatUK expresses its deepest sympathy and condolences to常用副词（表示程度）Fully, further, deeply ,highly9、补充词汇frontier region, border region 边界地区boundary negotiation 边界谈判status quo of the boundary 边界现状never to attach any conditions 不附带任何条件non-aligned countries 不结盟国家consultations/negotiations 磋商the third world 第三世界imperialism 帝国主义developing countries 发展中国家dependency 附庸国generally-accepted principles of international relations 公认的国际关系原则joint action 共同行动normalization of relations 关系正常化an established principle of international law 国际法准则rudimentary code of international relations 国际关系中最起码的准则international waters 国际水域international situation 国际形势merger of states 国家合并national boundary 国界maritime resources 海洋资源mutual understanding and mutual accommodation 互谅互让exchange of needed goods 互通有无mitigate 缓和fundamental rights 基本权利reduction or cancellation of debts 减轻债务负担Near East 近东right of residence 居留权territorial sea 领海limits of territorial sea 领海范围breadth of territorial sea 领海宽度territorial air 领空territorial waters 领水refugee camp 难民营country of one's residence 侨居国people-to-people contacts and exchanges 人民之间的联系和交流sacred and inviolable 神圣不可侵犯practical, efficient, economical and convenient for use 实用，有效，廉价，方便bilateral and multilateral economic cooperation 双边和多边经济合作bilateral trade 双边贸易dual nationality 双重国籍sole legal government 唯一合法政府loans with no or low interest 无息和低息贷款extradition 引渡friendly exchanges 友好往来disputed areas 有争议的地区fishery resources 渔业资源political offender 政治犯political fugitive 政治逃犯Middle East, Mideast 中东neutral state, neutral country 中立国apartheid, racial segregation 种族隔离sovereign state 主权国家to maintain neutrality 保持中立to safeguard national sovereignty and national resources 保卫国家主权和民族资源to take concerted steps 采取协调行动to develop relations of peace and friendship, equality and mutual benefit, and prolonged stability 发展和平友好、平等互利、长期稳定的关系to develop the national economy 发展民族经济All countries, big or small, should be equal. 国家不分大小，应该一律平等to establish normal state relations 建立正常的国家关系to seek a fair and reasonable solution 求得公平合理的解决to make up for each other's deficiencies 取长补短to negotiate through diplomatic channels 通过外交途径进行谈判to safeguard national independence and the integrity of sovereignty 维护国家独立和主权完整to safeguard world peace 维护世界和平to solve disputes by peaceful means 用和平手段解决争端in consideration of the actual conditions 照顾现实情况有关工作文件的英文词组回顾性条款用语• Affirming, Reaffirming, Alarmed by;• Aware of, Bearing in mind, Fully aware;• Realizing, Recognizing, Taking into account;表达希望或遗憾的用语• Desiring, Expecting, Seeking, Welcoming • Noting with deep co ncern, Noting with regret• Fully believing, Believing, Viewing with appreciation• 表肯定与支持• Accepts, Affirms, Approves, Endorses, Reaffirms;• Confirms, Emphasizes, Supports, Trusts, Believes;• 表否定与遗憾• Deplores, Regrets, Condemns, Expresses its concern;• 表建议• Expresses its hope, Further invites, Encourages;• Suggests, Requests, Recommends, Calls, Urges.• 肯定：Affirms, Reaffirms, Confirms;• 强调：Emphasizes, Underlines;• 谴责：Condemns, Deplores, Regrets;• 赞赏：Endorses, Expresses its appreciation;• 建议：Suggests, Calls upon/for, Recommends;• 决定：Decides, Demands, Requests, Urges; • 程度词：Further, Fully, Strongly, Deeply.关于发言顺序到你了，主席会说类似：“XXX国代表，您有3分钟时间阐述贵国立场。

大连海事大学老题库翻译第6章

第六章（1733---1911）1733 Your ship is solely to the damage to my crane.A. To.B.C. Of.D. On.对于起重机的损坏，你船完全。

1734 Your kind attention to the above will be much ______.A. Appreciate.B.C. Appreciating.D. Being appreciated. 你对上述的友好关注将被（给予）很多的。

（非常感谢你对上述事情的关注）1735 Your kind attention to our ship will be ______.A. B. Much appreciating. C. Many appreciated. D. Many appreciating. 你对我船的友好关注将被（给予）Much可修饰动词，而Many不能修饰动词；Be much appreciated非常感谢1736 You should not the fresh water ______ three trips.A. In.B.C. To.D. For.你不应淡水三个航次。

xxh1737 You shall ______ this letter so as to signify your acknowledgement of the responsibility.A. Make out.B. Submit.C. Produce.D.你应这个信件以便表示你责任的确认。

1738 You must ______ in this area unless you have messages about the casualty.A. Keep radio silence.B.C. Keep radio be silent.D. Keep silent the radio.你必须直到你收到有关伤亡的信息。

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

Formal Model of Joint Maintenance Intention*Mao Xinjun1 , Wang Huaiming1 , Wu Gang1 , Zhao Jianming21 National Lab. for Parallel and Distributed Processing, LiChen Road 300, Changsha, Hunan,410073 Chinaxjmao21@2 School of Computer Science, Zhejiang Normal University, Jinghua, Zhejiang, 321004 Chinaznuzjm@Abstract. Agent-oriented technique represents an exciting new means todevelop complex software system. The paper presents a novel abstract conceptof joint maintenance intention to represent joint constraints of social behaviorsin multi-agent system. The joint maintenance intention’s meaning andcharacteristics are discussed, the formal and rigorous semantics is defined, andsome important properties are specified and proved. The abstract concept modeland its theoretical results can effectively be used to specify, validate and refinemulti-agent system.Key words: multi-agent system, joint maintenance intention, belief1. IntroductionAgent is an encapsulated computational entity that is situated in some environment, and capable of flexible, autonomous actions in order to meet design objectives [11]. Multi-agent system is composed of a number of interacting and cooperating agents, each of them having limited capabilities and resources. As the abstract model that agent techniques provide can express the computational entities and problem-solving manner in applications more naturally and effectively, many attentions have been imposed on the researches of agent techniques nowadays.In multi-agent system, as the dependencies among agents’ actions, the limitation of each agent’s capabilities, and the distribution of system’s resources, the joint work among agents are absolutely necessary to meet global constraints and natural problem solving. The joint work among agents represents the social behavior, which is accomplished by a number of agents cooperatively. In order to develop the multi-agent system, we must put forward some effective tools to specify and analyze such social behaviors, for instance, what is the social behaviors among agents, how will it*The research is supported by natural science foundation of china with granted no: 60003002 and 60103009, national 973 project G1999032700, and zhejiang natural science foundation with granted no ZD0108.affect related agent’s actions, how is it related with agent’s internal state such as belief and intention, etc.In the area of artificial intelligence, agent is taken as an intentional system with such cognitive components as belief, goal, intention, etc. The representative research is the BDI agent architecture, in which agent is composed of three cognitive components as belief, desire, and intention. However, the agent’s internal cognitive components only define individual behaviors and, as such, are an insufficiently rich base on which to build a principled representation of social behaviors. There are two main limitations with the individualistic approach. Firstly, joint action is more than just the sum of individual action, even if the action happens to be coordinated. For example, it will be somewhat unrealistic to claim that there is any real teamwork involved in ordinary automobile traffic, even though the drivers act simultaneously and are coordinated by traffic signs. Secondly, there is a fundamental difference between individuals and groups [10]. Therefore, some new abstract concept model is needed to describe and examine the joint social behaviors in multi-agent system.Joint intention is an important abstract concept in distributed artificial intelligence to examine the social behaviors among agents in multi-agent system. It exhibits the common task and goal that multi-agent intend to jointly achieve [2,3,4,10]. In multi-agent system, the purposes of joint social behaviors among agents are not only to achieve some collective tasks, but also to maintain the system condition. For instance, there are two robot agents in some environment, which are assigned the task to move objects from one place to another place cooperatively. In order to meet the system constraints, some restriction that the object must be moved horizontally and stably are imposed on the joint social behaviors of the two agents. Obviously, such a restriction will affect the action choice of the related agent in the process of the coordination. However, the traditional meaning and theory of joint intention concept cannot represent and analyze such system constraints, which widely exist in multi-agent system.There are many researchers investigating joint intention in the area of computer science and philosophy. The representative work is Cohen and Levesque’s research [2], which introduces joint intention concept to handle cooperative intentions. Joint intentions are intended to clarify the relationships among beliefs, desires and intentions for multiple agents. Other researches include Nunes, Raimo and Jennings’s work [3,4,8,9,10]. Some of them extend Cohen and Levesque’s theory; others investigate the joint intention from the point of philosophy. However, all of these researches do not deal with the joint maintenance problems.For the purpose of effectively specifying the social behavior constraints, investigating the cooperation among agents in multi-agent system, we introduce a new and novel concept of joint maintenance intention. Different from the joint intention concept, the joint maintenance intention is to maintain and keep some condition and state of the system during the coordination process.The paper is structured as follows. Section 2 informally discusses the meaning and characteristics of joint maintenance intention. Section 3 introduces the logical framework of multi-agent system. In section 4, we will define the formal and rigorous semantics of joint maintenance intention, specify and prove a number of important and essential properties. Section 5 gives a sample and demonstrates how to apply theapproach and theoretical results in practice. The final section concludes the paper, and outlines directions for future and further research.2. Characteristics of Joint Maintenance IntentionThe joint maintenance intention of agents’ means that agents will work together to maintain some preposition by joint behaviors and represents the system constraints in the process of cooperation. Intuitively, the joint maintenance intention has the following properties. These properties are essential when examining the abstract concept model of joint maintenance intention, necessary to investigate the agents’social behaviors and important to specify, validate and refine multi-agent system.−Joint action choice, which exhibits some rational choice for future joint behaviors and will restrict the agents’ actions.−Relativity, including mutual belief and cooperation during the process of joint social behaviors.−Satisfiable, which means that the joint maintenance intention of agents is maintainable.−Persistent, which means agents will not abandon their joint maintenance intention in the process of joint social behaviors, and exhibits some commitment to joint social behaviors.−Consistent, which means that it is consistent among several joint maintenance intentions, and agents’ joint maintenance intention should be consistent with individual agent’s internal state.−Non-conflict, which means that there are no conflicts among several joint maintenance intentions of agents.−Consistent with belief, which means that agents’ joint maintenance intention should be consistent with agents’ belief. If agents have some joint maintenance intention, then they should believe that the joint maintenance intention should be maintainable.3. Logical FrameworkThe semantics definition of joint intention is based on logical framework of multi-agent system, which includes three parts: syntax, model and semantics. The formal language L is a branch temporal logic extended based on works in [5,6,7], which is composed of two parts: state formulas set L t and path formulas set L s. Let Φ is the atomic proposition symbol set, Const ag agent symbol set. To simplify description, the paper has the following symbol convention: p, q,… as proposition symbol, and ϕ, ψ,… as formula, and x, y, … as agent symbol.n Definition 3.1 (Syntax of Language L)The formal language L is the smallest closed set defined by the following rules −if p∈Φ, then p∈L t−if ψ, ϕ∈L t and x, y∈Const ag, then ¬ϕ, ψ∧ϕ, Bel(x, ϕ), MB(x, y, ϕ),AI(x,y,ϕ), MI(x, y, ϕ), MMI(x, y, ϕ), MMB(x, y, ϕ) , WMC(x, y, ϕ) ,MMC(x, y, ϕ), JMI (x, y, ϕ) ∈L t−L t⊆ L s−if ψ, ϕ∈L s , x∈Const ag, then ¬ϕ, ψ∧ϕ, ψUntil ϕ, ψUntil∀ϕ∈L s−if ϕ∈L s, then Aϕ∈L tThe formal model of language L is a structure M = < T, <, U ag, π, [], B, C >, where T is moment set, each member of which representing a world state. < is a partial order on T, which describes the temporal order among m oments. The past of each moment is deterministic and linear, and it’s future may be branching. Fig.1 gives a schematic description of formal model that is a tree-like structure. U ag is an agent set. π: Φ→℘(T) defines the moment set at which atomic proposition symbol is satisfied. [] defines the assignment to agent symbol. B: U ag →℘(T×T), (t, t′)∈B(x) means that at moment t agent believes that moment t′ is possible and is used to define agent’s belief. C:U ag×T→℘(SΣ) defines the choice of agent, where C(x, t) is the path set that agent chooses at moment t and C(x,t)⊆S t (SΣand S t defined as follows). To simplify, there is a model constraint: ∀t∈T, x∈U ag: C(x, t) ≠∅ .A path at moment t describing some way that the world may evolve is a branch that evolves from t and is composed of future moments of t.n Definition 3.2 (path) A path of moment t is a set S ⊆ T which satisfies:(1)t∈S;(2)∀t1, t2∈S:(t1<t2) ∨ (t2<t1) ∨ (t1= t2);(3)∀t1, t2∈S; t3∈T:(t1<t3<t2) ⇒ (t3∈S);(4)∀t1∈S; t2∈T:(t1< t2) ⇒ (∃t3∈S:(t1<t3) ∧¬ (t3 < t2));(5)∀t1∈S : (t = t1) ∨ (t < t1)(1) denotes that the path of moment t contains t; (2) describes the linearity property of the path; (3) describes the density property; (4) describes the relative maximum;(5) denotes the initiate of the path . Let S t the set of all paths at moment t, SΣ the set of all paths.In multi-agent system, each agent takes actions concurrently and asynchronously. At any moment, agent can take action to influence and control the ways that the world evolves. However, such an influence is limited, because the ways that the world may evolve are also influenced and controlled by the environment events and the actions that other agents take. All of the actions taken by agents in multi-agent system and the environment events together determine the evolution ways of the world.For example, Fig.1 describes a formal model of a multi-agent system composed of two agents. The node in the figure denotes moment represented by a set of propositions. The edge denotes the combination of actions taken by all agents. The symbol “||” denotes that the actions of several agents are taken concurrently. In order to simplify description, we assume that the action symbol on the left part of “||”represents the action of agent1 and the right part represents the action of agent2. At moment t0 agent1 can take action a to make the world evolve to the moment t1 or t2, or take action b to make the world evolve to the moment t3 or t4. But when agent1 take action a, whether the world evolves toward moment t1 or moment t2 is also depended on the action taken by agent2. When agent2 takes action c, then the world evolves tomoment t1Fig. 1.represent moments, and the edges represent agents’ actions.The satisfactory semantics of the formula in L t is defined by model M and moment t. M |=t ϕ denotes that formula ϕ is satisfied at the moment t in model M. The satisfactory semantics of the form ula in L s is defined by model M, path S and moment t. M |=s,tψ denotes that formula ψ is satisfied at moment t on S of model M.n Definition 3.3 (Semantics of L)−M |=t p iff t∈π (p)−M |=tψ∧ϕ iff M |=tψ and M |=t ϕ−M |=t¬ϕ iff M |≠tϕ−M |=t Aϕ iff ∀S: S∈S t⇒ M|=s,t ϕ−M |=t Bel(x, ϕ) iff ∀t′: (t, t′)∈B([x]) ⇒ M |=t′ϕ−M |=s,tψ∧ϕ iff M |=s,t ψ?M |=s,tϕ−M |=s,t¬ϕ iff M |≠s,t ϕ−M |=s,tψUntilϕ iff ∃t′∈S:(t ≤ t′) and (M |=s,t′ϕ) and (∀t′′: t ≤ t′′ < t′⇒M |=s,t′′ψ)−M|=s, t ψUntil∀ϕ iff ∀t′∈S: (∀t′′: t ≤ t′′≤ t′⇒ M |=s, t′′¬ϕ) ⇒ M |=s, t′ψ−M |=s,tϕ iff M |=tϕ , where ϕ∈L t.−M |=t MB(x, y, ϕ) iff M |=t Bel(x, ϕ) and M |=t Bel(y, ϕ)Other operators can be derived based on the above semantics definition. Until is a “until” operator, Until∀ is a weak “until” operator. Fϕ = true Untilϕ is an existential temporal operator. G is the dual of F and is a universal temporal operator. A is a universal path operator, Aϕ is satisfied at moment t if and only if ϕ is satisfied on all paths of moment t. E is the dual of A, that is Eϕ = ¬A(¬ϕ), therefore E is an existential path operator. Bel(x, ϕ) denotes that agent x has belief ϕ. Here, we assume that B(x) is reflexive and transitive. Therefore Bel corresponds to the modal operator in S4 normal modal system.n Theorem 3.1 Bel has the following properties:−|=Bel(x, ϕ) →ϕ−|=Bel(x,ϕ) →Bel(x, Bel(x,ϕ))−|=Bel(x, ϕ) ∧Bel(x, ϕ→ψ) → Bel(x, ψ)−if |=ϕ, then |=Bel(x, ϕ)4. Formal Model of Joint Maintenance IntentionWe will extend the intention theory in [5,1] to establish the novel formal model of joint maintenance intention in multi-agent system, investigate the relationship between joint maintenance intention with the belief and intention of individual agents.4.1. Definition of Basic ConceptThe achievement intention of individual agent means that agent intends to achieve some preposition, which is the abstract representation of agent’s task and goal. The formal model of multi-agent system is a tree-like structure, each branch at any moment denoting the possible choice that agent may select. The achievement intention ϕ of agent means that agent selects the world evolving paths, on each of which agent believes that ϕ will be satisfied eventually.n Definition 4.1.1 (Achievement Intention)M|=t AI(x, ϕ) iff M|=t Bel(x, ¬ϕ) and (∀S: S∈C(x, t) ⇒ M |=s,t FBel(x, ϕ)) The above semantics defines the basic characteristic of achievement intention, i.e., action choice. Different from existing methods, we define achievement intention as the choice of the world evolving paths, not the accessible relationship between possible worlds. In the formal model, the world-evolving path is related to agent’s action. Such a definition not only clearly describes the choice characteristic of achievement intention and how agent’s intention will restrict agent’s future behaviors, but also can help us to define the semantics of maintenance intention.The maintenance intention of agent means that agent intends to maintain some proposition. It is the abstract representation of the system constraints in the process of social behaviors that widely exist in multi-agent system.n Definition 4.1.2 (Maintenance Intention)M |=t MI(x, ϕ) iff (∀S: S∈C(x, t) ⇒ M |=s,t GBel(x, ϕ))4.2. Joint Maintenance IntentionThe precondition of agent x and agent y having joint maintenance intention ϕ is that they have the common choice, on which ϕ is maintained.n Definition 4.2.1 (Common Maintenance Choice)MMI(x, y, ϕ) = MI(x, ϕ) ∧MI(y, ϕ)Common choice of agents does not mean that they have the joint maintenance intention. In order to form joint maintenance intention, they must have relativity characteristics, viz. mutual belief maintenance intention and mutual cooperation.n Definition 4.2.2 (Mutual Maintenance Belief)MMB(x, y, ϕ) = MB(x, y, MI(x, ϕ) ∧MI(y, ϕ))In order to define the semantics of joint maintenance intention, we firstly introduce and define the semantics of weak maintenance cooperation.n Definition 4.2.3 (Weak Maintenance Cooperation)WMC(x, y, ϕ) = (Bel(x, ¬ϕ)∧¬Bel(x, Bel (y, ¬ϕ))àAI(x, MB(x, y, ¬ϕ))) ∧(Bel(x, AF¬ϕ)∧¬Bel(x, Bel(y, AF¬ϕ))àAI(x, MB(x, y, AF¬ϕ)))AF¬ϕ means that ¬ϕ will be satisfied on all paths. WMC(x, y, ϕ) denotes that agent x have weak maintenance cooperation with agent y with regard to ϕ. It is satisfied, if and only if, when agent x knows that ϕ is not satisfied and does not know that agent y knows ϕ is not satisfied, then agent x intend to let two sides mutual know ϕ is not satisfied, and when agent x knows that ¬ϕ will be satisfied and does not know that agent y knows ¬ϕ will be satisfied, then agent x intend to let two sides mutual know ¬ϕwill be satisfied. Based on the weak maintenance cooperation, the semantics of mutual maintenance cooperation is defined as follows.n Definition 4.2.4 (Mutual Maintenance Cooperation)M |=t MMC(x, y, ϕ) iff (∀S: S∈C(x,t) ⇒ M |=s,t (MB(x, y, WMC(x, y, ϕ) ∧WMC(y, x, ϕ))) Until ¬MI(x, ϕ)) and (∀S: S∈C(y,t) ⇒M|=s,t(MB(x, y, WMC(x, y, ϕ) ∧WMC(y, x, ϕ))) Until ¬MI(y, ϕ))MMC(x, y, ϕ) denotes that agent x and agent y have mutual maintenance cooperation with regard to ϕ. MMC(x, y, ϕ) is satisfied, if and only if, the both sides mutual know that they will cooperate with each other until they drop their maintenance intention.n Definition 4.2.5 (Joint Maintenance Intention)JMI(x, y, ϕ) = MMI(x, y, ϕ) ∧MMB(x, y, ϕ) ∧MMC(x, y, ϕ)The above definition shows that agent x and agent y have joint maintenance intention ϕ, if and only if, they have common choice on which ϕ will be maintained, and they mutually believe that they have the common choice, and they know they will cooperate with each other during the process of maintaining joint intention. According to the semantics definition, a number of important properties of joint maintenance intention can be specified and proved.According to the above semantics definition, we can obtain and prove a number of important properties of joint maintenance intention, enumerated in section 2.n Theorem 4.2.1 |= JMI(x, y, ϕ) →MB(x, y, ϕ)The theorem shows the condition that agents will accept or drop joint maintenance intention. agent x and agent y have joint maintenance intention ϕ, only if, they mutually believe that ϕ holds. The theorem can be proved according to definition of JMI, MMB and MI.n Theorem 4.2.2 (self-consistent)|=¬ (JMI(x, y, ϕ) ∧JMI(x, y, ¬ϕ))The theorem shows that at any moment agents cannot have joint maintenance intention ϕ and ¬ϕ at the same time. The theorem can be proved by theorem 4.2.1and theorem 3.1.n Theorem 4.2.3 (consistent with maintenance intention)|=¬ (JMI(x, y, ϕ) ∧ (MI(x, ¬ϕ)∨ MI(y, ¬ϕ)))The theorem shows that agent’s joint maintenance intention is consistent with its internal maintenance intention. It can be proved according to theorem 4.2.1 and theorem 3.1, together with semantics definition of MI.n Theorem 4.2.4 (satisfiable)|=JMI(x, y, ϕ) →MB(x, y, EGϕ)EGϕ means that there exists a path on which ϕ is always satisfied. Agent’s joint maintenance intention should be satisfiable, or in other words, maintainable. If agent x and agent y have joint maintenance intention ϕ, then agent x and agent y should mutually believe that ϕ is maintainable. The theorem can be proved according to semantics definition of JMI, MMB, MI, and the model constraint: ∀t∈T, x∈U ag: C(x, t) ≠∅ in section 3.n Theorem 4.2.5 (consistent with belief)|=¬ (JMI(x, y, ϕ)∧ (Bel(x,¬EGϕ) ∨Bel(y, ¬EGϕ)) )¬EGϕ means that there is no path on which ϕ will always be satisfied. The above theorem denotes that agent’s joint maintenance intention should be consistent with individual agent’s belief. It is impossible for agent that it has joint maintenance intention and at the same time believes that ϕ is not maintainable. The theorem can be proved by theorem 4.2.4 and theorem 3.1.n Theorem 4.2.6 (non-conflict)|=JMI(x, y, ϕ) ∧JMI(x, y, ψ) →EG(ϕ∧ψ)The theorem describes that if agent x and agent y have the joint maintenance intention ϕ and ψ, then there exist a path on which ϕ and ψ always hold. The theorem can be proved according to the semantics of JMI, MMB, MI, and theorem 3.1.n Theorem 4.2.7 (Consistent with achievement intention)|=¬ (JMI(x, y, ϕ) ∧ (AI(x, ¬ϕ)∨ AI(y, ¬ϕ)))The theorem shows that agent’s joint maintenance intention is consistent with its internal achievement intention. It can be proved according to theorem 3.1, together with semantics definition of JMI and AI.n Axiom 4.2.1 (Persistent)A(JMI(x, y, ϕ) →JMI(x, y, ϕ) Until∀ (MB(x, y, ¬ϕ) ∨MB(x, y, ¬EGϕ)) ) The axiom shows that if agent x and agent y have joint maintenance intention ϕ, then they will hold the joint maintenance intention until they mutual believe that ¬ϕalready holds or ¬ϕ will be satisfied. In order to make the axiom sound, constraint is imposed on the formal model:∀t∈T; S∈ SΣ; x,y∈U ag: M|=t JMI(x, y, ϕ) ⇒(∀t′∈S : (∀t′′: t ≤ t′′≤ t′⇒ M|=t′′¬( MB(x, y, ¬ϕ) ∨MB(x, y, ¬EGϕ)) ) ⇒M |=t′JMI(x, y, ϕ))5. Application: A Case AnalysisThe theorem framework of joint maintenance intention can effectively support analysis, specification and design of multi-agent system, especially investigation of social behaviors. The contribution given in the paper can be used to specify the high-level cooperation constraints in multi-agent system, validate their consistency with individual agent’s internal state, and furthermore refine the specification to obtain the agents’ low-level cognitive component description. For example, two robot agents are assigned task to move object from one place to another place, and at the same time some restrictions are imposed on the cooperative agents, i.e., they must move theobject horizontally and stably in the process of cooperation. Obviously, such restrictions describe the system requirement, and will restrict the system’s further design and implementation.Fortunately, such a requirement can be specified formally and rigorously according to joint maintenance model as JMI(x, y, ϕ), where ϕ representing that object is stable and horizontal. Furthermore, the theoretical results can be used to validate the consistency among a number of system specifications and find the problems in the system analysis and descriptions. If agent x has some achievement intention as AI(x,¬ϕ) in the process of cooperation with agent y to move object horizontally and stably, then the two specifications are inconsistent and conflict according to theorem 4.2.7. The related agents’ internal cognitive specification can be further refined according the system requirement specification and the formal model, e.g., according to semantics definitions and theoretical results theorem1-7. If agent x and agent y have the joint the maintenance intention JMI(x, y, ϕ), then the related agents should have maintenance intention ϕ, i.e., MI(x, ϕ) and MI(y, ϕ).6. ConclusionThe paper explains the significance and importance of making research on the joint maintenance intention, analyzes and discusses the meaning and characteristics of joint maintenance intention. Different from joint intention, the joint maintenance intention is the abstract representation of system constraints during coordination process in multi-agent system. Based on the logical framework of multi-agent system, the semantics of joint maintenance intention is defined, a number of important properties are specified and proved. Different from existing work, the semantics definition of joint maintenance intention is not based on the possible world accessible relation, but on the choice of world evolving paths in the formal model. We don’t incorporate the modification strategy of joint maintenance intention into its semantics definition. Such a semantics definition clearly captures and describes the basic and essential characteristics of joint maintenance intention. The further work includes to execution model of agent incorporated with joint maintenance intention, specify and validate the interaction behaviors and cooperation model based on the theorem framework. Reference1.P.R.Cohen, H.J.Levesque.Intention is choice with commitment. Artificial Intelligence,42(2-3)(1990) 213~261.2.P.R.Cohen and H.J.Levesque. Teamwork. Nous, 21(1991).3.Raimo Tuomela. Collective and joint intention. Proceeding of cognitive theory of socialaction(1998).4.Raimo Tuomela. Philosophy and distributed artificial intelligence: The case of jointintention. Foundation of distributed artificial intelligence, John Wiley&Sons(1996) 487~504.5.Mao Xinjun, Wang Huaiming. The intention theory of agent computing in multi-agentsystem, Journal of software, 10(1)(1999)43~48.6.Singh M P. Multiagent System: A Theoretical framework for Intentions, Know-how, andCommunications. Berlin, Heidelberg: Springer-Verlag(1994).7. B.Chellas. Modal logic: an introduction. Cambridge University Press, Cambridge,MA(1980).8. B. Dunin-Keplicz and R.Verbrugge. Collective Commitment. In Proceeding of thesecond international conference on multi-agent system, Menlo Park,CA(1996).9.Panzarasa, P and N.R.Jennings. Social mental shaping: Modelling the impact of socialityon the mental state of autonomous agents. Computational Intelligence(2001).10.N.R.Jennings. Specification and implementation of belief-desire-joint intentionarchitecture for collaborative problem solving. Journal of Intelligent and Cooperative Information Systems, 2(3)(1993)289~318.11.N.R.Jennings. Building complex software system: the case for an agent-based approach.Communication of ACM(2001).。