Small Sample Properties of Nonparametric Bootstrap t Confidence Intervals

合集下载

ROC曲线下面积估计的参数法与非参数法的应用研究_宋花玲

ROC曲线下面积估计的参数法与非参数法的应用研究_宋花玲

726第二军医大学学报Acad J Sec M il M ed U niv2006Jul;27(7)专题报道ROC 曲线下面积估计的参数法与非参数法的应用研究宋花玲1,贺 佳2*,黄品贤1,李素云3(1.上海中医药大学预防教研室,上海201203;2.第二军医大学卫生勤务学系卫生统计学教研室,上海200433;3.上海中医药大学病理学教研室,上海201203)[摘要]目的:阐明ROC 曲线下面积估计的参数法和非参数法并进行比较,为其在诊断试验评价中的应用提供依据。

方法:用双正态模型的参数法和M annW itney 统计量的非参数法估计ROC 曲线下面积,并以其在肺癌诊断试验准确度评价中的应用来具体说明。

结果:非参数法估计的肺癌两个标志物Cyfr a21 1和CEA 的ROC 曲线下面积分别为0.77、0.87,参数法估计的面积分别为0.78、0.87,表明在样本量较大时参数法和非参数法估计的R OC 曲线下面积近似相等。

结论:样本量较小时可选择非参数法估计RO C 曲线下面积,样本量较大时可根据实际情况选择参数法或非参数法。

[关键词] ROC 曲线下面积;参数法;非参数法[中图分类号] R 195.1 [文献标识码] A [文章编号] 0258 879X(2006)07 0726 03Application of parametric method and non parametric method in estimation of area under ROC curveSO N G H ua ling 1,HE Jia 2*,HU AN G Pin x ian 1,LI Su y un 3(1.Department of P reventiv e M edicine,Shang hai U niv ersity of T raditional Chinese M edicine,Shanghai 201203,China; 2.Depar tment o f H ealth Statistics,F aculty of H ealth Ser vices,Second M ilitar y M edical U niv ersity ,Shang hai 200433; 3.Department o f Pat ho lo gy ,Shanghai U niversity of T raditio na l Chinese M edi cine,Shanghai 201203)[ABSTRACT] Objective:T o elucidate and co mpar e the par amet ric method and non parametr ic met ho d in estimatio n o f t he area under RO C curv e,so as to pr ovide a basis fo r their applicatio n in diag no sis assessment.Methods:T he ar eas under RO C curv es wer e estimated by parametr ic method of fitting binomial mo del and by non par ametric method of M ann W itney statist ics.T he met ho d w as employed in the diag nostic tests of lung cancer.Results:By non par ametric methods,the areas under ROC curv es of Cyfr a21 1and CEA wer e respectiv ely 0.77and 0.87in the lung cancer diag no st ic tests;by par ametric metho ds,they w ere 0.78and 0.87,respect ively.It was indicated that w hen the sample size was larg e,the v alues o f a reas under R OC Cur ves w ere similar between par ametric method and non parametr ic metho d.C onclusion:No n paramet ric method sho uld be used to evaluate the ar ea under RO C curv e if the sample size is small,and for larg e sample size,the par ametric method o r no nparametr ic met ho d should be cho sen according to the actual situation.[KEY WORDS] ar ea under RO C curv e;parametr ic metho d;no n par amet ric method[A cad J Sec M il M ed U niv,2006,27(7):726 728][作者简介] 宋花玲,讲师,硕士.*Corres ponding author.E mail:h ejia@一项新的诊断试验的诊断性能如何,它能否替代旧的诊断试验,这在很大程度上依赖于新的诊断试验的准确度大小。

SAE USCAR 中英对照版

SAE USCAR 中英对照版
1.1 壓接參數 1.1.1 壓接連線性能的特點是: 機械性能是量測端子到插頭的拉出力。 電氣性能測量通過端子到導體壓接電阻。 1.1.2導體壓接幾何形狀的特點是: 導體壓接高度 (CCH) 導體壓接寬度 (CCW) 絕緣壓接高度 (ICH) 絕緣壓接寬度 (ICW) 斷端導體的結束絕緣喇叭口(呈喇叭形展開) 毛邊 (鐵屑) 尺寸導體壓接的步 驟中的核心與絕緣工具壓接工具幾何的基礎上
6.此規範中包括的過程是覆蓋性能測試及發展的電子端子壓接在低電壓(0-48 VDC) 道路車輛應用的電子連接系統在環境溫度最大125 °C下。 OEM 客戶必須 被批准使用這些測試於電壓及溫度超出這些限制的過程。 7.這些過程只適用於在端子使用在同軸、座、 邊緣板,和設備插頭系統。
1.1 Crimping Parameters 1.1.1 The Crimp connection performance is characterized by: Mechanical performance is measured by terminal to conductor Pull-Out Force. Electrical performance is measured by terminal-to-conductor Crimp Resistance. 1.1.2 The geometry of a conductor crimp is characterized by: Conductor crimp height (CCH) Conductor crimp width (CCW) Insulation crimp height (ICH) Insulation crimp width (ICW) Cut-off End of conductor End of insulation Bell mouth (flare) Burr (anvil flash) dimension on the base of the conductor crimp Step between the core and insulation tools Crimp tooling geometry

Draft Guidance for Industry and Food and Drug Administration Staff

Draft Guidance for Industry and Food and Drug Administration Staff

Draft Guidance for Industry and 1 Food and Drug Administration2 Staff3 45 eCopy Program for Medical Device6 Submissions78 DRAFT GUIDANCE910 This guidance document is being distributed for comment purposes only.11 Document issued on: [use release date of FR Notice]1213 You should submit comments and suggestions regarding this draft document within 30 days of 14 publication in the Federal Register of the notice announcing the availability of the draft guidance. 15 Submit written comments to the Division of Dockets Management (HFA-305), Food and Drug 16 Administration, 5630 Fishers Lane, rm. 1061, Rockville, MD 20852. Submit electronic17 comments to . Identify all comments with the docket number listed in 18 the notice of availability that publishes in the Federal Register . 1920 For questions regarding this document, contact the Premarket Notification (510(k)) Section or 21 the Premarket Approval Section of CDRH at 301-796-5640 or CBER’s Office of 22 Communication, Outreach and Development at 1-800-835-4709 or 301-827-1800. 23 2425262728U.S. Department of Health and Human Services 29 Food and Drug Administration 30 Center for Devices and Radiological Health 31 Center for Biologics Evaluation and Research32Preface3334Additional Copies3536Additional copies are available from the Internet. You may also send an e-mail request to37dsmica@ to receive an electronic copy of the guidance or send a fax request to 301-38827-8149 to receive a hard copy. Please use the document number (1797) to identify the39guidance you are requesting.4041Additional copies of this guidance document are also available from the Center for Biologics42Evaluation and Research (CBER), Office of Communication, Training and Manufacturers43Assistance (HFM-40), 1401 Rockville Pike, Suite 200N, Rockville, MD 20852-1448, or by44calling 1-800-835-4709 or 301-827-1800, or from the Internet at45/BiologicsBloodVaccines/GuidanceComplianceRegulatoryInformation/defau 46lt.htm.4748Table of Contents491.Introduction (1)502.What is an eCopy? (2)513.Are differences between the contents of an eCopy and paper submission acceptable? 2 524.For what submission types would an eCopy be required? (3)535.What submission types would FDA consider exempt from submission of an eCopy? .4 546.What submission types or applicants should be eligible for an eCopy waiver? (4)557.How many copies of a submission would be needed? (4)568.What are the processing steps for an eCopy? (5)57a. What are the standards for an eCopy? (5)58b. How do I know if my eCopy meets FDA’s standards for acceptance?? (6)59c. What if there is another processing party involved? (6)60d. How do you submit an eCopy to FDA? (6)61e. How does FDA process an eCopy? (7)629.What if your device is regulated by CBER? (7)63a. Will the new eCopy Program apply? (7)64b. Can you submit an electronic submission instead? (7)65c. How do you prepare and submit an electronic submission to CBER? (8)66Attachment 1 –Standards for eCopies (7)67A. Cover Letter that accompanies an eCopy (10)68B. Volume versus non-volume structure (11)69C. Folder naming convention for volume-based submissions that house PDF files (13)70D. Adobe Acrobat PDF file format (14)71E. Non-PDF file formats (15)72F. PDF file naming convention (16)73G. PDF file size limit (17)74H. Creating a PDF version from the source document (17)75I. Bookmarks and hypertext links within PDFs (20)76J. PDFs created from scanning paper documents (21)77K. Common mistakes in creating an eCopy (22)7879Guidance for Industry and Food and Drug 80Administration Staff8182eCopy Program for Medical Device83Submissions84851.Introduction86The purpose of this guidance is to explain the new electronic copy (eCopy) Program for medical 87device submissions. At this time, submission of an eCopy of a medical device submission is88voluntary. However, section 745A(b) of the Federal Food, Drug, and Cosmetic Act (FD&C89Act), added by section 1136 of the Food and Drug Administration Safety and Innovation Act90(FDASIA) (Pub. L. 112-144), requires the submission of eCopies after this guidance is finalized.91This draft guidance describes how the Food and Drug Administration (FDA) plans to implement 92the eCopy Program under section 745A(b) of the FD&C Act. The inclusion of an eCopy is93expected to improve the efficiency of the review process by allowing for the immediate94availability of an electronic version for review rather than relying solely on the paper version.9596This draft guidance provides, among other things, the standards for a valid eCopy under section 97745A(b)(2)(A) of the FD&C Act. In accordance with section 745A(b), following the issuance of98a final guidance on this topic, submission types identified in the final guidance must include an99eCopy in accordance with the standards provided by this guidance for the submission to be100processed and accepted for review by FDA. Submissions submitted without an eCopy and101eCopy submissions that do not meet the standards provided in this guidance will be placed on 102hold until a valid eCopy is submitted to FDA and verified to meet the standards, unless a waiver 103or exemption has been granted. While the submission is on hold, the review clock will not104begin.105106In Section 745A(b), Congress granted explicit statutory authorization to FDA to implement the 107statutory eCopy requirement by providing standards, criteria for waivers, and exemptions in108guidance. Accordingly, to the extent that this document provides such requirements under109section 745A(b) of the FD&C Act (i.e., standards, criteria for waivers, and exemptions),110indicated by the use of the words must or required,this document is not subject to the usual111restrictions in FDA’s good guidance practice (GGP) regulations, such as the requirement that 112guidances not establish legally enforceable responsibilities. See 21 CFR 10.115(d).113114However, this document also provides guidance on FDA’s interpretation of the statutory eCopy 115requirement and the Agency’s current thinking on the best means for implementing other aspects 116of the eCopy program. Therefore, to the extent that this document includes provisions that are 117not “standards,” “criteria for waivers,” or “exemptions” under section 745A(b)(2), this document 118does not create or confer any rights for or on any person and does not operate to bind FDA or the 119public, but will represent the Agency’s current thinking on this topic when finalized. The use of 120the word should in such parts of this guidance means that something is suggested or121recommended, but not required. You can use an alternative approach if the approach satisfies 122Draft – Not for Implementationthe requirements of the applicable statutes and regulations. If you want to discuss an alternative 123approach, contact the FDA staff responsible for implementing this guidance. If you cannot124identify the appropriate FDA staff, call the appropriate number listed on the title page of this125guidance.126127To comply with the GGP regulations and make sure that regulated entities and the public128understand that guidance documents are nonbinding, FDA guidances ordinarily contain standard 129language explaining that guidances should be viewed only as recommendations unless specific 130regulatory or statutory requirements are cited. FDA is not including this standard language in 131this draft guidance because it is not an accurate description of all of the effects of this guidance, 132when finalized. This guidance, when finalized, will contain both binding and nonbinding133provisions. Insofar as this guidance, when finalized, provides “standards,” “criteria for waivers,” 134and “exemptions” pursuant to section 745A(b) of the FD&C Act, it will have binding effect. For 135these reasons, FDA is not including the standard guidance language in this draft guidance.136137The eCopy Program is not intended to impact (reduce or increase) the type or amount of data the 138applicant1 includes in a submission to support clearance or approval. Please refer to other FDA 139device or program-specific guidance documents from CDRH140(/MedicalDevices/DeviceRegulationandGuidance/GuidanceDocuments/defau 141lt.htm) and CBER142/BiologicsBloodVaccines/GuidanceComplianceRegulatoryInformation/Guida 143nces/General/ucm214106.htm) for the appropriate contents for submissions.1441452.What is an eCopy?146An electronic copy (eCopy) is defined as an exact duplicate of the paper submission, created and 147submitted on a compact disc (CD), digital video disc (DVD), or in another electronic media148format that FDA has agreed to accept, accompanied by a copy of the signed cover letter and the 149complete original paper submission.21501513.Are differences between the contents of an eCopy and152paper submission acceptable?153While an eCopy is defined as an exact duplicate of the paper copy, there are limited cases in154which differences between the eCopy and the paper copy may be justified because a paper copy 155is not practical or appropriate for analysis purposes (e.g., raw data and statistical analysis156programs,3 data line listings to facilitate a bioresearch monitoring review) or is not feasible (e.g., 157videos, x-rays). The critical attribute of an eCopy is that it must include in electronic form all 1581 For the purposes of this guidance, applicant includes “submitter,” “sponsor,” or “holder.”2 An eCopy is not considered to be an electronic submission. For information on eSubmissions, refer to “FDAeSubmitter” (/ForIndustry/FDAeSubmitter/default.htm) and “Regulatory Submissions inElectronic Format for Biologic Products”(/BiologicsBloodVaccines/DevelopmentApprovalProcess/ucm163685.htm).3 For information on electronically submitted data, refer to “Clinical Data for Premarket Submissions”(/MedicalDevices/DeviceRegulationandGuidance/HowtoMarketYourDevice/PremarketSubmissi ons/ucm136377.htm).Draft – Not for Implementationdata required for that submission type.4 In other words, the eCopy must include all of the159required information for FDA review, whereas the paper copy can include a page cross-160referencing the location of certain information in the eCopy.161162The cover letter must contain the eCopy statement described in Attachment 1 and describe any 163differences between the paper version and the eCopy. The paper version must also have a164placeholder (e.g., a piece of paper printed with the appropriate section title or a divider165appropriately cross-labeled to the table of contents) that cross-references the eCopy to indicate 166that there are additional data/information in the eCopy and where in the eCopy that information 167is located.168169FDA will consider the eCopy loaded into the appropriate Center’s official document repository 170to be the official record. Any undisclosed differences between the eCopy and the paper version 171may need to be rectified and could delay the review of the submission.1721734. For what submission types is an eCopy required?174Once FDA finalizes this guidance, section 745A(b) of the FD&C Act, as added by section 1136 175of FDASIA, will require an eCopy for the following submission types5:176•Premarket notification submissions (510(k)s), including third party 510(k)s;177•Evaluation of automatic class III designation petitions (de novos);178•Premarket approval applications (PMAs)6;179•Modular PMAs;180•Transitional PMAs;181•Product development protocols (PDPs);182•Investigational device exemptions (IDEs);183•Humanitarian device exemptions (HDEs), including Humanitarian Use Device184designation requests (HUDs);185•Certain investigational new drug applications (INDs)7;186•Certain biologics license applications (BLAs)8; and187•Pre-Submissions9.1884 For example, the content requirements for a 510(k) submission are found in 21 CFR 870.87 and 807.92; those fororiginal PMA submissions are found in 21 CFR 814.20.5 Although not subject to the eCopy legislation, FDA accepts and strongly encourages eCopies for Master AccessFiles (“MAF” submissions), 513(g) Requests for Classification (“C” submissions), and Clinical LaboratoryImprovement Act (CLIA) Categorization – Exempt Device submissions (“X” submissions). If you choose to submit an eCopy, it must meet the standards outlined in Attachment 1.6 This includes all PMA submission types, including, but not limited to, original PMAs, panel-track supplements,180-day supplements, manufacturing site change supplements, and post-approval study supplements.7 Applicable only to those devices regulated by CBER that are also biologics under section 351 of the Public HealthService (PHS) Act and that also require submission of an IND prior to submission of a BLA. Such devices aregenerally those intended for use in screening donated blood for transfusion transmissible diseases.8 Applicable only to those devices regulated by CBER that are also biologics under Section 351 of the PHS Act,including those that do not require submission of an IND prior to the submission of the BLA. Such devicesgenerally include those reagents used in determining donor/recipient compatibility in transfusion medicine inaddition to those for use in screening blood for transfusion transmissible diseases.9 Refer to the draft guidance entitled, “Medical Devices: The Pre-Submission Program and Meetings with FDAStaff” (/MedicalDevices/DeviceRegulationandGuidance/GuidanceDocuments/ucm310375.htm).Draft – Not for Implementation189eCopies for all subsequent submissions to an original submission, including amendments,190supplements, and reports10 to the submission types identified above would also be required even 191if the original was submitted to FDA prior to implementation of the eCopy requirement.1921935.What submission types does FDA consider exempt from 194submission of an eCopy?195Due to the potential urgent nature of the following types of submissions, FDA considers these to 196be exempt from the requirement for an eCopy:197•Compassionate use IDE submissions;198•Emergency use IDE submissions11; and199•Emergency Use Authorizations (EUAs)12.200201However, we encourage you to submit eCopies of these submissions, when feasible, in order to 202facilitate the review process. In addition, this exemption would not preclude you from sending 203in pertinent electronic information, such as imaging data, as supporting information for these 204submission types when an eCopy is not submitted.2052066.What submission types or applicants are eligible for an207eCopy waiver?208FDA believes that, given the widespread availability of software to enable the creation of an209acceptable eCopy at little to no cost, all applicants should have the ability to provide an eCopy. 210Therefore, at this time, FDA does not anticipate the need for waivers, except as described in211Section 9.2122137.How many copies of a submission are needed?214The eCopy Program would not change the overall number of copies to submit to FDA. Upon 215finalization of this guidance document, an eCopy (with a signed cover letter) will serve as one of 216the required number of copies for the various submission types. (See Table 1 below.) FDA will 217accept additional eCopies (each with a signed cover letter) in lieu of additional paper copies as 218long as at least one paper copy is submitted along with the eCopy and the total number of219required copies remains the same.22022110 Reports include all reports submitted to an applicable submission type, including annual/periodic and post-approval reports. Section 745A(b) of the FD&C Act does not apply to Medical Device Reports submitted under 21 CFR Part 803 .11 Please refer to CDRH’s device advice page entitled “IDE Early/Expanded Access”(/MedicalDevices/DeviceRegulationandGuidance/HowtoMarketYourDevice/InvestigationalDevi ceExemptionIDE/ucm051345.htm#compassionateuse) and FDA’s “Guidance on IDE Policies and Procedures”(/MedicalDevices/DeviceRegulationandGuidance/GuidanceDocuments/ucm080202.htm) for additional details on compassionate and emergency use IDE submissions.12 Refer to the guidance entitled, “Emergency Use Authorization of Medical Products”(/RegulatoryInformation/Guidances/ucm125127.htm) for more information on EUAs.Draft – Not for ImplementationFor submission types for which only two copies are required to be submitted, one must be an 222eCopy and the other must be a paper copy. For submission types requiring more than two223copies, this policy would allow additional flexibility in how the application is submitted. For 224example, for an original PMA, you would submit: (1) one eCopy and five paper copies; (2) five 225eCopies and one paper copy; or (3) any other combination that results in six total copies as long 226as there is at least one eCopy and one paper copy.227228Table 1, provides the total number of copies to be submitted to FDA. As explained above, you 229must submit at least one eCopy and one paper submission. The format for the remaining copies 230(i.e., eCopy or paper) is your choice.231232Table 1 – Number of Copies for Submission233Submission Type Total Number ofCopies510(k)s 213Third Party 510(k)s 213Original PMAs and Panel-Track Supplements 614Other PMA supplement types 315PMA reports 2Modular PMAs 3HDEs Same as PMAs,16except for HUDdesignationrequests, whichrequire two.17PDPs Same as PMAsIDEs 318INDs 319BLAs 3Pre-Submissions 32348.What are the processing steps for an eCopy?235Below are the processing steps for the submission and acceptance of an eCopy.236237a.What are the standards for an eCopy?238With regard to the standards for an eCopy submitted to FDA, please refer to Attachment 2391. Because an eCopy cannot be accepted by our eCopy loading system if it does not meet 240the standards, you should carefully review this information.24124213 See 21 CFR 807.90(a)(3)(c).14 See 21 CFR 814.20(b)(2).15 See 21 CFR 814.39(c).16 See 21 CFR 814.104(b)(4).17 See 21 CFR 814.102(d).18 See 21 CFR 812.20(a)(3).19 See 21 CFR 312.23(d).b.How do I know before submission whether my eCopy meets FDA’s243standards for acceptance?244To confirm that your eCopy will meet FDA’s standards, we strongly encourage you to 245use the new free eSubmitter-eCopies tool available on FDA’s website at246/ForIndustry/FDAeSubmitter/ucm317334.htm. One of the benefits of 247utilizing the eSubmitter-eCopies tool is that it creates an eCopy in real-time that is248consistent with the standards. Use of the eSubmitter-eCopies tool is intended to prevent 249delays in review of your submission due to the need to resolve technical issues.250Although it is highly encouraged, you will not be required to utilize the eSubmitter-251eCopies tool and may choose to skip the eSubmitter step.252253Should you have any technical questions when generating your eCopy, please contact 254cdrhesub@ prior to submission of the eCopy to FDA.255256c.What if there is another processing party involved?257In the case that another party (e.g., law firm, consultant) submits a submission on behalf 258of an applicant, the eCopy must still meet the standards for an eCopy in order to be259successfully processed whether accomplished by you (the applicant) or the submitting 260party. While the applicant may or may not include their own cover letter as part of the 261eCopy, our standards require that the submitting party include a signed cover letter with 262an eCopy statement, as described in Attachment 1.263264In the case of Third Party 510(k)s, two separate CDs comprise the eCopy. The first CD 265includes the applicant’s submission and should be clearly marked as such. The contents 266of the CD must include a cover letter with an eCopy statement, as described in267Attachment 1, that the applicant has provided. The second CD includes the Accredited 268Person’s review records and should be clearly marked as such. The Accredited Person is 269responsible for ensuring that the CDs meet the standards in Attachment 1 for an eCopy. 270In addition, the Accredited Person is responsible for providing a signed cover letter that 271includes an eCopy statement, as described in Attachment 1, that speaks to both: (1) the 272Accredited Person’s portion of the eCopy and (2) the presence of the eCopy statement 273provided by the applicant. It is not sufficient for the Accredited Person to address only 274one of these two eCopy statement issues in their cover letter.275276d.How do you submit an eCopy to FDA?277An eCopy is submitted simultaneously with the paper submission(s). First, attach the 278signed cover letter with the eCopy statement to your eCopy. Then attach this eCopy279package to the paper submission(s) and send them to CDRH’s or CBER’s Document280Control Center20 (DCC). An eCopy that is sent to the DCC without a cover letter and 281accompanying paper submission(s) will be placed on hold.282283If more than one eCopy is to be submitted, then you must attach a signed cover letter as 284described above to each additional eCopy.28528620 Refer to 21 CFR 807.90 for the DCC addresses for CDRH and CBER.e.How does FDA process an eCopy?287If an eCopy passes the validation check, the cover letter and eCopy contents will be288loaded into the appropriate Center’s official submission repository.289290If an eCopy fails the validation check (i.e., is rejected), we will notify you in writing291(e.g., by email or fax) of the reason(s). The notification will describe the logistics for 292submitting a replacement eCopy, including how to properly mark it as a replacement293eCopy, the address to which to send it, and the submission number to write on it. It is 294important that you follow these directions to avoid delays in processing the replacement 295eCopy. The submission will be placed on hold until a valid replacement eCopy is296submitted to FDA and verified to meet the standards.2972989.What if your device is regulated by CBER?299a.Will the new eCopy Requirement apply?300Yes, unless your submission is an entirely electronic submission exempted under this 301guidance, as described below. Upon implementation of the statutory requirement, all 302medical device submission types listed in Section 4 must be accompanied by an eCopy 303regardless of the Center in FDA in which the submission will be reviewed unless the304requirement is waived or exempted. Accordingly, submissions for devices subject to 305review under the FD&C Act and submitted by filing paper copies with CBER’s DCC 306must be accompanied by an eCopy, except where exempted as described below.307308While many submissions made to CBER are still in paper format and require submission 309of multiple copies, CBER is also currently able to receive and manage submissions that 310are entirely electronic.311312Submissions for devices that are subject to licensure under the Public Health Service313(PHS) Act, including biologics license applications and supplements, investigational new 314drug applications, and EUAs and pre-submissions for these devices, may be submitted as 315entirely electronic submissions as detailed in sections 9b and 9c below. FDA will316exempt such entirely electronic submissions from the eCopy requirement.317318FDA additionally waives the eCopy requirement to submit paper copies of any entirely 319electronic submission made to CBER. Accordingly, entirely electronic submissions that 320comply with CBER guidance identified in Section 9.c. below do not need to be321accompanied by paper copies.322323b.Can you submit an electronic submission instead?324Yes, and there are several advantages for both industry and for CBER staff when you 325choose to make submissions electronically.326327The main advantage to you is in the financial savings that will likely result. The costs 328associated with printing, binding, labeling, and shipping multiple paper copies can be 329significant, especially for submissions that contain a great deal of supporting330Draft – Not for Implementationdocumentation. Likewise, we anticipate that FDA will recognize financial savings in that 331FDA avoids the costs associated with tracking, routing, and storing large amounts of332paper when you choose to submit electronically.333334Another advantage with the use of the electronic submission process is that all parties 335involved in the submission and review are referencing the same document – the336electronic one. There is no question about whether the paper copy is an exact copy of the 337eCopy. Electronic submissions may also reduce the need for reviewers to request re-338submission of previously submitted information due to an inability to read or interpret the 339information on the paper copy, as sometimes occurs when documents are photocopied. 340341c.How do you prepare and submit an electronic submission to CBER?342CBER has several resources available to applicants who choose to submit electronic343submissions as outlined in the document “Regulatory Submissions in Electronic Format 344for Biologic Products.”345(/BiologicsBloodVaccines/DevelopmentApprovalProcess/ucm163685 346.htm). Thus, specific details are available in the cited references and will not be repeated 347in this guidance.348349For devices that are regulated under the PHS Act and require the submission of a BLA, 350consult the guidance document entitled “Providing Regulatory Submissions to the Center 351for Biologics Evaluation and Research (CBER) in Electronic Format - Biologics352Marketing Applications”353(/downloads/BiologicsBloodVaccines/GuidanceComplianceRegulator 354yInformation/Guidances/General/UCM192413.pdf) for details on preparing your355electronic submission. Note that certain sections of this guidance, for example, those on 356pharmacology and toxicology, are generally not pertinent to licensed devices.357358For guidance on preparing electronic submissions for other device submissions (e.g.,359510(k)s, PMAs) sent to CBER, please see “Guidance for Industry: Providing Regulatory 360Submissions in Electronic Format - General Considerations”361(/downloads/Drugs/GuidanceComplianceRegulatoryInformation/Guidances 362/UCM072390.pdf) and “CBER SOPP 8110: Submission of Paper Regulatory363Applications to CBER”364(/BiologicsBloodVaccines/GuidanceComplianceRegulatoryInformati 365on/ProceduresSOPPs/ucm079467.htm), which includes information about providing366electronic copies to CBER.367368We are currently developing additional, updated guidance for other electronic369submissions sent to CBER and have issued a revised, updated draft guidance document 370for comment entitled, “Draft Guidance for Industry: Providing Regulatory Submissions 371in Electronic Format-General Considerations”372(/RegulatoryInformation/Guidances/ucm124737.htm). When373finalized, this document will provide an additional resource for applicants preparing374electronic submissions.375376。

俄罗斯高温气冷堆

俄罗斯高温气冷堆

俄罗斯高温气冷堆俄罗斯高温气冷堆.txt遇事潇洒一点,看世糊涂一点。

相亲是经销,恋爱叫直销,抛绣球招亲则为围标。

没有准备请不要开始,没有能力请不要承诺。

爱情这东西,没得到可能是缺憾,不表白就会有遗憾,可是如果自不量力,就只能抱憾了。

本文由mtlzc2010贡献pdf文档可能在WAP端浏览体验不佳。

建议您优先选择TXT,或下载源文件到本机查看。

1Development of HTGR technologies in Russia: experience, activities, plansPrepared by OKBM, Nizhniy Novgorod and RRC Kurchatov Institute, Moscow Presented by A. Sedov, RRC Kurchatov Institute, Moscow ============================================================Villigen, PSI November 27, 2009HTGR APPLICATIONSWeapons Plutonium TRISOElectricity Co-generation :Ammonia production Ethylene production Petroleum processing Synthetic fuel production HydrogenLWR Spent Fuel TRISOTRISO Fuel in graphite blocksPu, U-Pu, U-Th, LEU TRISOReactor GT-MHR3HTGR PROJECTS: EXPERIENCE AND ONGOINGDesign of a test-industrial 2-circuit nuclear installation with the steam-turbine cycle for development of HTGR technologies (1971– 1984) Final Designof a pilot-industrial nuclear power plant for generation of process heat and electricity in the steam-turbine cycle (1973–1987) Final Design of apilot-industrial nuclear power plant of modular concept for generation of process heat and electricity (1987– 1992) GT-MHR VGM VG-400 VGR-50Design of a gas-turbine modular helium reactor for generation of electricity in the direct closed gas turbine cycle with burn up Pu fuel (development started in 1995)MHR-TConceptual design of a nuclear power plant for generation of process heat for hydrogen production and electricity in the direct gas-turbine cycle (2004)4RUSSIAN TEAM OF DEVELOPERS RosatomOKBM- Customer - GT-MHR chief designer of reactor plant and organization responsible for entire project development - GT-MHR general designer of NPP - Project scientific supervisor - Chief designer – technologist of fuel compact development - Mastering and transfer of compacting and coating application technology - Fuel irradiation tests and post-irradiation examinationsVNIPIET RRC “Kurchatov Institute” VNIINMNPO Lutch NIIAR5VGM REACTOR PLANT1 – reactor core;2 – vessels block;3 – intermediate heat exchanger;4 –steam generator; 5 – gas circulator; 6 – emergency cooldown system;7 – fuelreloading system; 8 – RSS; 9 – helium purification system; 10 –relief valveN=200 MW (th); Tin let=300?C; Toutlet=950?C; P=5МPа; Core-pebblebed6Helium Loop PG-100 in Reactor MR (Kurchatov Ins)Reactor Power, MW Pressure of Helium Coolant, MPa Flow Rate, g/s -in the Loop - in Test Channel Helium leakage, %/day oC Temperature of Helium, - in the Loop - in Test Channel - in Test Section Temperature offuel in CPs oC Duration of irradiation period h Fluence of fast neutrons, n/cm2 Burnup (FIMA) % 27 - 33 3.8 – 4.1230 - 250 38 - 100 0.25 – 0.5 15 – 150 150 – 600 300 – 600 500 - 900 13 5000.7 – 12*1021 4.9 – 121 – Reactor pool;2 – Core;3 – Test Channel;4 – Receiver,5 –Safetymembrane; 6 – Pressure reductor; 7 – Shutdown gas receiver; 8 –Recuperator; 9– 11 – Helium Blowers; 12, 13 – Heat Exchangers; 14 – Heater;15 – Copperoxidizer; 16 – Cooler; 17 – Decaying GFP storage; 18 – Zeolite Filter; 19 –Regenerator; 20 – Cryogen Graphite Filter; 22, 23 – HXs; 24 –MetalceramicFilter; 25 – Vacuum Pump; 26 – Safety membrane; 27 – Receiver;28 – ControlValve; 29 – Safety valve; 30 - Vacuum Pump; 31 – Accident Receiver7In – Pile Test Channels in Helium Loop PG-1008 POSSIBLE OUTLINE OF HIGH-TEMPERATURE REACTOR TECHNOLOGY DEVELOPMENT IN RUSSIACommercial nuclear cogeneration plant Main nuclear cogenerationplantCommercial NPPMain NPPFGR GT-MHRDemonstration gasgasturbine modular helium reactor for highly efficient generation of electric power Demonstration module for power technology application and production of hydrogenMHR-TDemonstration highhightemperature fast gasgascooled reactor for electric power and/or hydrogen productionFuel productionReactor and power conversion system technologiesFuel technologyHigh-temperature heat exchanger technologyHydrogen production technologyModular helium reactor is the basis for implementation of various HTGR technologies9MAIN AREAS OF GT-MHR PROJECT ACTIVITIESHigh-burnup fuel Fission products transport with experimental validationand upgrading of computer codes and data bases Experimental and analyticalvalidation of reactor neutronic characteristics, verification of computer codesReactor system Power conversion system Designs of components and systems10GT-MHR REACTOR SYSTEMReactor key featuresCPS assemblyReactor vesselReactor coreIntegral layout of the reactor equipment inside a single vessel Annular reactor core Reactor fuel in the form of multi-layer coated particles compacted in graphite fuel elements Passive removal of residual heat Possible reactor transition for one fuel cycle to another using various fuel types (U, Pu, Th, MOX)Stack IVM Hot gas ductMain technical characteristicsThermal capacity, MW(th) Helium temperature at the reactor inlet, C Helium temperature at the reactor outlet, C Reactor inlet pressure, MPa Helium flowrate, kg/s Fuel assembly – Prismatic Fuel block 600 490 850 7.126 318.9Lower plenumSCS unit11GT-MHR POWER CONVERSION SYSTEMPCU key featuresGeneratorDiaphragm couplingGas coolerIntegral layout of PCU equipment inside a single vessel Vertical TM layout Diaphragm coupling between electrical generator and TC rotors TM rotor electromagnetic suspension Generator helium cooling Recuperator efficiency – 0.95Direct Bryton Cycle with recuperator and intercoolerTurbocompressor IVMBasic technical characteristicsRecuperator PrecoolerIntercoolerGenerator power, MW Helium temperature at the PCU inlet, 0C Helium temperature at the PCU outlet, 0C Helium pressure at the PCU inlet, MPa Helium pressure at the PCU outlet, MPa287 850 490 7.03 7.1212MHR-T ENGINEERING CONCEPT (HTE OPTION)The MHR-T reactor plant was developed based on the GT-MHR reactor designMain technical characteristics (HTE option)Thermal power, MW Power for hydrogen production- electric, MW - thermal, MW 600Temperature at the reactor outlet, 0С 950205.5 160 54.05 60Hydrogen output, Life time, yearsthousand tons / yearPower conversion unitReactorHigh-temperature heat exchangersHTRG TEST FACILITIES in RUSSIA Facilities for fuel experimental investigationstesting TRISO fuel fabrication technology quality control and investigate the fabricated fuel irradiation and post-irradiation examinationsFacilities for experimental investigations of reactor system and reactor core Facilities for experimental investigations in support of RS component testing Facilities for power conversion system experimental investigationsinvestigations of rotor dynamics and electromagnetic suspension test TC and generator componentsFacilities for experimental investigations of fission product transport Hydrogen production technology investigationsA Few Examples of Existing HTGR Experimental FacilitiesWithin the framework of HTGR program, about 80 test facilities have been established in OKBM, RRC KI, VNIINM, NIIAR, NPO “Lutch” etc. to investigatetechnological processes and to test main reactor plant components.Small helium loop, power 500 kW, temperature to 9500C (OKBM)Bench-Scale Facility (VNIINM)BFS – physical test facility (IPPE)ASTRA critical test facility (RRC KI)Complex of test rigs for tests of electromagnetic suspension system (OKBM)The lab-scale facility for fabrication of Ufuel (NPO “Lutch”)Test facility for mockup tests of CPS drives (OKBM)Gas-dynamic test facility (OKBM)15EXISTING HTGR EXPERIMENTAL FACILITIESTest facility 1 2 3 4 5 6 7 8 9 10 11 12 13 BENCH-SCALE FACILITY (VNIINM) COATING EQUIPMENT (NPO LUTCH) Purpose Fabrication and certification of GT-MHR fuel Manufacturing fuel particle coatings and fuel compacts with non-irradiated uranium Description glove boxes Dense pyrocarbon, Silicon carbide, Porous pyrocarbon, Fuel kernel Fuel particle type TRISO, Tmax=1200?1600?С Aerosol, volatile, solid radionuclides; , radiation Enrichment in U235-90%, neutron flux8*1017 n/cms Core volume 47.4 L, U235 in a batch with fresh FAs 4.35kg SM-3: =up to 1,8 *1015 cm-2s-1 RBT-6: =up to 5,6 *1013cm-2s-1 Glove boxes with various equipment for post-Irradiation tests Various options for core geometry Graphite stack up to 4.5 m, graphite blocks 250х250 mm Reactor core (D/H)-2.2/2.2m, FA type-hexagonal Telescopic bar, CPSdrive position sensor Maximum helium pressure 5MPa, and temperature 950?С Electric capacity 15MW, temperature up to 965?CPARAMETR TEST FACILITY COMPLEX Investigate thermomechanical and corrosion behavior of fuel elements (NPO LUTCH) OSA TEST FACILITY (RRC KI) GIDRA REACTOR (RRCKI) IR-8 POOL-TYPE REACTOR (RRC KI) SM-3 AND RBT-6 RESEARCH REACTORS(NIIAR) POST-IRRADIATION TEST COMPLEX (NIIAR) ASTRA CRITICAL NUCLEAR TEST FACILITY (RRC KI) GROG CRITICAL NUCLEAR TEST FACILITY (RRC KI) BIG FAST CRITICAL FASILITY (IPPE) CONTROL ROD DRIVE MOCKUP TEST (OKBM) HELIUM TEST FACILITY ST-1565 (OKBM) LARGE-SCALE HIGH-TEMPERATURE HELIUM TEST FACILITY ST-1312 (OKBM) Measure fission product release Test fuel elements from various reactor plants in reactivity accident conditions Nuclear physics, radiochemistry radiobiology, and activation analysis Irradiation examinations of fuel elements, reactor material researches Investigate the irradiated articles, properties of irradiated fuel, structural, moderating and absorbing materials Experiments in the cold and hot conditions Investigate the GT-MHR neutronic characteristic Validate the GT-MHR neutronic characteristic Investigate telescopic technology, check movable components operability Tests of steam generator and heat exchanger models, valves, thermal insulation, relief valves, mixer models, HPS, gas circulator Test of models of steam generator and high temperature heat exchangers, gas circulator1416EXISTING HTGR EXPERIMENTAL FACILITIESTest facility 15 16 17 Purpose Description18 19 20 21 22 23 24MAIN CIRCULATOR TEST FACILITY ST- Tests of a full-scale primary gas circulator, valves Pressure 4.9MPa, flowrate 95kg/s 1383 (OKBM) and the other equipment of HTGRs Air Tests of the Full-Scale Recuperator Heat AIR TEST FACILITY (OKBM) Flow rate 10000 m/h Exchanger Element Verify rotor dynamics, check critical frequency, ROTOR SCALED MODEL (OKBM)rotor model behavior, balancing in electromagnetic Rotor length 10.5 m, weight 1000 kg suspension MINIMOCKUP OF ROTOR ON FULL Investigate rotor dynamics, develop control laws 1 axial and 2 radial EMB, rotor rotation ELECTROMAGNETIC SUSPENSION and algorithms, verify computer codes speeds 0-10000 rpm, 4 critical frequencies (OKBM) TEST FACILITY FOR EMB Measure characteristics of radial EMB, Investigate Rotor length 1.4m, weight250kg, load to CHARACTERISTIC INVESTIGATIONS influence of control system EMB up to 800kg (OKBM) Excitation frequency range TEST FACILITY FOR SENSOR Investigate sensor operation modes at variation of INVESTIGATIONS (OKBM) excitation frequency and specific gap value 1 - 400 kHz AXIAL CATCHER BEARING SEGMENT Investigations of gas-static characteristics of one Helium pressure upstream the segment 1.1 (OKBM) axial TM CBsegment – 6.0 MPa Pressure up to 4.9 MPa,axial/radial load L-1129. FRICTION COUPLES TESTS Select materials and wear-resistant coatings 1.2/1.4 MPa (OKBM) STATOR SEAL TEST (OKBM) Determine values of air leaks across the seal Pressure drop 0.01…0.4MPaSORPTION AND DIFFUSION ON Investigate silver/cesium diffusion and sorption on Working temperature range 400-900С STRUCTURAL MATERIAL SAMPLES structuralmaterials (NPO Lutch) TsGS CIRCULATION HELIUM TEST Gas pressure 1.5-10atm, temperature 50Investigate helium technology and HTGR materials25 FACILITY (RRC KI) 900?С KhTS CHEMO-THERMAL FACILITY (RRC KI) TEST Investigate technology of hydrogen production from water and methaneusing HTGR heat Gas pressure 10MPa, temperaturein the conversion sector 900?С2617FUEL FABRICATION TECHNOLOGY DEVELOPMENT BENCH-SCALE FACILITY (VNIINM) Bench-Scale Facility; kernel production sectorPurposeTechnology development, fabrication and certification of an experimental GT-MHR fuel batch in order to validate the fuel compact design and operability.CompletedThe facility consists of several glove boxes including all equipment necessary to fabricate kernels, coated fuel particles, and fuel compacts, and to control their quality.StatusThe first stage of BSF construction was completed; first batches of natural uranium kernels, coated fuel particles and fuel compacts were fabricated.18GT-MHR FUELOperation Parameter1 Fuel type2 Power of Fuel Compact, KW: - average - maximum3 Average fuel lifetime, EFPD4 Maximum fluence of fast neutrons (Е > 0,18 МEV) for an operating period,n/m-2 5 Fuel burnup, MWday/kg Pu: Average - Maximum 6 Maximum fuel temperature, С:- normal operation conditions - design-basis accident conditions, 100 hr 7 Admissible fraction of СР with damaged SiC a layer ValueTRISO,kernels with outer oxygen getter (SiC) 0,206 0.600 (280 d.)~870 (3×290)51025 ?750 930 1250-1300 1600 Less than 110-4COMPLEX OF FUEL IRRADIATION TEST REACTORS IN NIIAR RBT-6 Research Reactor19SM-3 Research ReactorCapabilities to Study HTGR Physics at the ASTRA Critical Facility of RRC “Kurchatov Institute”Out-of-Pile Loop - TsGS Helium Circulation Test Facility (RRC KI)PurposeInvestigate helium technology and HTGR materials. Upgrade the test facility for out-of-pile loop tests of fission product transport Main technical characteristicsElectric power, kW Gas pressure, atm. Gas temperature, ?С Circuit volume, m3Gas circulator head coefficient Motor rotation speed, rpm Helium heating in the compressor, ?С Maximum h elium flow rate at 10 atm., kg/s Volumetric helium flow rate at 50 0C and 10 аtт., m3/s 75 1.5 – 1050 – 900 ~ 0.9 1.03 2950 up to 800.01 0.065StatusUnder inspection before planning Upgrade22FISSION PRODUCT TRANSPORT: WORKS and PLANSFission Product TransportModification and elaboration of FPT codesFPT Lab-scale testsLab-scale tests of fission products diffusion and decontamination Investigationsof SiC (ZrC) oxidation parameters and fission products solubility FPT out-pile loop testsDevelopment of the project of facility for SFP out-of-pile reactor loop testsFPT irradiation testsFPT irradiation tests at RBT-6 and SM-3 reactorsFPT postirradiation tests with annealingFPT postirradiation tests with annealing in NIIARFPT in-pile loop testsFPT computer code validation and sertificationFPT computer code validation and sertificationFPT codes modification and upgrade based on test results Elaboration of newmechanistic models and coupling their in Program ComplexTest facility manufacture for FPT out-pile loop testsDesign of test facility for FPT in-pile loop testsLab-scale tests of fission products transport and plate-outFPT out-pile loop testsTest facility manufacture for FPT in-pile loop testsFPT in-pile loop testsNote: Red font – work is underway Blue font – planned activities INTEGRATED SET OF COMPUTER CODES (RELIABLE MODELING)Initial data for all codesENDF-B, JEF, JENDL, UKNDL, FOND 2.2, WLUP nuclear data Multigroup microcross-section library VITAMIN-B6, VITAMIN-C23NJOYASTRA AMPXGroup macro crosssection Fuel thermo-dynamic characteristics`WIMS, UNKMCNP – ORIGEN – MONTEBURNS, MCUGOLTFuel thermomechanical characteristicsGroup macro cross-sectionJAR-HTGR, WIJARTNeutronic characteristics of reactorDORT, TORTDistribution of neutron fluences and power releaseDELTAChoice of principal dimension for constructional elementsGTAS, RATKOThermo – hydraulic characteristics of reactorMGTR-SS, RECUPParameters of gas – turbine cycleANSYSTemperature distribution in constructional element of reactor and PCUFLOWVISIONHydraulic characteristics of reactor constructional element and the 1st circulation circuitSOURCE, ORIGEN, SURVEY, TRAFIC, PADLOC, SORSOutput and transport of fission products Fuel radiation characteristicsANSYS, DANCO, KOSMOSDeflected mode of constructional elementsRAMPAHoming action of pipeline systemGTMHR, DIROMParameters of transient and emergency conditions (dynamic)RPK, MASEX, GTASParameters of emergency conditionsVIBROSRadiation consequences on- siteKRITE, CRACKX, VAL, FRACTURE, FLANARMStrength of equipment constructional elementsDYNARAEarthquake load to constructional elements24CONCLUSIONSRussia has experience in development of HTGR projects and possesses a large complex of experimental facilities for development and tests of basic HTGR RP components.GT-MHR and MHR-T project activities are in line with HTGR development activities in other countries Nevertheless of its ownexperience and possibilities Russia needs in international cooperation in number of key HTGR technologies: fuel fabrication and reprocessing; high-temperature materials; radionuclides transport in reactor system, in nuclear island, on-site contamination, estimation of radioactive pollutions to environments; development of new-generation codes and program complexes1。

Indradrive 系列 故障代码

Indradrive 系列 故障代码

Error MessagesF9001 Error internal function call.F9002 Error internal RTOS function callF9003 WatchdogF9004 Hardware trapF8000 Fatal hardware errorF8010 Autom. commutation: Max. motion range when moving back F8011 Commutation offset could not be determinedF8012 Autom. commutation: Max. motion rangeF8013 Automatic commutation: Current too lowF8014 Automatic commutation: OvercurrentF8015 Automatic commutation: TimeoutF8016 Automatic commutation: Iteration without resultF8017 Automatic commutation: Incorrect commutation adjustment F8018 Device overtemperature shutdownF8022 Enc. 1: Enc. signals incorr. (can be cleared in ph. 2) F8023 Error mechanical link of encoder or motor connectionF8025 Overvoltage in power sectionF8027 Safe torque off while drive enabledF8028 Overcurrent in power sectionF8030 Safe stop 1 while drive enabledF8042 Encoder 2 error: Signal amplitude incorrectF8057 Device overload shutdownF8060 Overcurrent in power sectionF8064 Interruption of motor phaseF8067 Synchronization PWM-Timer wrongF8069 +/-15Volt DC errorF8070 +24Volt DC errorF8076 Error in error angle loopF8078 Speed loop error.F8079 Velocity limit value exceededF8091 Power section defectiveF8100 Error when initializing the parameter handlingF8102 Error when initializing power sectionF8118 Invalid power section/firmware combinationF8120 Invalid control section/firmware combinationF8122 Control section defectiveF8129 Incorrect optional module firmwareF8130 Firmware of option 2 of safety technology defectiveF8133 Error when checking interrupting circuitsF8134 SBS: Fatal errorF8135 SMD: Velocity exceededF8140 Fatal CCD error.F8201 Safety command for basic initialization incorrectF8203 Safety technology configuration parameter invalidF8813 Connection error mains chokeF8830 Power section errorF8838 Overcurrent external braking resistorF7010 Safely-limited increment exceededF7011 Safely-monitored position, exceeded in pos. DirectionF7012 Safely-monitored position, exceeded in neg. DirectionF7013 Safely-limited speed exceededF7020 Safe maximum speed exceededF7021 Safely-limited position exceededF7030 Position window Safe stop 2 exceededF7031 Incorrect direction of motionF7040 Validation error parameterized - effective thresholdF7041 Actual position value validation errorF7042 Validation error of safe operation modeF7043 Error of output stage interlockF7050 Time for stopping process exceeded8.3.15 F7051 Safely-monitored deceleration exceeded (159)8.4 Travel Range Errors (F6xxx) (161)8.4.1 Behavior in the Case of Travel Range Errors (161)8.4.2 F6010 PLC Runtime Error (162)8.4.3 F6024 Maximum braking time exceeded (163)8.4.4 F6028 Position limit value exceeded (overflow) (164)8.4.5 F6029 Positive position limit exceeded (164)8.4.6 F6030 Negative position limit exceeded (165)8.4.7 F6034 Emergency-Stop (166)8.4.8 F6042 Both travel range limit switches activated (167)8.4.9 F6043 Positive travel range limit switch activated (167)8.4.10 F6044 Negative travel range limit switch activated (168)8.4.11 F6140 CCD slave error (emergency halt) (169)8.5 Interface Errors (F4xxx) (169)8.5.1 Behavior in the Case of Interface Errors (169)8.5.2 F4001 Sync telegram failure (170)8.5.3 F4002 RTD telegram failure (171)8.5.4 F4003 Invalid communication phase shutdown (172)8.5.5 F4004 Error during phase progression (172)8.5.6 F4005 Error during phase regression (173)8.5.7 F4006 Phase switching without ready signal (173)8.5.8 F4009 Bus failure (173)8.5.9 F4012 Incorrect I/O length (175)8.5.10 F4016 PLC double real-time channel failure (176)8.5.11 F4017 S-III: Incorrect sequence during phase switch (176)8.5.12 F4034 Emergency-Stop (177)8.5.13 F4140 CCD communication error (178)8.6 Non-Fatal Safety Technology Errors (F3xxx) (178)8.6.1 Behavior in the Case of Non-Fatal Safety Technology Errors (178)8.6.2 F3111 Refer. missing when selecting safety related end pos (179)8.6.3 F3112 Safe reference missing (179)8.6.4 F3115 Brake check time interval exceeded (181)Troubleshooting Guide | Rexroth IndraDrive Electric Drivesand ControlsI Bosch Rexroth AG VII/XXIITable of ContentsPage8.6.5 F3116 Nominal load torque of holding system exceeded (182)8.6.6 F3117 Actual position values validation error (182)8.6.7 F3122 SBS: System error (183)8.6.8 F3123 SBS: Brake check missing (184)8.6.9 F3130 Error when checking input signals (185)8.6.10 F3131 Error when checking acknowledgment signal (185)8.6.11 F3132 Error when checking diagnostic output signal (186)8.6.12 F3133 Error when checking interrupting circuits (187)8.6.13 F3134 Dynamization time interval incorrect (188)8.6.14 F3135 Dynamization pulse width incorrect (189)8.6.15 F3140 Safety parameters validation error (192)8.6.16 F3141 Selection validation error (192)8.6.17 F3142 Activation time of enabling control exceeded (193)8.6.18 F3143 Safety command for clearing errors incorrect (194)8.6.19 F3144 Incorrect safety configuration (195)8.6.20 F3145 Error when unlocking the safety door (196)8.6.21 F3146 System error channel 2 (197)8.6.22 F3147 System error channel 1 (198)8.6.23 F3150 Safety command for system start incorrect (199)8.6.24 F3151 Safety command for system halt incorrect (200)8.6.25 F3152 Incorrect backup of safety technology data (201)8.6.26 F3160 Communication error of safe communication (202)8.7 Non-Fatal Errors (F2xxx) (202)8.7.1 Behavior in the Case of Non-Fatal Errors (202)8.7.2 F2002 Encoder assignment not allowed for synchronization (203)8.7.3 F2003 Motion step skipped (203)8.7.4 F2004 Error in MotionProfile (204)8.7.5 F2005 Cam table invalid (205)8.7.6 F2006 MMC was removed (206)8.7.7 F2007 Switching to non-initialized operation mode (206)8.7.8 F2008 RL The motor type has changed (207)8.7.9 F2009 PL Load parameter default values (208)8.7.10 F2010 Error when initializing digital I/O (-> S-0-0423) (209)8.7.11 F2011 PLC - Error no. 1 (210)8.7.12 F2012 PLC - Error no. 2 (210)8.7.13 F2013 PLC - Error no. 3 (211)8.7.14 F2014 PLC - Error no. 4 (211)8.7.15 F2018 Device overtemperature shutdown (211)8.7.16 F2019 Motor overtemperature shutdown (212)8.7.17 F2021 Motor temperature monitor defective (213)8.7.18 F2022 Device temperature monitor defective (214)8.7.19 F2025 Drive not ready for control (214)8.7.20 F2026 Undervoltage in power section (215)8.7.21 F2027 Excessive oscillation in DC bus (216)8.7.22 F2028 Excessive deviation (216)8.7.23 F2031 Encoder 1 error: Signal amplitude incorrect (217)VIII/XXII Bosch Rexroth AG | Electric Drivesand ControlsRexroth IndraDrive | Troubleshooting GuideTable of ContentsPage8.7.24 F2032 Validation error during commutation fine adjustment (217)8.7.25 F2033 External power supply X10 error (218)8.7.26 F2036 Excessive position feedback difference (219)8.7.27 F2037 Excessive position command difference (220)8.7.28 F2039 Maximum acceleration exceeded (220)8.7.29 F2040 Device overtemperature 2 shutdown (221)8.7.30 F2042 Encoder 2: Encoder signals incorrect (222)8.7.31 F2043 Measuring encoder: Encoder signals incorrect (222)8.7.32 F2044 External power supply X15 error (223)8.7.33 F2048 Low battery voltage (224)8.7.34 F2050 Overflow of target position preset memory (225)8.7.35 F2051 No sequential block in target position preset memory (225)8.7.36 F2053 Incr. encoder emulator: Pulse frequency too high (226)8.7.37 F2054 Incr. encoder emulator: Hardware error (226)8.7.38 F2055 External power supply dig. I/O error (227)8.7.39 F2057 Target position out of travel range (227)8.7.40 F2058 Internal overflow by positioning input (228)8.7.41 F2059 Incorrect command value direction when positioning (229)8.7.42 F2063 Internal overflow master axis generator (230)8.7.43 F2064 Incorrect cmd value direction master axis generator (230)8.7.44 F2067 Synchronization to master communication incorrect (231)8.7.45 F2068 Brake error (231)8.7.46 F2069 Error when releasing the motor holding brake (232)8.7.47 F2074 Actual pos. value 1 outside absolute encoder window (232)8.7.48 F2075 Actual pos. value 2 outside absolute encoder window (233)8.7.49 F2076 Actual pos. value 3 outside absolute encoder window (234)8.7.50 F2077 Current measurement trim wrong (235)8.7.51 F2086 Error supply module (236)8.7.52 F2087 Module group communication error (236)8.7.53 F2100 Incorrect access to command value memory (237)8.7.54 F2101 It was impossible to address MMC (237)8.7.55 F2102 It was impossible to address I2C memory (238)8.7.56 F2103 It was impossible to address EnDat memory (238)8.7.57 F2104 Commutation offset invalid (239)8.7.58 F2105 It was impossible to address Hiperface memory (239)8.7.59 F2110 Error in non-cyclical data communic. of power section (240)8.7.60 F2120 MMC: Defective or missing, replace (240)8.7.61 F2121 MMC: Incorrect data or file, create correctly (241)8.7.62 F2122 MMC: Incorrect IBF file, correct it (241)8.7.63 F2123 Retain data backup impossible (242)8.7.64 F2124 MMC: Saving too slowly, replace (243)8.7.65 F2130 Error comfort control panel (243)8.7.66 F2140 CCD slave error (243)8.7.67 F2150 MLD motion function block error (244)8.7.68 F2174 Loss of motor encoder reference (244)8.7.69 F2175 Loss of optional encoder reference (245)Troubleshooting Guide | Rexroth IndraDrive Electric Drivesand Controls| Bosch Rexroth AG IX/XXIITable of ContentsPage8.7.70 F2176 Loss of measuring encoder reference (246)8.7.71 F2177 Modulo limitation error of motor encoder (246)8.7.72 F2178 Modulo limitation error of optional encoder (247)8.7.73 F2179 Modulo limitation error of measuring encoder (247)8.7.74 F2190 Incorrect Ethernet configuration (248)8.7.75 F2260 Command current limit shutoff (249)8.7.76 F2270 Analog input 1 or 2, wire break (249)8.7.77 F2802 PLL is not synchronized (250)8.7.78 F2814 Undervoltage in mains (250)8.7.79 F2815 Overvoltage in mains (251)8.7.80 F2816 Softstart fault power supply unit (251)8.7.81 F2817 Overvoltage in power section (251)8.7.82 F2818 Phase failure (252)8.7.83 F2819 Mains failure (253)8.7.84 F2820 Braking resistor overload (253)8.7.85 F2821 Error in control of braking resistor (254)8.7.86 F2825 Switch-on threshold braking resistor too low (255)8.7.87 F2833 Ground fault in motor line (255)8.7.88 F2834 Contactor control error (256)8.7.89 F2835 Mains contactor wiring error (256)8.7.90 F2836 DC bus balancing monitor error (257)8.7.91 F2837 Contactor monitoring error (257)8.7.92 F2840 Error supply shutdown (257)8.7.93 F2860 Overcurrent in mains-side power section (258)8.7.94 F2890 Invalid device code (259)8.7.95 F2891 Incorrect interrupt timing (259)8.7.96 F2892 Hardware variant not supported (259)8.8 SERCOS Error Codes / Error Messages of Serial Communication (259)9 Warnings (Exxxx) (263)9.1 Fatal Warnings (E8xxx) (263)9.1.1 Behavior in the Case of Fatal Warnings (263)9.1.2 E8025 Overvoltage in power section (263)9.1.3 E8026 Undervoltage in power section (264)9.1.4 E8027 Safe torque off while drive enabled (265)9.1.5 E8028 Overcurrent in power section (265)9.1.6 E8029 Positive position limit exceeded (266)9.1.7 E8030 Negative position limit exceeded (267)9.1.8 E8034 Emergency-Stop (268)9.1.9 E8040 Torque/force actual value limit active (268)9.1.10 E8041 Current limit active (269)9.1.11 E8042 Both travel range limit switches activated (269)9.1.12 E8043 Positive travel range limit switch activated (270)9.1.13 E8044 Negative travel range limit switch activated (271)9.1.14 E8055 Motor overload, current limit active (271)9.1.15 E8057 Device overload, current limit active (272)X/XXII Bosch Rexroth AG | Electric Drivesand ControlsRexroth IndraDrive | Troubleshooting GuideTable of ContentsPage9.1.16 E8058 Drive system not ready for operation (273)9.1.17 E8260 Torque/force command value limit active (273)9.1.18 E8802 PLL is not synchronized (274)9.1.19 E8814 Undervoltage in mains (275)9.1.20 E8815 Overvoltage in mains (275)9.1.21 E8818 Phase failure (276)9.1.22 E8819 Mains failure (276)9.2 Warnings of Category E4xxx (277)9.2.1 E4001 Double MST failure shutdown (277)9.2.2 E4002 Double MDT failure shutdown (278)9.2.3 E4005 No command value input via master communication (279)9.2.4 E4007 SERCOS III: Consumer connection failed (280)9.2.5 E4008 Invalid addressing command value data container A (280)9.2.6 E4009 Invalid addressing actual value data container A (281)9.2.7 E4010 Slave not scanned or address 0 (281)9.2.8 E4012 Maximum number of CCD slaves exceeded (282)9.2.9 E4013 Incorrect CCD addressing (282)9.2.10 E4014 Incorrect phase switch of CCD slaves (283)9.3 Possible Warnings When Operating Safety Technology (E3xxx) (283)9.3.1 Behavior in Case a Safety Technology Warning Occurs (283)9.3.2 E3100 Error when checking input signals (284)9.3.3 E3101 Error when checking acknowledgment signal (284)9.3.4 E3102 Actual position values validation error (285)9.3.5 E3103 Dynamization failed (285)9.3.6 E3104 Safety parameters validation error (286)9.3.7 E3105 Validation error of safe operation mode (286)9.3.8 E3106 System error safety technology (287)9.3.9 E3107 Safe reference missing (287)9.3.10 E3108 Safely-monitored deceleration exceeded (288)9.3.11 E3110 Time interval of forced dynamization exceeded (289)9.3.12 E3115 Prewarning, end of brake check time interval (289)9.3.13 E3116 Nominal load torque of holding system reached (290)9.4 Non-Fatal Warnings (E2xxx) (290)9.4.1 Behavior in Case a Non-Fatal Warning Occurs (290)9.4.2 E2010 Position control with encoder 2 not possible (291)9.4.3 E2011 PLC - Warning no. 1 (291)9.4.4 E2012 PLC - Warning no. 2 (291)9.4.5 E2013 PLC - Warning no. 3 (292)9.4.6 E2014 PLC - Warning no. 4 (292)9.4.7 E2021 Motor temperature outside of measuring range (292)9.4.8 E2026 Undervoltage in power section (293)9.4.9 E2040 Device overtemperature 2 prewarning (294)9.4.10 E2047 Interpolation velocity = 0 (294)9.4.11 E2048 Interpolation acceleration = 0 (295)9.4.12 E2049 Positioning velocity >= limit value (296)9.4.13 E2050 Device overtemp. Prewarning (297)Troubleshooting Guide | Rexroth IndraDrive Electric Drivesand Controls| Bosch Rexroth AG XI/XXIITable of ContentsPage9.4.14 E2051 Motor overtemp. prewarning (298)9.4.15 E2053 Target position out of travel range (298)9.4.16 E2054 Not homed (300)9.4.17 E2055 Feedrate override S-0-0108 = 0 (300)9.4.18 E2056 Torque limit = 0 (301)9.4.19 E2058 Selected positioning block has not been programmed (302)9.4.20 E2059 Velocity command value limit active (302)9.4.21 E2061 Device overload prewarning (303)9.4.22 E2063 Velocity command value > limit value (304)9.4.23 E2064 Target position out of num. range (304)9.4.24 E2069 Holding brake torque too low (305)9.4.25 E2070 Acceleration limit active (306)9.4.26 E2074 Encoder 1: Encoder signals disturbed (306)9.4.27 E2075 Encoder 2: Encoder signals disturbed (307)9.4.28 E2076 Measuring encoder: Encoder signals disturbed (308)9.4.29 E2077 Absolute encoder monitoring, motor encoder (encoder alarm) (308)9.4.30 E2078 Absolute encoder monitoring, opt. encoder (encoder alarm) (309)9.4.31 E2079 Absolute enc. monitoring, measuring encoder (encoder alarm) (309)9.4.32 E2086 Prewarning supply module overload (310)9.4.33 E2092 Internal synchronization defective (310)9.4.34 E2100 Positioning velocity of master axis generator too high (311)9.4.35 E2101 Acceleration of master axis generator is zero (312)9.4.36 E2140 CCD error at node (312)9.4.37 E2270 Analog input 1 or 2, wire break (312)9.4.38 E2802 HW control of braking resistor (313)9.4.39 E2810 Drive system not ready for operation (314)9.4.40 E2814 Undervoltage in mains (314)9.4.41 E2816 Undervoltage in power section (314)9.4.42 E2818 Phase failure (315)9.4.43 E2819 Mains failure (315)9.4.44 E2820 Braking resistor overload prewarning (316)9.4.45 E2829 Not ready for power on (316)。

Net Customisation User Guide

Net Customisation User Guide

.NET Customization User GuideAVEVA Solutions LtdDisclaimerInformation of a technical nature, and particulars of the product and its use, is given by AVEVA Solutions Ltd and its subsidiaries without warranty. AVEVA Solutions Ltd and its subsidiaries disclaim any and all warranties and conditions, expressed or implied, to the fullest extent permitted by law. Neither the author nor AVEVA Solutions Ltd, or any of its subsidiaries, shall be liable to any person or entity for any actions, claims, loss or damage arising from the use or possession of any information, particulars, or errors in this publication, or any incorrect use of the product, whatsoever.CopyrightCopyright and all other intellectual property rights in this manual and the associated software, and every part of it (including source code, object code, any data contained in it, the manual and any other documentation supplied with it) belongs to AVEVA Solutions Ltd or its subsidiaries.All other rights are reserved to AVEVA Solutions Ltd and its subsidiaries. The information contained in this document is commercially sensitive, and shall not be copied, reproduced, stored in a retrieval system, or transmitted without the prior written permission of AVEVA Solutions Ltd Where such permission is granted, it expressly requires that this Disclaimer and Copyright notice is prominently displayed at the beginning of every copy that is made.The manual and associated documentation may not be adapted, reproduced, or copied, in any material or electronic form, without the prior written permission of AVEVA Solutions Ltd. The user may also not reverse engineer, decompile, copy, or adapt the associated software. Neither the whole, nor part of the product described in this publication may be incorporated into any third-party software, product, machine, or system without the prior written permission of AVEVA Solutions Ltd, save as permitted by law. Any such unauthorised action is strictly prohibited, and may give rise to civil liabilities and criminal prosecution.The AVEVA products described in this guide are to be installed and operated strictly in accordance with the terms and conditions of the respective licence agreements, and in accordance with the relevant User Documentation. Unauthorised or unlicensed use of the product is strictly prohibited.First published September 2007© AVEVA Solutions Ltd, and its subsidiaries 2007AVEVA Solutions Ltd, High Cross, Madingley Road, Cambridge, CB3 0HB, United KingdomTrademarksAVEVA and Tribon are registered trademarks of AVEVA Solutions Ltd or its subsidiaries. Unauthorised use of the AVEVA or Tribon trademarks is strictly forbidden.AVEVA product names are trademarks or registered trademarks of AVEVA Solutions Ltd or its subsidiaries, registered in the UK, Europe and other countries (worldwide).The copyright, trade mark rights, or other intellectual property rights in any other product, its name or logo belongs to its respective owner.AVEVA .NET CustomizationContents Page.NET Customization User GuideIntroduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1:1 About this Guide . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:1 .NET Customization Architecture. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:1 Common Application Framework Interfaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:2 Database Interfaces. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:2 Geometry Interfaces. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:3 Shared Interfaces. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:3 Utilities Interfaces. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:4 Graphics Interfaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:4 Sample Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:4 AttributeBrowserAddin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:4 ExamplesAddin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:4 NetGridExample. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:4 PMLNetExample . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:4 PMLGridExample. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:5 Reference Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:5 Compatibility with future versions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:5How to Write an Addin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2:1 The IAddin Interface. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:1 The WindowManager. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:3 Window Creation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:3IWindow Interface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:4 Window Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:4WindowManager Events. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:5 The StatusBar. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:5Addin Commands . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:6 Writing a Command Class . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:6 Command Events. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:9 Resource Manager. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:9 Configuring a Module to Load an Addin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:9 Menu and Command Bar Customization . . . . . . . . . . . . . . . . . . . . .3:1 Configuring a Module to Load a UIC File. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:1 Editing the UIC File . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:2 Selection of Active Customization File . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:3 The Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:4Selecting a Node in the Tree. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:5 Drag & Drop within the Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:5 Node Context Menus. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:5 List of Command Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:6 Selecting a Node in the List. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:6 Drag & Drop from the List to the Tree. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:6 List Context Menu. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:7 Tool Types. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:8 Sorting List via Heading . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:10 Property Grid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:10 Action Buttons . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:12 Resource Editor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:13 Resource Editor Command Bar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:14 Using Resources for Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:16 Standalone Resource Editor. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:16Database Interface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4:1 Data Model Definition Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1 DbElementType . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1Overview. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1 Constructors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1 Methods. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:2 Related ENUMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:2 Related Pseudo Attributes. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:2 DbAttribute. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:3 Overview. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:3 Constructors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:3 Methods. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:3 Related ENUMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:4 DbElementTypeInstance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:4 DbAttributeInstance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:4Element access . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:5 DbElement Basics. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:5 Overview. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:5 Constructors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:5 Identity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:5 Element Validity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:6 Error Handling. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:6 Basic Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:6 Navigation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:7 Basic Navigation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:7 Pseudo Attributes Relating to Element Navigation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:8 Secondary Hierarchies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:8 Getting Attribute Values. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:9 Basic Mechanism . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:9 List of Valid Attributes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:10 Qualifier. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:11 Getting an Attribute as a Formatted String . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:11 Database Modifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:11 Overview. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:11 The Modification Pipeline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:12 Claiming Elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:13 Pseudo Attributes Relating to Claims . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:13 Set Attribute. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:14 Creating Element. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:14 Moving Element. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:15 Changing Type . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:15 Pseudo Attributes Relating to Modifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:15 Storage of Rules and Expressions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:16 Database Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:16 Rules. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:17 Pseudo Attributes Relating to Rules and Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:17 Comparison of Data with Earlier Sessions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:17Filters/Iterators. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:19 Iterators. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:19 Filters. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:19Dabacon Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:19 Overview of Dabacon Tables. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:19 Table Classes. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:20 DBs, MDBs and Projects. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:21 MDB Functionality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:21 DB Functionality. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:22 Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:23 Overview of Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:23 Overview of C# Mechanism. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:23 General Capture of DB Changes. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:24Adding Pseudo Attribute Code. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:24 DB/MDB Related Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:26PMLNet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .5:1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:1 Design Details . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:1 Using PMLNet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:1Limitations. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:2 Object Names . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:3 Query Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:3 Global Method. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:4 Method Arguments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:4 Method Overloading . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:5 Custom Attributes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:5 Private Data and Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:6 Scope. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:6 Instantiation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:7 ToString() Method. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:7 Method Names . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:7 Double Precision. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:7 Events. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:7 Error Handling. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:8 Rules for Calling .NET. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:8 Tracing. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:9 .NET Controls. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:9 Creating a Container. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:9 Hosting .NET Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:10 Events. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:10 Examples. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:10 PMLGridExample . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:10 PMLNetExample. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:10The AVEVA C# Grid Control. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .6:1Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:1 Creating a C# Addin which Contains an AVEVA Grid Control. . . . . . . . . . . . . . 6:1 Providing Access to the Addin in PDMS Design or Outfitting Design . . . . . . . 6:3 Using the AVEVA Grid Control with Different Data Sources: . . . . . . . . . . . . . . 6:4 Adding an XML Menu to the Form . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:5 Adding an Event to the Addin. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:6 Other Functionality Available within the PDMS Environment. . . . . . . . . . . . . . 6:7 Use of the C# Grid Control with PML. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:7 AVEVA Grid Control API . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:7 Input Mask Characters. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:121Introduction1.1About this GuideThis manual is designed to give a software engineer with experience of softwaredevelopment in C# using Visual Studio guidance on the development of .NET customizationfor the AVEVA PDMS and AVEVA Marine products. Customization ArchitectureThe introduction of a customization capability using Microsoft .NET technology has openedup a whole new world of customization and is particularly relevant for the integration ofAVEVA products with other customer systems. .NET API's provided access to variousaspects of the product including Graphical User Interface, Database and Geometry.As part of AVEVA's strategy of 'continual progression' the .NET customization capability hasbeen introduced in such a way that it can be used alongside the existing PML basedcustomization. Through the use of , an enhancement to PML which allows thePML programmer to call .NET code, customization which utilizes the strengths of .NETcompiled code and PML can be achieved.Figure 1: customization ArchitectureThe above diagram illustrates the two new methods of customization using .NETtechnology. The first is via the concept of a .NET Addin and the second using .Both methods provide a mechanism whereby a .NET assembly (dll) can be dynamicallyloaded into a module at runtime.1.2.1Common Application Framework InterfacesThe Common Application Framework (CAF) is an extensible framework which provides the.NET programmer with access to various services which support both applicationdevelopment and customization. The foundations of the CAF are provided by the twointerface assemblies:•Aveva.ApplicationFramework.dll•Aveva.ApplicationFramework.Presentation.dllThese interfaces provide the following major services:Namespace: Aveva.ApplicationFramework•AddinManager: This class provides properties and methods for the management of ApplicationFramework Addins.•ServiceManager: This class defines an interface which provides a means by which the various components of the ApplicationFramework can publish their services. TheServiceManager also acts as a service provider responding to requests for services. Itcan also be used by applications and application addins to publish additional services.•SettingsManager: This class provides properties and methods for the management of application settings which are stored in settings groups which are persisted betweensessions.Namespace: Aveva.ApplicationFramework.Presentation•CommandBarManager: This provides access to the menus and commandbars of a CAF based application. It also has methods to load the definition of menus andcommandbars from User Interface customization (UIC) files.•CommandManager: This class defines an interface to provide the presentation framework client with a mechanism for the management of command objects whichcan be associated with Tools or other User interface objects. The action of invoking atool (e.g clicking a ButtonTool) will cause the execution of the associated commandobject. It is possible to associated the same command object with a number of differentuser interface objects (e.g. ButtonTool on a Menu and a LinkLabel) thereby allowing forthe centralisation of these user interface objects action within a command. Variousstate-like properties of a command (e.g. enabled/checked) would also be reflected in alluser interface objects associated with a command. For example, disabling a commandwould cause all associated user interface objects to be disabled. User interface objectsare associated with a command via a CommandExecutor derived class.•ResourceManager: This class defines an interface to provide Addins with a simplified mechanism to access localizable resources.The ResourceManager provides a numberof methods which allows an addin to then access the various types of resources (string,image, cursor, icon etc.) which resource files may contain.•WindowManager: This provides access to the main application window, the StatusBar and a collection of MDI and docked windows. It also provides the addin writer withmethods to create MDI and docked windows to host user controls.1.2.2Database InterfacesThe database related interfaces are provided by the interface assemblies:•Aveva.Pdms.Database.dll & PDMSFilters.dllThis interface has the following main classes:Namespace: Aveva.Pdms.Database•DatabaseService: The sole purpose of this class is to open a project.。

Adobe Acrobat SDK 开发者指南说明书

Adobe Acrobat SDK 开发者指南说明书
Please remember that existing artwork or images that you may want to include in your project may be protected under copyright law. The unauthorized incorporation of such material into your new work could be a violation of the rights of the copyright owner. Please be sure to obtain any permission required from the copyright owner.
This guide is governed by the Adobe Acrobat SDK License Agreement and may be used or copied only in accordance with the terms of this agreement. Except as permitted by any such agreement, no part of this guide may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, recording, or otherwise, without the prior written permission of Adobe. Please note that the content in this guide is protected under copyright law.

Non parametric S tistics

Non parametric S tistics
20
Example
Is the data for this new line normally distributed?
If the data for Line 1 can be transformed to approximate a normal distribution, should you proceed?
10
Example
0.084 0.083
Box-Cox Plot for Epoxy 1
Last Iteration Info
Lambda Low -0.843 Est -0.786 Up -0.729
StDev 0.082 0.082 0.082
0.082
-5 -4 -3 -2 -1 0 1 2 3 4 5
Hi
Hi
Hi
2.705
2.830
Verify if velocity has a significant effect on the amount of epoxy dispensed.
14
Example
Stat Nonparametrics 1-Sample Wilcoxon
15
Example
Wilcoxon Signed Rank Test: Delta
Test of median = 0.000000 versus median not = 0.000000
Delta
N for Wilcoxon
Estimated
N Test Statistic P Median
8 8 34.0 0.030 1.110
21
Example
Epoxy dispensed by Line 2 is normally distributed. No! Transforming a data set changes the scale of measurement for that data set. Comparing 2 data sets with different scales is not acceptable. Pending on the deviation from normality. The safest course of action is to perform both tests and choose the test that is more powerful, i.e. the one that yields the lowest p-value.

non-scaled floating point model -回复

non-scaled floating point model -回复

non-scaled floating point model -回复什么是非标度(nonscaled)浮点模型?非标度浮点模型是一种计算机科学中用于表示和处理浮点数的方法。

与传统的标度浮点模型不同,非标度浮点模型使用固定的小数点位置,而不是使用可变的尾数。

这种模型的目的是提供高精度的数值计算,减少舍入误差,并且在同等硬件资源下可能提供更高的性能。

非标度浮点模型被广泛应用于科学计算、金融建模、机器学习和其他需要高精度计算的领域。

非标度浮点模型的核心思想是将浮点数表示为一个固定长度的二进制表示,并使用一个固定的小数点位置来表示小数部分。

这种模型的一个重要特点是它可以提供任意精度的计算,不受固定位数的限制。

这意味着它可以在更高的精度下执行数学运算,并且不会丢失任何精度。

在非标度浮点模型中,浮点数表示为一个小数部分和一个指数部分的乘积。

小数部分通常表示为一个正数,小数点固定在最左边的位上,而指数部分表示为一个带符号的整数,用来表示数的大小。

这种表示方法允许浮点数的大小范围更大,同时提供更高的精度。

非标度浮点模型有许多优点。

首先,它可以提供高精度的计算,特别适用于需要进行大量累积误差的情况下。

其次,非标度浮点模型可以在相同的硬件资源下提供更高的计算性能。

因为它使用固定的小数点位置,所以计算的速度更快,不需要进行复杂的位移和对齐计算。

然而,非标度浮点模型也存在一些挑战和限制。

首先,它需要更多的存储空间来表示浮点数,因为它使用了固定的小数点位置。

此外,由于它不使用尾数,它可能无法表示非常小或非常大的数字。

此外,非标度浮点模型的实现较为复杂,需要特殊的硬件支持和算法。

总的来说,非标度浮点模型是一种用于表示和处理浮点数的高精度方法。

它使用固定的小数点位置来表示小数部分,并且可以提供任意精度的计算。

虽然它具有一些限制和挑战,但它在需要高精度计算和更高性能的场景中是一个有价值的选择。

在未来,随着计算机科学的进步,我们可以期待更多使用非标度浮点模型的应用和研究。

types of omission errors -回复

types of omission errors -回复

types of omission errors -回复什么是遗漏错误?遗漏错误是指在写作过程中,由于疏忽或疏忽大意而未能包含应该出现在文章中的重要信息、观点或内容。

这些错误可以包括缺失关键字、漏掉整个句子或段落等情况。

遗漏错误可能导致文章内容不完整、逻辑不连贯或信息不准确,从而降低文章的质量和可读性。

遗漏错误的类型:1. 缺失关键词:在写作过程中,作者可能会忽略掉重要的关键词,导致文章的表达不准确或信息不完整。

例如,当讨论“环境保护”时,如果遗漏了关键词“可持续性”,读者可能会误解作者的意图或丧失对文章的兴趣。

2. 漏掉句子或段落:在编辑或修改文章时,作者可能会意外地删除了句子或段落,导致文章的逻辑不完整或内容缺失。

这种错误可能会使读者很难理解作者的观点或意图。

3. 忽视事实或数据:在引用和支持论点的过程中,作者可能会忽视重要的事实或数据,导致文章的可信度和说服力降低。

这种错误可能会使读者质疑作者的观点或怀疑其研究方法。

4. 遗漏相关背景信息:在写作过程中,作者可能会遗漏介绍相关背景信息的必要性,导致读者对于主题的理解不全面或有所欠缺。

这种错误可能会使读者感到困惑或无法与文章内容产生共鸣。

5. 漏掉引述或引文:在引用其他来源的观点或研究结果时,作者可能会忽略将这些引述或引文正确地插入到文章中,导致文章的引用格式不规范或内容缺失。

这种错误可能会使读者难以验证作者的来源或理解他们的观点。

如何避免遗漏错误:1. 仔细计划和组织:在开始写作之前,制定清晰的大纲和提纲,确保所有重要的观点和信息都被列入其中。

这有助于减少在写作过程中遗漏关键内容的可能性。

2. 审慎修改和编辑:在编辑和修改文章时,仔细检查每个句子和段落,确保没有遗漏重要的观点或内容。

可以采用逐句或逐段的方式进行审查,以确保每个部分的逻辑和信息完整。

3. 使用大纲和提纲作为参考:在编辑和修改过程中,使用大纲和提纲作为参考,确保文章的组织结构和逻辑是完整和连贯的。

not informal parameter list

not informal parameter list

not informal parameter list
不正式参数列表(notinformalparameterlist)是指在编程中,函数或方法的参数没有明确的定义和说明。

在一些情况下,开发者会使用一些不规范的方式来定义函数的参数,这就会导致代码的可读性和可维护性降低,出现一些潜在的问题。

在实际开发中,我们应该尽量避免使用不正式的参数列表,而应该使用规范的方式来定义函数的参数。

这样可以减少出错的可能性,提高代码的可读性和可维护性。

有些开发者可能会觉得,使用不正式的参数列表会让代码更加简洁和灵活。

但事实上,这只是一种错误的观念。

在编写代码时,我们应该注重代码的可读性和可维护性,而不是追求简洁和灵活。

使用不正式的参数列表还会导致一些潜在的问题。

例如,在调用函数时,如果参数的顺序不正确,就可能会导致程序出错。

此外,如果函数的参数过多或过少,也会导致程序出错。

这些问题可能会在编译期间产生错误,也可能会在运行时出现问题。

为了避免这些问题,我们应该使用规范的方式来定义函数的参数。

在定义函数时,应该明确参数的名称、类型和默认值(如果有)。


样可以让调用函数的代码更加清晰和易懂,减少出错的可能性。

总之,不正式的参数列表是一种不规范的编程方式,会影响代码的可读性和可维护性,容易导致程序出错。

因此,在编写代码时,我们应该尽量避免使用不正式的参数列表,而应该使用规范的方式来定义函数的参数,让代码更加清晰、易读和易于维护。

unknown discriminator value

unknown discriminator value

unknown discriminator value
在计算机科学中,辨识值(Discriminator)是一种枚举类型,用于标识特定类型的对象。

例如,如果我们有一个“动物”类,我们可能会使用辨识值来标识不同的动物子类,如“狗”、“猫”和“鸟”。

但是,当我们遇到无法识别辨识值的情况时,我们称之为“未知辨识值”。

未知辨识值可能是由于多种原因引起的,例如版本不匹配、数据损坏或意外的错误。

无论原因是什么,处理未知辨识值是编程中的一个常见任务,因为我们需要确保程序在遇到无法识别的对象时仍能正常运行。

一种常见的处理未知辨识值的方法是使用默认值。

例如,在上面提到的动物类例子中,我们可以将默认值设置为“未知动物”,并在遇到无法识别的动物子类时使用该值。

这样做可以确保程序不会因遇到未知辨识值而崩溃或出现错误结果,而是将其视为一个未知的但仍然有效的对象。

另一种处理未知辨识值的方法是抛出异常。

这意味着当程序遇到无法识别的辨识值时,它将抛出一个错误并停止运行。

这可以确保程序不会继续进行并产生错误结果,但同时也需要我们在代码中处理异常并确保程序能够正常运行。

无论我们选择哪种处理未知辨识值的方法,都需要在设计程序时考虑到这一点,并确保程序在遇到无法识别的对象时能够正常运行。

这样做可以帮助我们避免一些常见的错误,并确保我们的程序能够在
各种情况下都能够正常运行。

parameterizedtypereference fortype -回复

parameterizedtypereference fortype -回复

parameterizedtypereference fortype -回复什么是参数化类型引用?参数化类型引用是一种用于指定具体类型参数的语法结构,在许多编程语言中都被广泛使用。

参数化类型引用通常由尖括号(<>)括起来,紧跟在一个类型名称后面。

它的主要作用是允许我们在使用一些通用数据结构或方法时,根据实际情况将其参数化,以适应不同类型的数据。

现代编程语言中使用参数化类型引用的一个典型例子是泛型(Generics)。

泛型是一种让代码更加通用和模块化的编程范式。

它允许我们在定义类、函数或方法时,不指定具体的类型,而是将其抽象为一个或多个类型参数。

这样一来,我们可以根据实际需求将具体类型传递给这些参数,使得代码能够处理不同类型的数据。

在Java中,我们可以定义一个泛型类或方法,并使用参数化类型引用来指定其类型参数。

例如,我们可以定义一个泛型类List<T>,其中T是一个类型参数。

当我们使用List<T>时,可以根据需要将具体的类型传递给T。

比如,我们可以创建一个List<String>对象,其中的元素类型为字符串。

泛型的优势在于它提供了类型安全和代码重用的机制。

通过参数化类型引用,我们可以在编译时检查类型,避免在运行时出现类型不匹配的错误。

此外,泛型还可以提高代码的可读性和可维护性,因为它允许我们在一个地方定义通用的数据结构或方法,并且可以在不修改代码的情况下,适应不同类型的数据。

当然,泛型不仅仅局限于Java语言,许多其他编程语言也提供了类似的机制。

例如,在C++中,我们可以使用模板(Template)来实现泛型。

在C#中,我们可以使用泛型(Generic)实现类似的功能。

每种语言的具体语法细节和特性可能有所不同,但它们的本质都是通过参数化类型引用来支持泛型。

总结起来,参数化类型引用是一种用于指定具体类型参数的语法结构,广泛应用于现代编程语言的泛型机制中。

omitting the parameter name -回复

omitting the parameter name -回复

omitting the parameter name -回复为什么要省略函数参数名称?在编程中,有时候我们会遇到需要省略函数参数名称的情况。

虽然函数参数名称对于代码的可读性和理解性很重要,但有时候由于特定的需求或者代码风格的要求,我们可能会选择省略参数名称。

下面将详细介绍几个常见的情况和理由。

1. 参数名称已经在函数名中提到有时候函数名已经非常明确地表达了参数的含义,不再需要在参数列表中重复显示参数名称。

在这种情况下,省略参数名称可以使函数的调用更简洁,减少不必要的冗余。

例如,考虑一个计算两个数之和的函数,我们可以将其命名为`add`。

由于函数名已经表明了函数的作用,我们可以省略参数名称,直接将参数值传递给函数。

pythondef add(a, b):return a + bpythonresult = add(3, 5)print(result) # 输出: 8在这个例子中,我们省略了参数名称,因为函数名本身已经清楚地表达了它的功能。

2. 参数类型明确且唯一当函数的参数类型非常明确且唯一时,我们可以根据约定俗成的命名规则来省略参数名称。

例如,当函数参数是一个整数时,我们可以将其命名为`num`。

在这种情况下,省略参数名称可以使代码更简洁、易读且易于理解。

pythondef double(num):return num * 2pythonresult = double(4)print(result) # 输出: 8在这个例子中,因为参数类型已经明确为整数,我们可以省略参数名称,直接使用`num`代替。

3. 参数顺序和位置很重要有时候函数的参数顺序和位置非常重要,并且已经被广泛接受为约定俗成。

在这种情况下,省略参数名称可以增加代码的可读性,并且减少函数调用时的冗余。

例如,考虑一个函数用于创建一个具有给定尺寸和颜色的矩形。

根据约定俗成,一般来说,我们将先指定矩形的宽度,再指定矩形的高度,并最后指定矩形的颜色。

non-parametric

non-parametric

On combining graph-partitioning withnon-parametric clustering for image segmentationAleix M.Mart ınez,a,*Pradit Mittrapiyanuruk,band Avinash C.Kak baDepartment of Electrical and Computer Engineering,The Ohio State University,OH 43210,USA b School of Electrical and Computer Engineering,Purdue University,West Lafayette,IN 47907,USAReceived 10June 2002;accepted 30January 2004Available online 8May 2004AbstractThe goal of this communication is to suggest an alternative implementation of the k -way Ncut approach for image segmentation.We believe that our implementation alleviates a prob-lem associated with the Ncut algorithm for some types of images:its tendency to partition re-gions that are nearly uniform with respect to the segmentation parameter.Previous implementations have used the k -means algorithm to cluster the data in the eigenspace of the affinity matrix.In the k -means based implementations,the number of clusters is estimated by minimizing a function that represents the quality of the results produced by each possible value of k .Our proposed approach uses the clustering algorithm of Koontz and Fukunaga in which k is automatically selected as clusters are formed (in a single iteration).We show com-parison results obtained with the two different approaches to non-parametric clustering.The Ncut generated oversegmentations are further suppressed by a grouping stage—also Ncut based—in our implementation.The affinity matrix for the grouping stage uses similarity based on the mean values of the segments.Ó2004Elsevier Inc.All rights reserved.*Corresponding author.1-765-494-0880.E-mail addresses:aleix@ (A.M.Mart ınez),mitrapiy@ (P.Mittrapiyan-uruk),kak@ (A.C.Kak).1077-3142/$-see front matter Ó2004Elsevier Inc.All rights reserved.doi:10.1016/j.cviu.2004.01.003Computer Vision and Image Understanding 95(2004)72–85/locate/cviu1.IntroductionImage segmentation is an importantfirst step in much of computer vision.Several algorithms have been introduced to tackle this problem.Among them are ap-proaches based on graph partitioning[9,19,21,22,26].The graph approaches carry the appeal of strong theoretical basis and the advantage of being applicable not only to the segmentation of images,but also to other low,mid,and high level vision tasks dealing with mid-level grouping and model-fitting[9,17,18].For grouping pixels into regions with a graph-theoretic approach,a graph is usu-ally defined as G¼ðV;EÞ,where the nodes V represent the pixels(one node per pix-el)and the edges E represent the weights wði;jÞthat connect pairs of nodes.E is generally represented by an nÂn matrix,where n is the number of pixels in the im-age.One of the most frequently used techniques to partition a graph is by means of the cut cost function[1,26].The goal of the cut algorithm is tofind two sub-graphs A and B of G that minimize the value ofcutðA;BÞ¼Xi2A;j2Bwði;jÞð1Þand with the obvious constraints A[B¼V,A\B¼;,and A¼;,B¼;.Several alternatives to the above criterion have been proposed to date[4,5,11,20,21,24,25]. Of particular note is the normalized cut criterion(Ncut)of Shi and Malik[21],which attempts to rectify the tendency of the cut algorithm to prefer isolated nodes of the graph(as shown in Fig.1A).The Ncut criterion consists of minimizingNcutðA;BÞ¼cutðA;BÞassocðA;VÞþcutðA;BÞassocðB;VÞ;ð2Þwhere assocðA;VÞ¼Pi2A;j2Vwði;jÞ,which intuitively represents the connection costfrom the nodes in the sub-graph A to all nodes in the graph V.By dividing the graph into two disjoint parts as given by the eigenvector corre-sponding to the second smallest eigenvalue1of the Laplacian[7,12],we obtain a 2-way partition of the graph.In most cases,however,we usually want to partition (segment)an image into a larger number of parts;i.e.,we want a k-way partitioning algorithm which divides our image into k parts.We can achieve this hierarchically by dividing each resulting sub-graph into two other disjoint groups until no further di-vision is necessary(which will happen when the vertices of that subgroup are similar enough to each other)[1,21,26].The method described in the preceding paragraph although adequate is time con-suming because we need to apply our algorithm at each new iteration of the hierar-1The smallest eigenvalue of the Laplacian matrix is always zero and its associated smallest eigenvector is all ones.The magnitude of the second smallest eigenvalue is related to the‘‘fullness’’of the connections in the graph(in the sense of the nodes being connected with large values of wði;jÞ).With regard to the interpretation to be given to the corresponding eigenvector,note that each element of the eigenvector stands for a pixel location in the image.The i th element of this eigenvector tells us how much the i th pixel in the image is connected with the rest of the image[7,15].A.M.Mart ınez et al./Computer Vision and Image Understanding95(2004)72–8573chy.Ideally,we would like to have a direct k -way algorithm which outputs the k dis-joint areas in a single iteration [3,6,10].A common solution is to make use of more than one single eigenvector for classification [1,12].By using e eigenvectors starting from the second smallest,we can convert our partitioning problem into a clustering problem.Intuitively,while the second smallest eigenvector divides the graph into two parts,consecutive eigenvectors will add extra possible partitions (i.e.,we will obtain more detailed segmentations as the number of eigenvectors increases).Indeed,it has been proven for the cut algorithm [2]that the more eigenvectors one uses,the better the results are (in the sense of finer results).2Shi and Malik [21]define a new criterion that can be used in a k -way algorithm,Ncut k ðA 1;A 2;...;A k Þ¼cut ðA 1;V ÀA 1Þassoc ðA 1;V Þþcut ðA 2;V ÀA 2Þassoc ðA 2;V ÞþÁÁÁþcut ðA k ;V ÀA k Þassoc ðA k ;V Þ;ð3ÞFig.1.(A)Cut tends to prefer isolated vectors (adapted from [21]).(B)Ncut can produce more-or-less bal-anced partitions.(C)An example of Ncut producing partitions at areas with constant brightness.(D)Graph-ical representation of Eq.(4);for which the minimum is 48—the corresponding result is shown in (C).2Intuitively,one can view the eigenvector decomposition as an approximation of the original space of G .The more eigenvectors we add to our eigenspace,the closer we will get to the original representation.74 A.M.Mart ınez et al./Computer Vision and Image Understanding 95(2004)72–85A.M.Mart ınez et al./Computer Vision and Image Understanding95(2004)72–8575 where A i is the i th sub-graph of G.Tal and Malik[23]used the k-means algorithm to find a pre-selected number of clusters within the space spanned by the non-zero, smallest e eigenvectors.For those cases where the number of clusters is not known, the authors proposed using several values of k and then selecting that k which minimized the criterionNcut kðA1;...;A kÞ=k2:ð4ÞWhile the Ncut criterion alleviates the tendency of the cut algorithm to isolate in-dividual nodes if they are‘‘distant’’from the rest,it appears to have its own shortcomings,some of them we believe caused by the structure of the Ncut criterion and some by issues related to how this criterion would generally be implemented.There is the tendency of the Ncut criterion to fragment image areas that are nearly homogeneous with respect to the segmentation parameter,as we show in Fig.1B. This problem becomes exacerbated in the k-way approach,especially as the dimen-sionality of the eigenspace increases and if the correct number of clusters is not known.An example of this problem is shown in Fig.1C where the fragmentation of the peppers is caused by this phenomenon.The number of clusters used for the segmentation in Fig.1C was estimated by minimizing the expression in Eq.(4). The value of this expression as a function of the number of clusters is shown in Fig.1D.The minimum was obtained for k¼48.The results shown in Figs.1C and D were obtained by using the similarity of pixels in brightness for the wði;jÞma-trix in the code made available by the Berkeley group.The value of k was varied from5to50.The reader may wonder how good the result showed in Fig.1C is as compared to those obtained with other values of k.Actually,this result is among the best one can obtain when using the k-means clustering approach.Although the result is oversegmented,most of the important segments are also present in the image.As demonstrated by the results shown above,the k-means approach may not al-ways rectify the fragmentation tendency of the Ncut algorithm.This is despite the fact that one can try tofind the correct value of k by the minimization of an objective function,such as the one in Eq.(4).This has led us to investigate other approaches to non-parametric clustering in the eigenspace of the affinity matrix.Obviously,each different approach to clustering entails its own method forfinding the number of clusters.For example,the method of Koontz and Fukunaga[13]has the advantage of automatically determining the optimal value of k as the data are grouped into clusters.Our work with the Koontz and Fukunaga algorithm shows that it is less sensitive to the Ncut problem introduced above.The comparative results for the ‘‘pepper’’image are shown in Figs.2A and B.Note how the new result shown in (A)is less oversegmented than the one shown in(B).Details of how we implemented the Koontz and Fukunaga algorithm are in Section2.Although the use of the non-parametric method of Koontz and Fukunaga can help to alleviate the Ncut problem mentioned above,it does not solve this com-pletely.As the reader might have already noted in the result shown in Fig.2A,there still exist some divisions that are caused by this problem;some of them have been highlighted in Fig.2C.To solve these remaining cases,we propose to include agrouping stage that attempts to correct the oversegmentation obtained by the Ncut algorithm.By oversegmentation,we refer to the undesirable,extra segments ob-tained when using the Ncut criterion.This grouping stage will thus regroup those areas that would otherwise be divided into two or more partitions.To achieve this though,we will need to modify the weights of our graph with a measure that is tailored to the Ncut problem discussed here.This we will describe in Section 3.In Section 4,we generalize and simplify the new approach defined in this commu-nication.Experimental results are in Section 5.We will conclude in Section 6.2.Segmentation as a clustering problemSo far,we have seen how to define the segmentation problem as a graph partition-ing one.The problem remains though as how to assign similarity values to the edges in the graph G .Several solutions have been proposed to tackle this.One that was recently shown to work well for a large number of images of different types is defined by w ði ;j Þ¼e Àk I i ÀI jkr 21Ãe Àd ði ;j Þr 22;d ði ;j Þ<R ;0;otherwise ;(ð5Þwhere I i is the brightness value of image I at pixel i ,d ði ;j Þthe Euclidean distance from pixel i to pixel j in the image plane,and r a control parameter [16,19,21,26].Once the weights are set,we can use the cut or the Ncut criterion to obtain a par-tition of the original graph defined by G .For the cut algorithm,this is achieved by first carrying out an eigen-analysis of the Laplacian matrix:Q l ¼kl ;ð6Þwhere Q ¼D ÀW ,with D ði ;j Þ¼deg ðv i Þ¼P n j ¼1w ði ;j Þ.W is the matrix whose ele-ments are w ði ;j Þ[1,26].For the Ncut approach,the eigenvectors are solutions of the generalized eigenvalue decomposition [21]:ðD ÀW Þl ¼k D l :ð7ÞIn both cases,one then retains a certain number,e ,of those eigenvectors whose eigenvalues are the smallest except the one whose eigenvalue is zero.Image segmen-tation is achieved by clustering in such an eigenspace.A natural way to achieve clustering is by finding the valleys of the densities in the eigenspace.Since,we often cannot assume a parametric form for these densities,a non-parametric method is called for.The method we will use is based on the val-ley-seeking algorithm advanced by Koontz and Fukunaga [13].What we accomplish by clustering is the mapping of the set of pixels f x 1;...;x n g in the eigenspace to a set of labels f z 1;...;z n g ;where z i is an integer between 1and m (the number of classes)and m 6n .Koontz and Fukunaga non-parametric method is based on the estimate of the density gradient,which is defined as the direction of a sample towards the center76 A.M.Mart ınez et al./Computer Vision and Image Understanding 95(2004)72–85of its cluster.To compute this density gradient,it is common to define a local region area CðXÞ,CðXÞ¼f Y:dðY;XÞ6r g;ð8Þwhere r is the radius of the local region where search for the gradient of the density takes place,and,d2ðY;XÞ¼ðYÀXÞT HÀ1ðYÀXÞis a distance measure with metric H.In most cases H¼I,to represent an Euclidean search.The local region as defined above has an associated expected vector(local mean) which we can define as,MðXÞ¼E½ðYÀXÞj CðXÞ ¼ZCðXÞðYÀXÞfðYÞu0d Y;ð9Þwhereu0¼ZCðXÞfðYÞd Y%fðXÞv:ð10ÞThe term u0is used as a normalizing factor given CðXÞ,v is the volume of CðXÞand fðÁÞstands for the density function[8].The local mean can now be used to define the direction of the gradient in C.Finally,this can be used to search for the valleys, which are opposite to the gradient.An easy way to achieve this is to start with an initial classification of the sample vectors and then move the initial‘‘valleys’’of each class(or,similarly,the class as-signment of each sample vector)opposite to the direction of the gradient of the den-sities[13].Formally,given the set of vectors X¼f x1;...;x n g(x i2½a;b ),we calculate an initial classification z0¼f z1;...;z n g as given by a set of equally separated classes.For each vector,x i,we set a local area Cðx iÞand compute the direction of the gra-dient of the density.A simple way to accomplish this is by counting the number of samples within the local region Cðx iÞfor each possible class.The vector x i is then re-classified as belonging to that class which has the largest number of votes in Cðx iÞ. This procedure is repeated until convergence is reached,meaning that no vector is re-assigned to a different class.During this process several classes will merge into one,and at the end the method will have the actual number of classes(clusters)of our representation.The Euclidean distance between vectors is generally used as a measure of similar-ity in the graph partitioning approach.Nonetheless,alternatives exist,as for exam-ple,the angle between each pair of vectors[4].Figs.2A and B show a comparison between the results obtained by using the ap-proach presented above and the k-means clustering algorithm as defined in[14,23]. These results were computed on an eigenspace of100dimensions,r¼0:5for the ra-dius of the C region,R¼5,r1¼0:1,and r2¼4.As to what number of eigenvectors to use,in Fig.2D we show the segmentation results obtained by clustering(using the method introduced above)in a10,20,30, 40,50,and100dimensional eigenspace(r¼0:5in all cases).We see that the larger the dimensionality,thefiner the results.We have experimentally observed,though,A.M.Mart ınez et al./Computer Vision and Image Understanding95(2004)72–8577Fig.2.(A,B)Comparison of the results obtained using the Koontz–Fukunaga clustering algorithm in our approach and the k -means algorithm as described in [14,22].(C)Some of the problems associated with the Koontz–Fukunaga based implementation are highlighted in the image.(D)Shown here are the segmenta-tion results obtained with Koontz–Fukunaga clustering in the eigenspace spanned by the e smallest eigen-vectors.The value e for each segmentation is as shown below theimage.Fig.3.The results get finer as we modify the value of r .78 A.M.Mart ınez et al./Computer Vision and Image Understanding 95(2004)72–85that increasing the number of eigenvectors over100does not result in a much more detailed segmentation for many of our images.It is interesting to observe(because it is somewhat non-intuitive)from thefigures that large blob-like objects do not necessarily show up as individual segments when the eigenspace has low-dimensionality.Such objects,in some cases,are hidden in the higher-dimensions of the eigenspace.So,as with practically all eigenspace based sys-tems,one would want to use the highest possible dimensionality for the eigenspace, subject of course to the limitations imposed by computational burden associated with clustering in very high dimensional spaces.While the dimensionality of the eigenspace has a great bearing on the granular-ity of the segments produced,another important influencing factor is the value of r,the radius of the search region.The larger the value of r,the fewer the number of clusters we will have in our e-dimensional space.By the same token,the smaller r is,thefiner the results will be.This effect is depicted in Fig.3with values of r varying from1to0:5for afixed dimensionality of the eigenspace,which was set at100.Based on what the theory says and our experimental observations,we believe that one should choose the largest possible value for the dimensionality of the eigenspace and a small enough value for r so as to result in an over-segmentation of the image. Obviously,an over-segmentation is to be preferred to an under-segmentation,be-cause the former contains all of the fragments that when grouped together would yield semantically meaningful objects.This then sets the stage for the next step, which is grouping.3.Grouping stageAs mentioned in Section1,the segmentation achieved by Ncut has a tendency to fragment an area of similar brightness into two or more segments.This problem is illustrated by the marked circles in the Ncut-based results in Fig.2C.To correct for this over-fragmentation,we will use a grouping stage to the overall segmentation algorithm.As we show in this section,this grouping can be achieved by a second application of the Ncut algorithm,but with each node in the graph repre-senting one segment produced by thefirst application of Ncut.We now associate with each node the mean gray level of all the pixels that are in the segment corre-sponding to that ing the mean gray level at each node takes advantage of the NcutÕs main tendency,which is to group together nodes that are similar.For the regrouping application of Ncut,we will use the following similarity func-tion for the adjacency nodes:wði;jÞ¼e Àðk S iÀS j kÞr;if nodes i and j share boundary pixels in the image;0;otherwise;(ð11Þwhere S i is the mean value of the brightness of all pixels in segment i.A.M.Mart ınez et al./Computer Vision and Image Understanding95(2004)72–857980 A.M.Mart ınez et al./Computer Vision and Image Understanding95(2004)72–85As was shown previously with the help of the results in Fig.2C,Ncut even with the non-parametric clustering incorporated in it tends to divide large constant areas into multiple segments.The reader might say that we could improve upon the Ncut results by choosing a larger value for R.But,unfortunately,as shown by the segmen-tation in Fig.4,the larger the value of this parameter,the smaller the precision in the delineation of the segments.This is where the second stage of grouping comes in.As was the case with thefirst application of Ncut,we are again faced with the question of how many eigenvectors to use in the eigen-representation of the new graph for the second-stage grouping.There is obviously no categorical answer to this question—which was also the case for thefirst application of Ncut.Nonetheless,it is interesting to explore the output of the second stage grouping as the number of ei-genvectors is increased.Obviously again,the larger the number of eigenvectors, the more likely that thefinal output will correspond to visually different objects in the image.We will now show the effect of the number of eigenvectors chosen on the quality of the grouping stage.Butfirst note that the number of eigenvectors is now limited to the number of segments obtained after thefirst application of Ncut.If thefirst ap-plication of Ncut results in m segments,our new affinity matrix(given by Eq.(11)),of size mÂm,will possess a maximum of mÀ1eigenvectors with associated non-zero eigenvalues.Recall from our previous discussion that it is a property of the affinity matrix that the smallest eigenvalue is always zero.For this study,we chose for ourfirst-stage processing the segments obtained with the100eigenvectors to give the grouping stage a sufficientlyfine decomposition of the image.The100-eigenvector segmentation produced by thefirst stage was shown earlier in Fig.2A.The number of segments shown in thefigure is48,implying that the eigenvector decomposition of the grouping-stage adjacency matrix will be limited to a maximum of47non-zero eigenvalues.Fig.5shows the results obtained from the grouping stage for different values of the number of eigenvectors retained as this number is increased to30.In thisfigure,the number of eigenvectors used for the grouping stage is indicated by the symbol e2.To distinguish this number from the number of eigenvectors used for thefirst application of Ncut,the previous(first) number will be represented by the symbol e1.4.Sub-images for computational efficiencyThe main computational burden of the processing described so far is in thefirst stage—thefirst application of Ncut.Even a small image,say of size100Â100,results in a10,000Â10,000adjacency matrix—a very large matrix indeed for eigen-analysis. To get around the difficulty of dealing with such large matrices,Malik et al.[14]have suggestedfirst dividing an image into sub-images,applying the Ncut to each sub-im-age separately,and then applying Ncut to the segments obtained in a second-stage grouping process.In this section,we will now pull the approach of Malik et al.[14]into our frame-work and arrive at a scheme that has the advantage of being computationallyFig.5.Results obtained after the second step with an eigenrepresentation of 100vectors in the first step and e 2eigenvectors in thesecond.Fig.6.(A)e 1¼10and r ¼0:3,(B)e 1¼20,and r ¼0:4,(C)e 1¼30and r ¼0:5,(D)e 1¼40and r ¼0:5.Fig.4.In an attempt to overcome the problems associated with Ncut,we make larger the value of the neighborhood factor,R ,to suppress the division of an area of constant brightness.However,this results in another problem,which is the loss of accuracy in the delineation of thesegments.Fig.7.e 1¼40,r 1¼0:5,e 2¼30,and r 2¼0:9.A.M.Mart ınez et al./Computer Vision and Image Understanding 95(2004)72–858182 A.M.Mart ınez et al./Computer Vision and Image Understanding95(2004)72–85efficient and at the same time that benefits from our non-parametric clustering and grouping criterion.Fig.6illustrates this approach.Note that the boundaries that connect each of the sub-images are now preserved in the output of thefirst application of Ncut.Our sec-ond-stage grouping treats the sub-image boundaries like any other boundaries be-tween the segments produced by thefirst stage.The rest of the processing proceeds just as before.Thefinal result is shown in Fig.7.5.Experimental resultsTo explain the various steps of our approach,the discussion so far used only one im-age.In this section,we show several additional results on different types of images.We will compare the segmentations obtained using our approach with those obtained with the method described in[14,23].As we did before,all the results shown will use an af-finity matrix that measures pixel similarities on the basis of the brightness levels.All of the experimental work shown in this sectionfirst partitions an image into 2Â3sub-images.In light of our previously mentioned rationale for partitioning an image into sub-images before thefirst application of Ncut,we retain only the smallest50eigenvector for this phase of our overall approach.Our experiments show that retaining fewer eigenvectors at this stage noticeably degrades the segmentations, in the sense that even large segments may disappear.And retaining more eigenvec-tors does not significantly improve the quality of thefinal segmentation.For the Koontz and Fukunaga clustering algorithm for thefirst application of Ncut,we used r1¼0:3.This value for the radius works well for the dimensionality of50for the eigenspace.Ordinarily,the larger the dimensionality of the space used for data representation,the larger the mean distance between the data points.This means that the value of r would increase with the dimensionality of the eigenspace.This brings us to the experimental parameters used for the second application of Ncut for the grouping stage.As the reader will recall from Section3,the full dimen-sionality of the eigenspace here is limited by the total number of segments produced by thefirst application of Ncut in all of the6sub-images.In the comparative results shown,we have used the dimensionality of100for all the images.However,we have also shown comparative results when all of the eigenvectors with non-zero eigen-values are retained.Fig.8A shows three images on which we will compare the performance of Koo-ntz–Fukunaga clustering with k-means clustering.Fig.8B shows the results pro-duced for the images using the Koontz–Fukunaga algorithm with the maximum number of eigenvectors retained in the grouping stage.Fig.8C shows the results ob-tained when only100eigenvectors are retained.And,to compare,Fig.8D shows the results produced with the k-means approach as described in[14,23].Finally,to show the versatility achieved when clustering is carried out with the Koontz–Fukunaga algorithm,we show additional comparative results in Figs.9 and10.For the comparisons shown in thesefigures,we have used only100eigenvec-tors in the grouping-stage application of Ncut for our approach.6.ConclusionsThis paper presented an alternative implementation of the k -way Ncut graph-partitioning approach to image segmentation [14,21,23].In ourimplementation,Fig.8.(A)Original images.(B)Segmentation with Koontz–Fukunaga clustering using all eigenvectors corresponding to non-zero eigenvalues and with r 2¼2:0.(C)Same as in (B)but with the number of ei-genvectors e 2equal to 100.(D)Segmentation results obtained with k-means clustering and with e 2¼100.Fig.9.For the two images shown,it is necessary to extract several segments corresponding to highly lo-calized detail.(A)Original images.(B)Segmentations obtained using Koontz–Fukunaga clustering with e 2¼100.(C)Segmentations obtained using k -means clustering with e 2¼100.A.M.Mart ınez et al./Computer Vision and Image Understanding 95(2004)72–8583。

SMARTFORM字段参数设置及系统变量

SMARTFORM字段参数设置及系统变量

Output Options for Field ContentsUse the Formatting options to adapt the value of a field before printing it. You can enter the relevant parameters directly behind the field name. Make sure to write the short forms of the different options in uppercase letters. Some of the options can be combined.General InformationThe formatting options are not suited for all data types of fields (for example, for character fields you need no exponential representation). You must distinguish between numeric fields and character fields.Numeric Fields∙If specified, the system first evaluates the length (<length>).∙If no length is specified, the system displays the value in its overall length.∙The trailing blank indicates a positive sign. To suppress it, use formatting option S.∙Any offset <offset> specified is ignored.Sequence of evaluation: (<length>), sign to the left(<),Japanese date (L), suppress blanks (C), right-justified display (R), insert fillers (F).Character FieldsBy default, the system displays the value of a field in its overall length, but truncates trailing blanks. Sequence of evaluation: suppress blanks (C), <offset> and (<length>), right-justified display (R), insert fillers (F).OverviewFormatting Options for FieldsSystem FieldsWithin a form you can use the field string SFSY with its system fields. During form processing the system replaces these fields with the corresponding values. The field values come from the SAP System or are results of the processing.System fields of Smart FormsWhen using the fields &SFSY-FORMPAGES&or &SFSY-JOBPAGES&you must keep all output pages in the main memory til the end of the form or the print job, to allow these fields to be replaced with their respective values. For large forms or print jobs, this may require a huge amount of memory space.。

fragmentsize和nomatchsize用法 -回复

fragmentsize和nomatchsize用法 -回复

fragmentsize和nomatchsize用法-回复首先,我们来了解什么是fragmentsize(片段大小)和nomatchsize(无匹配大小)。

这两个指标是在信息检索系统中使用的,用于优化搜索结果的呈现方式。

在信息检索系统中,当用户输入一个查询词,系统会返回一系列与查询词相关的文档。

然而,很多时候这些文档可能过长或者与用户的查询意图不完全匹配。

为了解决这个问题,信息检索系统会对文档进行分块处理,并通过fragmentsize和nomatchsize来控制和优化文档的展示效果。

首先,让我们来看看fragmentsize的使用。

fragmentsize表示每个文档中所呈现的片段的大小。

当用户查询一个词,系统会在文档中找到与之相关的文本片段,并将这些片段进行截取和呈现给用户。

fragmentsize的值决定了每个片段的大小。

如果fragmentsize的值较大,那么将显示更多的文本内容,用户可以更好地了解每个文档的主要部分。

然而,如果fragmentsize的值过大,可能会导致过长的文本片段,降低用户的浏览和阅读效率。

因此,根据实际情况,我们可以通过调整fragmentsize的值来平衡显示内容的详细程度和用户体验。

接下来,让我们来了解nomatchsize的使用。

nomatchsize表示在查询结果中,没有与用户查询词完全匹配的文档所显示的片段的大小。

在用户的查询结果中,可能会出现一些文档与查询词相关性较低,或者没有与查询词完全匹配的情况。

为了提供一些参考信息给用户,系统会展示一些与查询词相关性较低的文档片段。

nomatchsize的值决定了这些无匹配文档片段的大小。

如果nomatchsize的值较大,那么将显示更多的无匹配文本片段。

然而,如果nomatchsize的值过大,可能会降低用户对真正相关文档的注意力,给用户带来干扰。

因此,根据使用场景,我们可以通过调整nomatchsize的值来平衡展示无匹配文本的参考信息与用户的需求。

错误和警告解析1

错误和警告解析1

错误和警告解析1错误和警告解析 1.txt Model Size (current problem)1.183933e+000,BTOL setting 1.00000e-005,minmum KPTdistance 4.308365e-006先在要分割的地方设置一个工作平面,用布尔运算“divided --volume by working plane”进行分割的时候,出现上述错误,主要愿意可能是设置的公差太小,当时试了几次都么有成功,最后干脆把体重新建立了一个,又画了一个很大的面,终于成功了。

2.一个常见的代表性错误!原来我的虚拟内存设置为“无分页文件”,现在改为“系统管理”,就不在出现计算内存不够的情况了。

Error!Element type 1 is Solid95,which can not be used with the AMES command, meshing ofarea 2 aborted.刚开始学习的人经常出这种错误,这是因为不同单元类型对应不同的划分网格操作。

上面的错误是说单元类型为Solid95(实体类型),不能用AMES 命令划分面网格。

3 Meshing of volume 5 has been aborted because of a lack of memory. Closed down otherprocesses and/or choose a larger element size, then try the VMESH command again.Minimum additional memory required=853MB(bykitty_zoe )说你的内存空间不够,可能因为你的计算单元太多,增加mesh 尺寸,减少数量或者增加最小内存设定(ansys10中在customization preferences菜单存储栏可以修改)你划分的网格太细了,内存不足。

errorC2783:无法为“T”推导模板参数

errorC2783:无法为“T”推导模板参数

errorC2783:⽆法为“T”推导模板参数原则:“模板参数推导机制⽆法推导函数的返回值类型”版本⼀:// 缺少<T> 参数 int n 对⽐第三个版本(缺少<T> 参数 T n) !编译错误提⽰:错误 1 error C2783: “T FibRecursion(int)”: ⽆法为“T”推导模板参数 c:\users\yi\documents\visual studio 2005\projects\斐波纳契数列\斐波纳契数列\斐波纳契数列.cpp 161 #include "stdafx.h"2 #include <iostream>34 template<class T>5 T FibRecursion(int n) // 参数 int n6 {7if (n<0)8return -1;910if (n == 0 || n == 1)11return1;1213return FibRecursion(n-1) + FibRecursion(n-2); // 缺少<T>14 }15int _tmain(int argc, _TCHAR* argv[])16 {17int result = FibRecursion<int>(30); //错误⾏18 system("pause");19return0;20 }版本⼆:// 加上<T> 参数 int n 或者 T n编译通过!1 #include "stdafx.h"2 #include <iostream>34 template<class T>5 T FibRecursion(int n) // 参数 int n6 {7if (n<0)8return -1;910if (n == 0 || n == 1)11return1;1213return FibRecursion<T>(n-1) + FibRecursion<T>(n-2); // 加上<T>14 }15int _tmain(int argc, _TCHAR* argv[])16 {17int result = FibRecursion<int>(30); //没有报错18 system("pause");19return0;20 }1 #include "stdafx.h"2 #include <iostream>34 template<class T>5 T FibRecursion(T n) // 参数 T n6 {7if (n<0)8return -1;910if (n == 0 || n == 1)11return1;1213return FibRecursion<T>(n-1) + FibRecursion<T>(n-2); // 加上<T> 14 }15int _tmain(int argc, _TCHAR* argv[])16 {17int result = FibRecursion<int>(30); //没有报错18 system("pause");19return0;20 }版本三:// 缺少<T> 参数 T n编译通过!1 #include "stdafx.h"2 #include <iostream>34 template<class T>5 T FibRecursion(T n) // 参数 T n6 {7if (n<0)8return -1;910if (n == 0 || n == 1)11return1;1213return FibRecursion(n-1) + FibRecursion(n-2); // 缺少<T>14 }15int _tmain(int argc, _TCHAR* argv[])16 {17int result = FibRecursion<int>(30); //没有报错18 system("pause");19return0;20 }。

parameter 1 is not of type 'element -回复

parameter 1 is not of type 'element -回复

parameter 1 is not of type 'element -回复关于参数1类型错误的问题在编程过程中,我们经常会遇到各种不同类型的错误。

其中一个常见的错误是"parameter 1 is not of type 'element'",这个错误提示意味着我们在代码中使用了一个不正确的类型作为函数或方法的参数。

本文将逐步回答有关这个问题的一系列问题,以帮助读者更好地理解和解决这个问题。

问题1:什么是参数的类型?在编程中,参数的类型指的是函数或方法接受的参数的种类。

参数可以是整数、浮点数、字符串、布尔值、对象等。

每个编程语言都有自己的数据类型定义和规定。

问题2:为什么会出现"parameter 1 is not of type 'element'"错误?这个错误通常表示我们在调用一个函数或方法时,传递给该函数或方法的参数的类型与预期要求的类型不一致。

例如,如果一个函数要求传递一个元素类型的对象作为参数,但我们却传递了一个整数类型的参数,那么就会出现这个错误。

问题3:如何解决这个错误?要解决这个错误,我们需要先确定问题出现在哪里。

通常在错误提示中会有具体的代码行数和错误信息。

我们可以根据这个信息来确定引发错误的具体代码行。

在查找代码行之后,我们需要检查代码行中使用的参数类型是否符合函数或方法的要求。

如果不符合,我们需要寻找正确的参数类型并进行修改。

问题4:如何确定参数类型的正确性?确定参数类型的正确性通常需要参考函数或方法的文档。

大多数编程语言都有相应的文档来描述每个函数或方法接受的参数类型,并提供一些示例代码以帮助我们理解。

我们可以搜索相关的文档或查看编程语言的官方文档来确定函数或方法所需的参数类型。

问题5:如何修改参数的类型?要修改参数的类型,我们需要将错误类型的参数替换为正确的类型。

这可能涉及到变量类型转换或者重新定义变量。

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

Porter, Rao, Ku, Poirot, and DakinsISSN 1047-3289 J. Air & Waste Manage. Assoc. 47:1197-1203Copyright 1997 Air & Waste Management AssociationSmall Sample Properties of Nonparametric Bootstrap tConfidence IntervalsP. Steven Porter University of IdahoS. Trivikrama RaoState University of New York, Albany, New YorkJia-Yeong KuNew York State Department of Environmental Conservation Richard L. PoirotVermont Department of Environmental Conservation Maxine Dakins University of IdahoABSTRACTConfidence interval construction for central tendency is a prob-lem of practical consequence for those who must analyze air contaminant data. Determination of compliance with relevant ambient air quality criteria and assessment of associated health risks depend upon quantifying the uncertainty of estimated mean pollutant concentrations. The bootstrap is a resampling technique that has been steadily gaining popularity and ac-ceptance during the past several years. A potentially powerful application of the bootstrap is the construction of confidence intervals for any parameter of any underlying distribution.Properties of bootstrap confidence intervals were determined for samples generated from lognormal, gamma, and Weibull distributions. Bootstrap t intervals, while having smaller coverage errors than Student's t or other bootstrap meth-ods, under-cover for small samples from skewed distribu-tions. Therefore, we caution against using the bootstrap toconstruct confidence intervals for the mean without first con-sidering the effects of sample size and skew. When sample sizes are small, one might consider using the median as an estimate of central tendency. Confidence intervals for the median are easy to construct and do not under-cover. Data collected by the Northeast States for Coordinated Air Use Management (NESCAUM) are used to illustrate application of the methods discussed.INTRODUCTIONThe bootstrap is a resampling technique 1 that has been steadily gaining popularity and acceptance during the past several years. A potentially powerful application of the boot-strap is the construction of confidence intervals for any parameter of any underlying distribution.2 In this paper we address the use of the bootstrap technique to construct confidence intervals for the mean of an unknown distribu-tion using small sample sizes. Confidence interval construc-tion for central tendency is a problem of practical conse-quence for those who must analyze environmental moni-toring data. For example, determination of compliance with relevant ambient air quality criteria and assessment of as-sociated health risks depend upon quantifying the uncer-tainty of estimated mean pollutant concentrations.In this paper we focus on distribution-free techniques and small sample sizes. Confidence intervals for the mean of an unknown distribution can be based on Student’s T,provided the sample size is large. When the underlying distribution is not normal and sample sizes are small,Student's t will under-cover , meaning the probability thatIMPLICATIONSDetermination of compliance with relevant ambient air quality criteria and assessment of associated health risks depend upon quantifying the uncertainty of estimated mean pollut-ant concentrations. The nonparametric bootstrap t has be-come a popular method for constructing confidence inter-vals for the mean of an unknown distribution. However, us-ers should be aware that this method does not provide nomi-nal coverage probabilities when used with small samples from probability distributions typically used to characterize pollutant concentrations. It is suggested that using the sample median and associated confidence interval is a more reliable estimator of central tendency for this application.Porter, Rao, Ku, Poirot, and Dakinsthe interval contains the parameter of interest is less than nominal. A nominal 95% confidence interval based on small samples from a skewed distribution and Student's t statistic will contain the mean less than 95% of the time in repeated sampling. This paper provides some guidance about adequate sample sizes for use with Student's t.Bootstrap methods offer the promise of confidence inter-vals having coverage close to nominal. However, one must choose from among several bootstrap confidence interval methods that have appeared in the literature. Perhaps the most well known bootstrap confidence interval methods are the percentile method (BSP), the bootstrap t (BST), and the bias-corrected and accelerated bootstrap (BCA). Large sample theory has shown the BST to provide narrower intervals, with smaller coverage errors than the BSP or BCA methods.3 The BST is particularly applicable to location statistics, such as the sample mean, where there is an appropriate estimator of its standard error.4 When there is no obvious standard error formula for the parameter of interest, as is the case for the sample median, one may resort to the BCA or double bootstrapping.4 Large sample theory assists the choice of a method, but does not always provide a reliable indication of perfor-mance with small samples. In this paper, we use simula-tion studies and data collected by the Northeast States for Coordinated Air Use Management (NESCAUM) to illustrate the small sample properties of the BST. Although these net-works have a primary focus on visibility impairment, the resulting trace element data also provide an excellent op-portunity for assessing long-term exposures to a variety of potentially toxic trace metals and other substances.5 BST intervals, while having smaller coverage errors than Student's t or other bootstrap methods, under-cover for small samples from skewed distributions. Therefore, we caution against using the BST to construct confidence in-tervals for the mean without first considering the effects of sample size and skew. When sample sizes are small, one might consider using the sample median as an estimate of central tendency. Confidence intervals for the median are easy to construct and do not under-cover. In addition, me-dian confidence intervals can be constructed for highly censored samples. As sample sizes increase, the actual cov-erage of the BST approaches nominal more rapidly than Student's t, and, if the underlying distribution can be iden-tified, better methods, including a parametric bootstrap, can be applied.METHODSDatabase for ExamplesData collected by NESCAUM were used to illustrate the meth-ods. The NESCAUM Regional Particle Monitoring Network samples fine particulate matter (< 2.5 microns) at seven air monitoring stations in New York, New Jersey, Connecticut, Rhode Island, Maine, Massachusetts, New Hampshire, and Vermont. Twenty-four hour composite samples are collected on teflon filters every Wednesday, Saturday, and every sixth day that is not a Wednesday or Saturday, for a total of about 145 samples annually. Samples are analyzed by Crocker Nuclear Laboratory at the University of California at Davis for mass (gravimetric), light absorption (integrating plate), and multiple trace elements (proton elastic scattering analy-sis and proton-induced X-ray emission).6-8Zinc concentrations at Ringwood, NJ were chosen to illustrate the methods discussed in this paper. Annual mean and day-of-the-week concentrations are useful for assess-ing human health risk associated with long-term exposure to toxic air contaminants. The zinc concentrations found at these locations are well below the 24-hour-maximum standard of 0.15 ng/m3 for particulate zinc. However, ar-senic concentrations detected in the network, while often well above the standard, are difficult to characterize statis-tically or track because of censoring. In addition, large amounts of zinc and arsenic or other toxic substances may originate from the same source. Hence, there is interest in using zinc as a surrogate for particulate arsenic.Confidence IntervalsStudent's t. A 1-2α confidence interval for the mean us-ing Student's t is given by:CI =[XSn,XSn](1)where X, S, and n are the sample mean, sample standarddeviation, and sample size, respectively. Values for t1-α,n-1 and tα,n-1are ordinates at the 1-α and α points of Student's t distribution with n-1 degrees of freedom. BecauseStudent's t is symmetric, t1-α,n-1= - tα,n-1, and tables need provide only the positive ordinate.Bootstrap confidence intervals. The nonparametric bootstrap is a distribution-free technique in which the original sample of size n is resampled N times with replacement. The statis-tics of interest are calculated for each bootstrap resample and averaged. The sample mean and a bootstrap replica-tion of the sample mean are given by:=Xni=1ni∑(2)X1NXn*i*=−∑in1where X is the sample mean, xian element of the origi-nal sample , *X a bootstrap replica of the sample mean, and xi* an element of the bootstrap sample. Elements of the original sample may appear zero, one, or more timesPorter, Rao, Ku, Poirot, and Dakinsin the bootstrap resample.The bootstrap is not a useful estimation technique for the sample mean because it will provide the same result as the regular sample mean.1 However, the N bootstrap replicates have information about the dis-tribution of the sample statistic of interest and can be used to construct confidence intervals. For example,the bootstrap t statistic is formed from the empirical distribution of the following statistic:j j *j*T =X - X S(3)where j *and S j * are bootstrap realizations of the mean and standard deviation, respectively, and X is the sample mean.The BST confidence interval is found by inverting eq 3:4CI = [X T S, X T S]U L −⋅−⋅(4)where S is the sample standard deviation and T L and T U are the lower and upper critical points, respectively,of the T values from eq 3. Equation 4 is analogous to eq 1, with the upper and lower tails of the T distribu-tion corresponding to the lower and upper bounds of the interval, respectively. However, instead of consult-ing a standard table, a unique table is generated for each sample.5 The critical points of the T distribution are any two numbers that include 1-2α of the T val-ues. The BST converges to Student's t as the sample mean converges to normality.The BST has been shown in theory to be better for constructing confidence intervals for the sample mean (shorter with smaller coverage errors) than several other bootstrap methods (percentile, bias corrected, and accel-erator methods).4 Different BST intervals can be defined according to how critical values are selected. The equal-tailed 1-2α BST confidence interval is formed from the (α• N)th smallest and [(1-α) • N]th largest T values. The short-est interval is the pair of T values that has the shortest length and covers 1-2α of the T values. One might also want a symmetric interval, which is formed from those values covering 1-2α of the T values and providing equal width below and above the estimate.Correct parametric intervals for samples from a lognormal dis-tribution. If it can be assumed that the underlying distribu-tion is lognormal, correct confidence bounds can be con-structed using the method and tables found in Land.9 BST intervals were compared with Land’s correct intervals to give some idea of the penalty incurred by not knowing the underlying distribution.Median confidence intervals. Distribution-free confidence bounds for the median are sample order statistics. Order statistics are derived from samples that are arranged in size from smallest to largest. The central value of an odd-sized sample is the sample median. When the sample size is even, the sample median is usually taken as the average of the two central order statistics.A confidence interval for the median is a set of two order sta-tistics, one larger and one smaller than the sample median.The coverage of a given order statistic can be found in tables ofFigure 1. Coverage of nominal 90% two-sided BST interval for threeparent distributions: (a) gamma, (b) lognormal, (c) Weibull.Figure 2. Coverage of nominal 90% two-sided student’s t interval for three parent distributions: (a) gamma, (b) lognormal, (c) Weibull.Porter, Rao, Ku, Poirot, and Dakinsthe cumulative binomial or tables of confidence intervals for the median, both of which can be found in Breyer.10 For ex-ample, when the sample size is 20, the table indicates that the 6th and 15th order statistics (6th and 15th largest values in the sample) provide a 95.9% confidence interval. Confidence in-tervals constructed from order statistics do not under-cover.Simulation StudiesSynthetic independent samples were drawn from log-normal, gamma, and Weibull parent distributions hav-ing coefficients of variation of 0.5, 1, 2, 3, and 4. This set of distributions includes several with small depar-tures from normality (those with coefficients of varia-tion of 0.5) and exponential distributions (gamma and Weibull with coefficients of variation of 1.0). The set also includes several skewed distributions with differ-ing amounts of weight in the tails. Sample sizes were 10, 20, 50, and 100. Nominal coverage ranged from 90% to 99% for two-sided intervals (95% to 99.5% for upper one-sided intervals). Bootstrap confidence in-tervals were constructed from 2,000 bootstrap resamples per each original sample. Two thousand rep-etitions were carried out for each simulation.In all figures, sample coefficients of skew are aver-ages of sample coefficients of skew for given sample sizes and distributions. For small samples, the sample values of higher central moments are much smaller than their theoretical values.11 For a given coefficient of variation,the sample coefficient of skew increases with sample size,hence the different values of coefficient of skew for each point in the figures.RESULTS AND DISCUSSIONConfidence Interval CoverageThe coverage of the BST falls short of nominal for small samples from skewed distributions (Figure 1) but still has much better coverage than Student's t (Figure 2). For example, the coverage of a nominal 90% two-sided interval for a lognormal parent with sample coefficient of skew of 2.1 and sample size 20 is actually only about 81%. Coverage also varies by parent distri-bution. For a given sample coefficient of skew and sample size,gamma coverage is greater than W eibull, which in turn is greater than lognormal.Undercoverage occurs in skewed distributions because the upper bound tends to be too small. This is evident from coverage probabilities for 95% upper one-sided bounds (Fig-ure 3), which are the same as the upper bounds for the 90%two-sided intervals. As a typical example, actual coverage of the point mentioned above (coefficient of skewness of 2.1 and sample size of 20) is about 83.5%. This means that the upper bound failed to cover 17.5% of the time, while the lower bound failed to cover, on average, only 1.5% of the time (1 - 0.81 - 0.175).Width of Confidence IntervalsTo provide some idea of the dependence of confidence interval width on sample size and coefficient of skew,expressions for the width of two-sided confidence inter-vals using nominal coverage were derived from simula-tion studies (for each case, the actual mean = 1):gamma width z n R =⋅⋅⋅⋅=−3820964438122.,..αγ(5)upper bound mean znR =+⋅⋅⋅=−αγ4809142097.,.Figure 3. Coverage of nominal 95% upper one-sided BST intervalfor three parent distributions: (a) gamma, (b) lognormal, (c) Weibull.Figure 4. Width of shortest nominal 90% BST interval relative to equal-tailed BST interval for three parent distributions: (a) gamma,(b) lognormal, (c) Weibull.Porter, Rao, Ku, Poirot, and Dakinslog .,...normal width z n R =⋅⋅⋅=−1410971661522αγ(6)upper bound mean Z nR =+⋅⋅⋅=−75809721522.,..αγWeibull width z n R =⋅⋅⋅=−14509521522.,..αγ(7)upper bound mean znR =+⋅⋅⋅=−1710962672262.,...αγShortest BST intervals are, of course, shorter than equal-tailed intervals (Figure 4) but have larger coverage errors (Figure 5).Comparison of BST Widths with Correct Lognormal WidthsIt is useful to compare the widths of BST intervals con-structed with samples from lognormal distributions with correct widths computed using the method of Land.9However, a fair comparison requires that actual coverage be the same for the two methods. Because the actual cov-erage of the BST method is less than nominal, widths should be recomputed using a nominal coverage that pro-vides the desired actual coverage.Asymptotically, the coverage error of a nominal 1-2αtwo-sided, equal-tailed BST interval is given by:4coverage error =(8)n -1(κ-3γ2/2) • z 1-α • (2z 21-α + 1) • φz /6where κ and γ are the coefficients of kurtosis and skew-ness, respectively; and φz is the density of the standard nor-mal distribution at z, the 1-α point of the distribution. Thesample skewness and kurtosis are given, respectively, by:Figure 5. Coverage of shortest BST interval relative to equal-tailed BST interval, 95% nominal coverage, for (a) gamma parent, (b)lognormal parent, (c) Weibull parent.Figure 6.Comparison of asymptotic and small sample coverage errors.Figure 7. Nominal coverage providing actual 95% coverage for one-sided confidence bound.Figure 8. Upper 95% bounds of BST with nominal 95% coverage,Land’s correct method, and BST with actual 95% coverage.Porter, Rao, Ku, Poirot, and Dakins$ = $n (X -)-3-1i 3γσ⋅⋅Σ(9)$ = $n (X - X ) - 3-4-1i 4κσ⋅⋅Σwhere and 2$σ are the sample mean and variance, re-spectively.The sample coefficient of skew is a measure of symmetry,and the kurtosis a measure of the mass of the distribution thatis found in the tails. The normal distribution has a skew andkurtosis of 0. For large samples, eq 8 indicates the extent towhich departures from normality affect coverage error. Increas-ing skew also indicates increasing correlation between thesample mean and sample variance. Student's t is premised onindependence of the sample mean and variance, which be-comes true for any distribution as the sample size increases.However, for small samples, departures from normal skew havea greater effect on coverage error than departures from normalkurtosis;12 hence, the focus here on skewed distributions, ratherthan symmetric but heavy-tailed distributions.Equation 8, an asymptotic result, is optimistic in com-parison with simulation results using samples fromWeibull and lognormal distributions, and conservativewhen applied to samples from gamma distributions (Fig-ure 6). Therefore, an empirical expression for coverageerror was derived from the simulation results. For samplesfrom the lognormal distribution and the range of condi-tions used in the simulation, the coverage error of 1-2αconfidence intervals can be estimated from:lognormal coverage error (one-sided) =5.1 z (z) n $, R = 0.962.6-1.5 2.42⋅⋅⋅⋅αφγ(10)Equation 10 was used to compute thenominal coverage needed for an actual 95%one-sided confidence bound (Figure 7). Equa-tion 6 was then used to compute the value ofthat upper bound for lognormal distributions hav-ing a true mean of 1 (Figure 8). That the upper bound of the BST with nominal coverage of 95% is actually smaller than the correct upper bound is misleading,because we know that BST bounds under-cover (Fig-ure 3). The distance between the correct upper bound and that given by the BST with adjustednominal coverage, a fairer comparison, repre-sents the penalty for not knowing the trueunderlying distribution. What is striking aboutFigure 8 is the large increase in the upper boundthat results from apparently small changes in thenominal coverage. In fact, moving a few percent-age points in the tail of the distribution of the sample mean can be a large distance in terms ofthe underlying variable. For example, when the sample size is 20, the sample coefficient of skew is about 1.9 (parent coeffi-cient of variation 2), and the nominal coverage is increased to 99.4% to achieve 95% actual coverage, the upper bound in-creases from 1.7 to 3.0.Nominal coverage error can be adjusted automaticallyusing a method called an iterated bootstrap.13 An iterated boot-strap uses a nominal coverage equal to the desired coverageplus the coverage error given by an expression such as eq 8.However, eq 8 is not accurate for small samples (Figure 6),meaning that an iterated bootstrap, while possibly an improve-ment over the simple BST , may still undercover for samplesfrom lognormal and Weibull distributions. Eq 10 is not usefulfor computing iterated BST intervals either, because it is validonly for samples from lognormal distributions.Application of Methods to NESCAUM DataSummary statistics. Summary statistics were calculated forzinc concentrations at Ringwood, NJ, using data from 1990(Table 1). Coefficients of skew ranged from 1.52 to 2.61.Confidence bounds for means and medians . Confidencebounds were calculated for mean zinc concentrations us-ing the BST and Student's t (Table 2). Most striking per-haps is the disparity in the size of intervals for BST andStudent's t at sample sizes of 8 and 49, both of whichwere nominally 95%. Lower bounds were not very differ-ent, but upper bounds for the BST were much larger thanfor Student's t. The disparity can be explained by differ-ences in actual coverage. The actual coverage for samples of size 50 originating from a lognormal distribution witha sample coefficient of skew of 2.6 is only about 82% for Student's t and about 88% for the BST. The disparity in coverage decreases with increasing sample size (Figures 1-3).Table 1. Summary statistics for zinc concentrations (in ng/m 3) (Ringwood, NJ, 1990).Day of Week Sample Size Mean Median Std. Dev. Coef. Var. Coef. Skew Tue 8 13.2 10.0 8.4 0.64 1.85Sat 49 13.5 10.8 11.4 0.85 2.61Annual 142 14.5 11.4 11.5 0.79 1.52Table 2. Confidence bounds for means of zinc concentrations (ng/m 3) (Ringwood, NJ, 1990). Student’s t BST Day Sample LowerUpper Two-sided Lower Upper Two-sidedSize (5%)(95%)Width (5%)(95%)widthTue 8 7.6 18.8 11.2 8.53 34.9 26.4Sat 49 10.8 16.2 5.4 10.9 18.2 7.3Annual 14212.9 16.1 3.2 12.9 16.6 3.7Porter, Rao, Ku, Poirot, and DakinsMost of the undercoverage occurs at the upper bound. Student's t always produces intervals symmetric about the sample mean, while the BST produces asymmetric intervals from skewed samples, reflecting the shape of the distribution of the sample mean. Considering the simulation study, the BST should pro-vide intervals with close-to-nominal coverage when used with sample sizes and coefficients of skewness like those in the an-nual NESCAUM data.Confidence intervals for the median (Table 3) were calcu-lated from order statistics using tables that indicate the order statistics that will provide the nominal coverage10 indicated. Order statistic intervals are distribution-free and do not under-cover. In addition, when used with skewed samples, order sta-tistics tend to produce confidence intervals that are asymmet-ric with respect to the median.Widths of intervals for the median cannot easily be compared to those for means, because coverage depends on sample size. For large samples, however, the nominal coverage using order statistics approaches 95%, enabling comparisons. With respect to the example, confidence intervals for the median are sometimes smaller than in-tervals for the mean (Table 3).SUMMARY AND RECOMMENDATIONSThe most common method used by non-statisticians for computing confidence intervals for the mean from small samples is Student's t. The actual coverage of Student's t is much less than nominal for samples from skewed parent distributions, even for quite large sample sizes. The BST is a distribution-free method that, while providing better coverage than Student's t for samples from non-normal parent distributions, is still less than nominal.The information presented in this paper can be used to temper judgment about health or environmental risks based on approximate methods such as the BST. Certainly, the BST is preferable to Student's t, and being aware of a method’s limitations is preferable to ignorance of them. The practical implication is that to achieve confidence intervals with nominal coverage the sample size may have to be greatly increased.An alternative is to use the median as an estimate of central tendency. Confidence in-tervals for the median are easy to construct anddo not undercover. Another alternative is tocharacterize concentrations using extreme val-ues (for example, the 95th percentile concen-tration). Many articles have appeared describ-ing bootstrap methods for estimating percen-tiles. However, confidence intervals for percen-tiles are very wide and strongly dependent onsmall changes in the tails of distributions. Per-centiles may be useful supplements to estimatesof central tendency, but alone will not provide much information when derived from small samples.As a final word, we caution against using the BST to con-struct confidence intervals for the mean without considering the effects of sample size and skew. When sample sizes are large, actual coverage approaches nominal, and if the underly-ing distribution can be identified, a parametric bootstrap4 can be used and coverage corrections, as described above, can be applied. Some guidance as to appropriate sample sizes for good-ness-of-fit testing can be found in reference 14.ACKNOWLEDGMENTSThis work was supported by Northeast States for Coordi-nated Air Use Management and the U.S. Environmental Protection Agency.REFERENCES1.Efron, B. The Jackknife, the Bootstrap and Other Resampling Plans; Soci-ety for Industrial and Applied Mathematics: Philadelphia, PA, 1982.2.Rao, S.T.; Sistla, G.; Pagnotti, V. “Resampling and extreme value sta-tistics in air quality model performance evaluation,” Atmospheric En-vironment1985, 19, 1503.3.Hall, P. “Theoretical comparison of bootstrap confidence intervals,”Annals of Statistics1988, 16, 927.4.Efron, B.; Tibshirani, R.J. An Introduction to the Bootstrap; Chapmanand Hall: New York, 1993.5.Porter, P.S.; Rao, S.T.; Ku, J.; Poirot, R.L. Statistical Methods for the Analy-sis of Pollutant Concentrations Affected by Measurement Uncertainty, Project report submitted to Northeast States for Coordinated Air Use Management, Boston, MA, 1993.6.Flocchini, R.G.; Cahill, T.A.; Eldred, R.A.; Feeney, P.J. “Particulate sam-pling in the northeast: a description of the Northeast States for Coor-dinated Air Use Management (NESCAUM) network.” In Visibility and Fine Particles; C.V. Mathai, Editor; Air & Waste Management Associa-tion (A&WMA): Pittsburgh, PA, 1990 pp. 197-206.7.Poirot, R.L.; Flocchini, R.G.; Husar, R.B. “Winter fine particle compositionin the northeast: preliminary results from the NESCAUM network,” Paper 90-84.5, 83rd Annual A&WMA Meeting, Pittsburgh, PA, 1990.8.Poirot, R.L.; Galvin, P.J.; Gordon, N.; Quan, S.; Van Arsdale, A.;Flocchini, R.G. “Annual and seasonal fine particle composition in the northeast: second year results from the NESCAUM network.” Paper 91-49.1, 84th Annual A&WMA Meeting, Vancouver, B.C., 1991. nd, C.E. “Tables of confidence limits for linear functions of thenormal mean and variance.” In Mathematical Statistics, Volume III;Markham Publishing: Chicago, 1975; selected tables.10.Handbook of Tables for Probability and Statistics; Beyer, W.D., Ed; Chemi-cal and Rubber Company Press: Boca Raton, FL, 1985.11.Dalén, J. “Algebraic bounds on standardized sample moments,” Sta-tistics and Probability Letters 1987, 5, 329-331.12.Kendall, M.G.; Stuart, A. The Advanced Theory of Statistics;Griffin:London, Vol 2, 4th ed., 1979.13.Loh, W. “Calibrating confidence coefficients,” J. Am. Statistical Assoc.1987,82, 155-162.14.Shapiro, S.S.; Wilk, M.B.; Chen, H.J. “A comparative study of varioustests for normality,” J. Am. Statistical Assoc. 1968, 39, 1343.Table 3. Confidence bounds for medians of zinc concentrations (ng/m3) (Ringwood, NJ, 1990).Order 95% Bootstrap Relative Length Ratio -Statistics Percentile(Median Width /Median)/(Mean Width/Mean)Day Sample Lower Upper Coverage Lower UpperSize(%)(5%)(95%)Tue 8 6.3 31.9 99.2Sat 49 8.0 14.0 95.6 8.0 14.0 1.03Annual 142 9.24 14.0 95.0 9.2 14.0 1.65。

相关文档
最新文档