نتایج جستجو برای: amortization

تعداد نتایج: 285  

Journal: :European Journal of Operational Research 2007
Dashan Huang Yoshitaka Kai Frank J. Fabozzi Masao Fukushima

This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bon...

2014
R. Kavitha

In wireless sensor system to perceive bundle droppers and modifiers is the complex assignment. Multipath sending is utilized to treat with bundle droppers then neighbor checking methodology managed parcel modifiers. This plan devours more vitality in system. PNM (Probabilistic Nested Marking) plan utilized as a part of acknowledgement technique yet it ought not to channel the parcel. Notwithsta...

2012
Depeng Li Zeyar Aung John Williams Abel Sanchez

Authentication is a crucial requirement for smart grid communications. However, the current authentication approaches in the smart grid relying on per-packet signature and per-signature verification schemes introduce heavy costs for computation and communication. Furthermore, despite being much desired by the electric power industry, there are still no efficient fault diagnosis tools to support...

2008
Michael Burr Felix Krahmer Chee Yap

Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision methods are widely used for isolating the roots of f in a given interval. In this paper we consider evaluation-based subdivision algorithms that use using simpler primitives than well-known subdivision methods such as Sturm or Descartes methods. In particular, we study the EVAL algorithm based on an algorithm by Mitc...

Journal: :CoRR 2018
Dmitrii Ustiugov Alexandros Daglis Javier Picorel Mark Sutherland Edouard Bugnion Babak Falsafi Dionisios N. Pnevmatikatos

With emerging storage-class memory (SCM) nearing commercialization, there is evidence that it will deliver the muchanticipated high density and access latencies within only a few factors of DRAM. Nevertheless, the latency-sensitive nature of in-memory services makes seamless integration of SCM in servers questionable. In this paper, we ask the question of how best to introduce SCM for such serv...

2002
Michael A. Bender Richard Cole Rajeev Raman

We present cache-oblivious data structures based upon exponential structures. These data structures perform well on a hierarchical memory but do not depend on any parameters of the hierarchy, including the block sizes and number of blocks at each level. The problems we consider are searching, partial persistence and planar point location. On a hierarchical memory where data is transferred in bl...

Journal: :Applied sciences 2023

In engineering practice, investment activities related to the construction of a building are still limited idea linear cradle grave (C2G) economy. The aim study is determine ecological and economic benefits inherent in reuse structural elements hall using Cradle (C2C) looped circular economy Life Cycle Assessment (LCA). As rule, multiple circulation materials from which model buildings made was...

Journal: :Inf. Sci. 2000
Athena Vakali

Storage subsystems have become one of the most important components in computer systems nowadays and have been expanded to include all three levels of memory hierarchy, namely the cache, the secondary and the tertiary storage. This paper presents a study of data block prefetching and caching over the two upper storage levels in a hierarchical storage model, by proposing techniques for data amor...

Journal: :CoRR 2018
Michael A. Burr Shuhong Gao Elias P. Tsigaridas

We present a general framework for analyzing the complexity of subdivisionbased algorithms whose tests are based on the sizes of regions and their distance to certain sets (often varieties) intrinsic to the problem under study. We call such tests diameterdistance tests. We illustrate that diameter-distance tests are common in the literature by proving that many interval arithmetic-based tests a...

2002
Don Coppersmith Markus Jakobsson

We introduce a novel technique for computation of consecutive preimages of hash chains. Whereas traditional techniques have a memory-times-computation complexity of O(n) per output generated, the complexity of our technique is only O(log n), where n is the length of the chain. Our solution is based on the same principal amortization principle as [1], and has the same asymptotic behavior as this...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید