{"component": "clause", "props": {"groups": [{"size": 7, "samples": [{"hash": "8cqBTC2sAeC", "uri": "/contracts/8cqBTC2sAeC#performance-analysis", "label": "Pooling and Servicing Agreement (Sears Credit Account Master Trust Ii)", "score": 21.0, "published": true}], "snippet": "(a) Portfolio Yield (Finance Charge Collections during the Due Period divided by Principal Receivables in the Trust as of the first day of the Due Period) ___________%\n(b) Charge-Offs (Charged-Off Amounts during the Due Period divided by Principal Receivables in the Trust as of the first day of the Due Period) ___________%\n(c) Recoveries (Recovered Amounts added as Additional Funds on the Distribution Date divided by Aggregate Investor Interest in the Trust as of the first day of the Due Period) ___________%\n(d) Investor Servicing Fee Percentage (weighted average of Investor Servicing Fees for Series 2002-1) ___________%\n(e) Weighted Average Certificate Rate (weighted average certificate rates for all Classes of Series 2002-1) ___________%\n(f) Series Excess Servicing Percentage (the sum of Series Finance Charge Collections, Investment Income and Recovered Amounts minus the sum of the Series Charged-Off Amount, the Investor Servicing Fee and the Certificate Interest divided by the Series Invested Amount) ___________%", "snippet_links": [{"key": "portfolio-yield", "type": "definition", "offset": [4, 19]}, {"key": "due-period", "type": "definition", "offset": [59, 69]}, {"key": "receivables-in-the-trust", "type": "clause", "offset": [91, 115]}, {"key": "day-of", "type": "clause", "offset": [132, 138]}, {"key": "recovered-amounts", "type": "definition", "offset": [341, 358]}, {"key": "additional-funds", "type": "clause", "offset": [368, 384]}, {"key": "the-distribution-date", "type": "definition", "offset": [388, 409]}, {"key": "aggregate-investor-interest", "type": "definition", "offset": [421, 448]}, {"key": "investor-servicing-fee-percentage", "type": "definition", "offset": [518, 551]}, {"key": "servicing-fees", "type": "definition", "offset": [582, 596]}, {"key": "weighted-average-certificate-rate", "type": "definition", "offset": [633, 666]}, {"key": "series-excess-servicing", "type": "clause", "offset": [754, 777]}, {"key": "sum-of", "type": "clause", "offset": [794, 800]}, {"key": "series-finance-charge-collections", "type": "definition", "offset": [801, 834]}, {"key": "investment-income", "type": "definition", "offset": [836, 853]}, {"key": "the-series", "type": "definition", "offset": [893, 903]}, {"key": "the-investor", "type": "definition", "offset": [924, 936]}, {"key": "certificate-interest", "type": "definition", "offset": [959, 979]}, {"key": "series-invested-amount", "type": "definition", "offset": [995, 1017]}], "hash": "e4333d2f8aeab85af64cfadec5f3c731", "id": 1}, {"size": 3, "samples": [{"hash": "kqEkCNnOzyc", "uri": "/contracts/kqEkCNnOzyc#performance-analysis", "label": "Master Purchase Agreement", "score": 34.3118808759, "published": true}, {"hash": "kKymg1Nw0l8", "uri": "/contracts/kKymg1Nw0l8#performance-analysis", "label": "Master Purchase Agreement", "score": 26.5961670089, "published": true}, {"hash": "ice7XTljZ1E", "uri": "/contracts/ice7XTljZ1E#performance-analysis", "label": "End Customer Agreement", "score": 26.5961670089, "published": true}], "snippet": "Customer may not publish any benchmarking results or other performance analysis of the SIEMonster Technology; Provided, however, that if there is a conflict between the terms of an applicable Open Source Software License and these license terms, restrictions, and conditions, the Open Source Software License controls to the extent of the conflict.", "snippet_links": [{"key": "customer-may", "type": "clause", "offset": [0, 12]}, {"key": "other-performance", "type": "clause", "offset": [53, 70]}, {"key": "terms-of", "type": "definition", "offset": [169, 177]}, {"key": "open-source-software-license", "type": "clause", "offset": [192, 220]}, {"key": "these-license-terms", "type": "clause", "offset": [225, 244]}, {"key": "the-open", "type": "clause", "offset": [276, 284]}, {"key": "to-the-extent", "type": "clause", "offset": [318, 331]}, {"key": "the-conflict", "type": "definition", "offset": [335, 347]}], "hash": "e6fe97e6f26bdd6f0e147da7598ce3cc", "id": 2}, {"size": 2, "samples": [{"hash": "kYePoDhHJrQ", "uri": "/contracts/kYePoDhHJrQ#performance-analysis", "label": "Thesis Submission Agreement", "score": 30.8583379661, "published": true}, {"hash": "5l7tDVl4Vq8", "uri": "/contracts/5l7tDVl4Vq8#performance-analysis", "label": "Master's Thesis", "score": 29.5142288753, "published": true}], "snippet": "In this chapter, the performance analysis of B-GKAP models is presented. First, we start with the complexity analysis of the system. This analysis includes two components: communication complexity and computational complexity. Key computation and dynamic group operations of two B-GKAP models are also explained. Later on, our simulation envi- ronment is described. In the simulation environment section, hardware and software compo- nents of our testing environment are detailed. In the simulation cases and results section, the performance results of the system are presented. This section includes the effects of Hyper- ledger Fabric Orderer parameters, performance comparison of B-GKAP versus conventional implementation, and finally performance comparison of B-GKAP1 and B-GKAP2 models.", "snippet_links": [{"key": "this-chapter", "type": "definition", "offset": [3, 15]}, {"key": "the-performance", "type": "clause", "offset": [17, 32]}, {"key": "complexity-analysis", "type": "clause", "offset": [98, 117]}, {"key": "the-system", "type": "definition", "offset": [121, 131]}, {"key": "communication-complexity", "type": "clause", "offset": [172, 196]}, {"key": "computational-complexity", "type": "clause", "offset": [201, 225]}, {"key": "group-operations", "type": "clause", "offset": [255, 271]}, {"key": "simulation-environment", "type": "clause", "offset": [373, 395]}, {"key": "hardware-and-software", "type": "clause", "offset": [405, 426]}, {"key": "testing-environment", "type": "definition", "offset": [447, 466]}, {"key": "results-of-the", "type": "clause", "offset": [542, 556]}, {"key": "section-includes", "type": "clause", "offset": [584, 600]}, {"key": "and-finally", "type": "clause", "offset": [726, 737]}], "hash": "a73e84b19292b2a77f2900f891aba176", "id": 3}, {"size": 2, "samples": [{"hash": "4busxzUo8Uk", "uri": "/contracts/4busxzUo8Uk#performance-analysis", "label": "Pooling and Servicing Agreement (Sears Credit Account Master Trust Ii)", "score": 21.0, "published": true}, {"hash": "2bWD0iMoT6", "uri": "/contracts/2bWD0iMoT6#performance-analysis", "label": "Pooling and Servicing Agreement (Sears Credit Account Master Trust Ii)", "score": 21.0, "published": true}], "snippet": "(a) Portfolio Yield (Finance Charge Collections during the Due Period divided by Principal Receivables in the Trust as of the first day of the Due Period) ___________%", "snippet_links": [{"key": "portfolio-yield", "type": "definition", "offset": [4, 19]}, {"key": "finance-charge-collections", "type": "clause", "offset": [21, 47]}, {"key": "due-period", "type": "definition", "offset": [59, 69]}, {"key": "receivables-in-the-trust", "type": "clause", "offset": [91, 115]}, {"key": "day-of", "type": "clause", "offset": [132, 138]}], "hash": "0c0bfbaae65c1dce3d3dc08849fcf4cc", "id": 4}, {"size": 2, "samples": [{"hash": "i1LNLknjgts", "uri": "/contracts/i1LNLknjgts#performance-analysis", "label": "Authenticated Key Agreement Scheme", "score": 26.9192044094, "published": true}, {"hash": "kFXC9t4yU63", "uri": "/contracts/kFXC9t4yU63#performance-analysis", "label": "Authenticated Key Agreement Scheme", "score": 22.961670089, "published": true}], "snippet": "\u200c We analyze the proposed solution in terms of the correctness, the security and the overall comparison with related solutions. For the security verification, we refer to [8,18\u201322] to evaluate session key security, mutual authentication, perfect forward security, and data integrity. Moreover, we also demonstrate that the proposed solution is safe when suffering replay attacks, impersonation attacks, privileged insider attacks, and stolen-verifier attacks.", "snippet_links": [{"key": "proposed-solution", "type": "clause", "offset": [17, 34]}, {"key": "terms-of-the", "type": "clause", "offset": [38, 50]}, {"key": "security-and", "type": "clause", "offset": [68, 80]}, {"key": "security-verification", "type": "definition", "offset": [136, 157]}, {"key": "we-refer-to", "type": "clause", "offset": [159, 170]}, {"key": "session-key", "type": "definition", "offset": [193, 204]}, {"key": "mutual-authentication", "type": "clause", "offset": [215, 236]}, {"key": "forward-security", "type": "clause", "offset": [246, 262]}, {"key": "data-integrity", "type": "definition", "offset": [268, 282]}], "hash": "a861366f8c90fd489142cc6fc63b8fdb", "id": 5}, {"size": 2, "samples": [{"hash": "dAK0tlKoa3J", "uri": "/contracts/dAK0tlKoa3J#performance-analysis", "label": "End User License Agreement", "score": 25.1492128679, "published": true}, {"hash": "3ztEsPCTdO6", "uri": "/contracts/3ztEsPCTdO6#performance-analysis", "label": "End User License Agreement", "score": 25.1492128679, "published": true}], "snippet": "Licensor may have provided a performance analysis of the Kaminario Software at your location (the \u201cKaminario Services Professional Analysis and Report\u201d). Licensor has made reasonable commercial efforts to ensure the accuracy of the Kaminario Services Professional Analysis and Report, but you understand that the performance of the Kaminario Software may vary across a spectrum of factors, and that Licensor does not make any warranties regarding the content of Kaminario Services Professional Analysis and Report or the performance of the Kaminario Software. All of Licensor\u2019s legal obligations, representations and warranties regarding the Kaminario Software and any implementation thereof are set forth solely in this Agreement and nothing in the Kaminario Services Professional Analysis and Report should be interpreted as providing any representations or warranties", "snippet_links": [{"key": "your-location", "type": "definition", "offset": [79, 92]}, {"key": "reasonable-commercial-efforts", "type": "definition", "offset": [172, 201]}, {"key": "to-ensure", "type": "clause", "offset": [202, 211]}, {"key": "accuracy-of-the", "type": "clause", "offset": [216, 231]}, {"key": "the-performance", "type": "clause", "offset": [309, 324]}, {"key": "the-content", "type": "clause", "offset": [447, 458]}, {"key": "of-licensor", "type": "clause", "offset": [564, 575]}, {"key": "legal-obligations", "type": "definition", "offset": [578, 595]}, {"key": "representations-and-warranties-regarding-the", "type": "clause", "offset": [597, 641]}, {"key": "in-this-agreement", "type": "clause", "offset": [713, 730]}, {"key": "representations-or-warranties", "type": "clause", "offset": [841, 870]}], "hash": "5762a2acf7ba95213c9f4a5ad524d6b0", "id": 6}, {"size": 1, "samples": [{"hash": "kypjj1QbY8N", "uri": "/contracts/kypjj1QbY8N#performance-analysis", "label": "Professional Engineering Services Agreement", "score": 28.719376576, "published": true}], "snippet": "The capacity of the 6 inch pump is a necessary redundancy for emergency scenarios in the collection system and a useful tool when emptying various tanks. DECISION POINT/RECOMMENDATION: Public Works Committee must decide whether or not to surplus this item to auction. DATE: September 25, 2017 FROM: \u2587\u2587\u2587\u2587 \u2587\u2587\u2587\u2587\u2587\u2587, Wastewater Utility Project Manager SUBJECT: Agreement for Professional Engineering Services with J-U-B Engineers, Inc. DECISION POINT:", "snippet_links": [{"key": "collection-system", "type": "definition", "offset": [89, 106]}, {"key": "decision-point", "type": "definition", "offset": [154, 168]}, {"key": "public-works-committee", "type": "definition", "offset": [185, 207]}, {"key": "wastewater-utility", "type": "clause", "offset": [312, 330]}, {"key": "project-manager", "type": "definition", "offset": [331, 346]}, {"key": "agreement-for-professional-engineering-services", "type": "clause", "offset": [356, 403]}], "hash": "74a9bff71b95b9334942ecc95fc4e5ac", "id": 7}, {"size": 1, "samples": [{"hash": "fOfnyYax8cz", "uri": "/contracts/fOfnyYax8cz#performance-analysis", "label": "Key Agreement Scheme", "score": 19.0191649555, "published": true}], "snippet": "In the following, we show the performance of our proposed scheme. The performance evaluation of the proposed scheme mainly concerns the time complex- ity. For convenience, we suppose some notations are used to analyze the computational complexity as fol- lows: HUB VSAT (Xv , Yv Whv = (Xh)Rv = (Xv)Rh = gRh\u00b7Rv mod N ) Xh, Yh Xv = gRv mod N Yv = h(Xv, h(Sv \u2295 t)) mod N Xh = gRh mod N Sv = IDv\u2212d mod N Yh = h(Xh, h(Sv \u2295 t)) mod N", "snippet_links": [{"key": "the-performance", "type": "clause", "offset": [26, 41]}, {"key": "performance-evaluation", "type": "definition", "offset": [70, 92]}, {"key": "the-proposed-scheme", "type": "clause", "offset": [96, 115]}, {"key": "for-convenience", "type": "clause", "offset": [155, 170]}, {"key": "computational-complexity", "type": "clause", "offset": [222, 246]}], "hash": "4a44421658f8e15f6dfa381f2862e874", "id": 8}, {"size": 1, "samples": [{"hash": "5KxlQP4NCpN", "uri": "/contracts/5KxlQP4NCpN#performance-analysis", "label": "Blockchain Based Mutual Authentication and Session Key Agreement", "score": 28.6618918568, "published": true}], "snippet": "+ + \u2248 + + + + In this section, we analyze the performance of our proposed Fig. 7. Comparison of computation cost. Fig. 8. Comparison of communication cost. We mainly focus on the authentication phase because the registration is executed for only once and the corresponding cost has little influence on the whole system. First, we consider the computation cost on server side. In [6], the computation cost on server side requires six scalar multiplication opera-\u200c \u2248 + \u2248 + + \u2248 scheme from three aspects which are computation cost, communication cost and on-chain cost. And we compare it with three related schemes [6], [12], and [24]. In Table III, we demonstrate the comparison of computation overhead to analyze the cost of these schemes on both SD and server. Additionally, the comparison of communication overhead is shown in Table IV. They are the theoretical analysis of the proposed scheme and the other three schemes, and they can point out the reasons for the differences among these schemes. \u2587\u2587\u2587\u2587 et al. [6] built a consortium blockchain using Hyperledger Composer version V0.20.7, running on an x86_64 GNU/Linux system with 1 core and 2 GB RAM for executing smart contract operations. And we refer their experimental results, and the results are illustrated in Table V. We use the cryptographic library called MIRACL Core to test the execution time of cryptography operations under the Ubuntu \u2248", "snippet_links": [{"key": "the-performance", "type": "clause", "offset": [42, 57]}, {"key": "computation-cost", "type": "clause", "offset": [96, 112]}, {"key": "communication-cost", "type": "clause", "offset": [136, 154]}, {"key": "authentication-phase", "type": "clause", "offset": [179, 199]}, {"key": "the-registration", "type": "clause", "offset": [208, 224]}, {"key": "whole-system", "type": "clause", "offset": [306, 318]}, {"key": "table-iii", "type": "clause", "offset": [636, 645]}, {"key": "cost-of", "type": "definition", "offset": [716, 723]}, {"key": "communication-overhead", "type": "clause", "offset": [793, 815]}, {"key": "table-iv", "type": "clause", "offset": [828, 836]}, {"key": "the-proposed-scheme", "type": "clause", "offset": [875, 894]}, {"key": "gb-ram", "type": "clause", "offset": [1146, 1152]}, {"key": "contract-operations", "type": "clause", "offset": [1173, 1192]}, {"key": "experimental-results", "type": "clause", "offset": [1213, 1233]}, {"key": "execution-time", "type": "clause", "offset": [1343, 1357]}], "hash": "f9b748c36e515809c6ee5580b49d98f3", "id": 9}, {"size": 1, "samples": [{"hash": "jB7TNleFuyg", "uri": "/contracts/jB7TNleFuyg#performance-analysis", "label": "End User License Agreement", "score": 24.8850102669, "published": true}], "snippet": "\u200c In the sequel, we consider the case of the primal variable update xt only based on \u03bbt\u22121, and show that the resulting online solutions achieve both sub-linear dynamic regret RT and sub-linear aggregate violation VT . To this end, we first make the following three remarks:", "snippet_links": [{"key": "the-case", "type": "definition", "offset": [29, 37]}, {"key": "based-on", "type": "clause", "offset": [76, 84]}], "hash": "1b92d525e46873c59658a9ffe90d56ea", "id": 10}], "next_curs": "Cl0SV2oVc35sYXdpbnNpZGVyY29udHJhY3RzcjkLEhZDbGF1c2VTbmlwcGV0R3JvdXBfdjU2Ih1wZXJmb3JtYW5jZS1hbmFseXNpcyMwMDAwMDAwYQyiAQJlbhgAIAA=", "clause": {"title": "Performance Analysis", "size": 59, "parents": [["governing-law", "Governing Law"], ["products", "Products"], ["general-software-license-terms", "General Software License Terms"], ["bilinear-pairing", "Bilinear Pairing"], ["computable", "Computable"]], "children": [["key-computation-complexity-comparison", "Key Computation Complexity Comparison"], ["b-gkap-join", "B-GKAP Join"], ["b-gkap-leave-operation", "B-GKAP Leave Operation"], ["b-gkap1-key-computation", "B-GKAP1 Key Computation"], ["b-gkap-join-operation", "B-GKAP Join Operation"]], "id": "performance-analysis", "related": [["quantitative-analysis", "Quantitative Analysis", "Quantitative Analysis"], ["performance-and-compliance", "Performance and Compliance", "Performance and Compliance"], ["performance-review", "Performance Review", "Performance Review"], ["performance-testing", "Performance Testing", "Performance Testing"], ["performance-reporting", "Performance Reporting", "Performance Reporting"]], "related_snippets": [], "updated": "2025-07-07T16:38:45+00:00"}, "json": true, "cursor": ""}}