scholarly journals Early Termination Clauses for Leasing Contracts with APR Cap

2018 ◽  
Vol 13 (12) ◽  
pp. 290
Author(s):  
Luciano Quattrocchio ◽  
Luisa Tibiletti ◽  
Mariacristina Uberti
Keyword(s):  
Interest Rate ◽  
Early Termination ◽  
Penalty Costs ◽  
Extra Charge ◽  
Minimum Number ◽  
Additional Charges ◽  
The Given

Terminating a leasing contract early may entail the payment of additional charges attributable to penalty and late payment costs. The occurrence of these extra charges push the lease effective Annual Percentage Rate (APR) up. The aim of this note is to discuss the contract early termination extra charge conditions which guarantee the no exceedance of a given APR threshold, whenever the contract expires. In the event the contract provides the lessee the option to terminate the lease prior to the first payment, extra charges shoot APR extraordinarily up and so the penalty costs should be set at zero. In the occurrence that the contract terminates upon the first payment date due to lessee’s exercise of the early termination option, the most severe compliance conditions are those if the termination occurs at the first payment date. If the early termination occurs for lessee’s insolvency, the most severe compliance condition is at correspondence of the first admissible date of the contract redemption for insolvency after a minimum number of unpaid payments. The late payment cost compliance condition requires only that the late payment interest rate not exceeds the given APR cap. Our findings hold whatever the payback amortization is set at the date of entering into the contract. If the French amortization (fixed installments) is used, the compliance constrains turn out looser than those valid for a general amortization.

FAKTOR DETERMINAN PENYALURAN KREDIT BANK PERSERO

2018 ◽  
Vol 23 (1) ◽  
pp. 60-71
Author(s):  
Wigiyanti Masodah
Keyword(s):  
Interest Rate ◽  
Linear Regression ◽  
Interest Rates ◽  
Regression Models ◽  
Linear Regression Models ◽  
Negative Impacts ◽  
Main Activity ◽  
The Impact ◽  
The Given ◽  
Multiple Linear Regression Models

Offering credit is the main activity of a Bank. There are some considerations when a bank offers credit, that includes Interest Rates, Inflation, and NPL. This study aims to find out the impact of Variable Interest Rates, Inflation variables and NPL variables on credit disbursed. The object in this study is state-owned banks. The method of analysis in this study uses multiple linear regression models. The results of the study have shown that Interest Rates and NPL gave some negative impacts on the given credit. Meanwhile, Inflation variable does not have a significant effect on credit given. Keywords: Interest Rate, Inflation, NPL, offered Credit.

APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS

1993 ◽  
Vol 03 (04) ◽  
pp. 383-415 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JOHN E. HERSHBERGER ◽  
JOSEPH S.B. MITCHELL ◽  
JACK SCOTT SNOEYINK
Keyword(s):  
Greedy Algorithms ◽  
Np Hard ◽  
Basic Approach ◽  
Line Segments ◽  
Minimum Number ◽  
Polygonal Chains ◽  
The Given ◽  
Plane Polygon

We study several variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We give some variants that have linear or O(n log n) algorithms approximating polygonal chains of n segments. We also show that approximating subdivisions and approximating with chains with. no self-intersections are NP-hard.

scholarly journals Applicability analysis of prediction methods in the system for selection personalized offers by analytical modeling

2021 ◽  
Vol 22 (1) ◽  
pp. 16-22
Author(s):  
Yuriy S. Fedorenko
Keyword(s):  
Distribution Function ◽  
Waiting Time ◽  
Analytical Modeling ◽  
Queuing System ◽  
Software Implementation ◽  
System Response ◽  
System Response Time ◽  
Minimum Number ◽  
The Many ◽  
The Given

The relevance of the work is justified by the frequent occurrence of the need to solve the problems of choosing personalized offers in information systems and the many possible methods of machine learning, among which it is necessary to choose the most suitable one. The purpose of this study is to simulate a system for selecting personalized offers as a queuing system for estimating equipment costs when using each of the methods necessary to service the required part of requests for a given time limit. This solves the problem of assessing the minimum number of servicing devices (backend servers) required to ensure the operation of the system at a given level. The paper shows that the system can be described by a multichannel queuing system without losses. The distribution function of the spent time of the request in the system (the service time plus the waiting time in the queue) is calculated, since in the literature for such systems only the distribution function of the waiting time in the queue is described. Transformations of the expression for the probability of waiting are given, which solve the overflow problem in the software implementation. In the final part, as an example, the system was modeled according to the given parameters, and the minimum number of servicing devices was estimated to ensure a given system response time. Based on the data obtained, it is possible to make a decision on the advisability of using one or another method for predicting the frequency of user clicks or ranking.

scholarly journals The complete list of prime knots whose flat plumbing basket numbers are 6 or less

2015 ◽  
Vol 24 (07) ◽  
pp. 1550042
Author(s):  
Yoon-Ho Choi ◽  
Yun Ki Chung ◽  
Dongseok Kim
Keyword(s):  
Complete Classification ◽  
Classification Theorem ◽  
Complete List ◽  
Sequential Presentation ◽  
Minimum Number ◽  
The Given

Flat plumbing basket surfaces of links were introduced to study the geometry of the complement of the links. These flat plumbing basket surfaces can be presented by a sequential presentation known as flat plumbing basket code first found by Furihata, Hirasawa and Kobayashi. The minimum number of flat plumbings to obtain flat plumbing basket surfaces of a link is defined to be the flat plumbing basket number of the given link. In this paper, we use these sequential presentations to find the complete classification theorem of prime knots whose flat plumbing basket number is 6 or less. As applications, this result improves the work of Hirose and Nakashima which finds the flat plumbing basket number of prime knots up to nine crossings.

scholarly journals Methods for simulating nutritional requirement and response studies with all organisms to increase research efficiency

2017 ◽  
Vol 117 (3) ◽  
pp. 473-477
Author(s):  
Dmitry Vedenov ◽  
Rashed A. Alhotan ◽  
Runlian Wang ◽  
Gene M. Pesti
Keyword(s):  
Response Curve ◽  
Theoretical Perspective ◽  
Nutrient Level ◽  
Nutritional Requirement ◽  
Microsoft Excel ◽  
Response Models ◽  
Nutrient Levels ◽  
Limiting Nutrient ◽  
Minimum Number ◽  
The Given

AbstractNutritional requirements and responses of all organisms are estimated using various models representing the response to different dietary levels of the nutrient in question. To help nutritionists design experiments for estimating responses and requirements, we developed a simulation workbook using Microsoft Excel. The objective of the present study was to demonstrate the influence of different numbers of nutrient levels, ranges of nutrient levels and replications per nutrient level on the estimates of requirements based on common nutritional response models. The user provides estimates of the shape of the response curve, requirements and other parameters and observation to observation variation. The Excel workbook then produces 1–1000 randomly simulated responses based on the given response curve and estimates the standard errors of the requirement (and other parameters) from different models as an indication of the expected power of the experiment. Interpretations are based on the assumption that the smaller the standard error of the requirement, the more powerful the experiment. The user can see the potential effects of using one or more subjects, different nutrient levels, etc., on the expected outcome of future experiments. From a theoretical perspective, each organism should have some enzyme-catalysed reaction whose rate is limited by the availability of some limiting nutrient. The response to the limiting nutrient should therefore be similar to enzyme kinetics. In conclusion, the workbook eliminates some of the guesswork involved in designing experiments and determining the minimum number of subjects needed to achieve desired outcomes.

scholarly journals Pricing a Lease Contract in Presence of Late Payment Extra-Charges

2019 ◽  
Vol 14 (11) ◽  
pp. 179
Author(s):  
Luciano Quattrocchio ◽  
Luisa Tibiletti ◽  
Mariacristina Uberti
Keyword(s):  
Sensitivity Analysis ◽  
Interest Rate ◽  
Lower Bound ◽  
Contract Term ◽  
Extra Charge ◽  
Charge Rate ◽  
Lease Contract ◽  
General Rules ◽  
Payment Rate ◽  
Roll Out

Partial insolvency in leasing contracts may entail to afford additional late payment costs. In this paper we focus on the case that the lessee makes partial payments in due time and settles the debt augumented by the late payment interests later. The presence of the extra-costs drives the lease Effective Annual interest Rate (EAR) to deviate from the lease contract rate. The aim of this work is to illustrate how design the contract payback amortization to stick EAR to the lease contract rate, when the lease contract rate, the late payment rate and the contract term are exogeneously fixed. First we achieve a proxy for EAR given by the lease contract rate plus an extra-charge rate addendum. We show that this latter addendum is sensitive to the payback Macaulay Duration, a weighted size and timing average. Specifically, the longer the Macaulay Duration, the smaller the extra-charge rate addendum. As a consequence, two general rules to drive EAR close to the lease contract rate roll out, specifically: (1) the payment pattern should be set with a long Macaulay Duration; and (2) the surrender value of the leased good should be put large. As the contract settlement is given, we show that EAR is delimited by a lower bound and an upper bound. Then the payback amortizations with fixed instalments are studied. To get insight on the importance of EAR inputs we roll sensitivity analysis out through illustrative applications. The results of the paper are useful to provide policymakers a better knowledge about the effects on EAR of the contract conditions on the pattern of payments.

Smooth B-Spline Curves Extension with Ordered Points Constraint

2011 ◽  
Vol 311-313 ◽  
pp. 1439-1445 ◽  
Author(s):  
Jin Xu
Keyword(s):  
Experimental Results ◽  
Maximum Deviation ◽  
Curve Segment ◽  
B Spline ◽  
Original Curve ◽  
Spline Curves ◽  
Minimum Number ◽  
The Given ◽  
Curve Extension ◽  
Extension Process

An algorithm for extending B-spline curves with a sequence of ordered points constraint is presented based on the curve unclamping algorithm. The ordered points are divided into two categories: interpolation points and approximation points. The number of interpolation points increases gradually during the curve extension process. The most important feature of this algorithm is the ability to optimize the knots of the extended curve segment according to the ordered points. Thus, with minimum number of interpolation points, the maximum deviation of the extended curve segment from the ordered points is less than the given tolerance. The extended curve segment connects to the original curve with maximum continuity intrinsically. Several experimental results have shown the validity and applicability of the proposed algorithm.

scholarly journals Design and Comparative Analysis of New Personalized Recommender Algorithms with Specific Features for Large Scale Datasets

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1106
Author(s):  
S. Bhaskaran ◽  
Raja Marappan ◽  
B. Santhi
Keyword(s):  
Large Scale ◽  
Real Life ◽  
Optimization Methods ◽  
Tuning Parameter ◽  
Computational Time ◽  
Data Set ◽  
Significant Difference ◽  
Minimum Number ◽  
Tremendous Amount ◽  
The Given

Nowadays, because of the tremendous amount of information that humans and machines produce every day, it has become increasingly hard to choose the more relevant content across a broad range of choices. This research focuses on the design of two different intelligent optimization methods using Artificial Intelligence and Machine Learning for real-life applications that are used to improve the process of generation of recommenders. In the first method, the modified cluster based intelligent collaborative filtering is applied with the sequential clustering that operates on the values of dataset, user′s neighborhood set, and the size of the recommendation list. This strategy splits the given data set into different subsets or clusters and the recommendation list is extracted from each group for constructing the better recommendation list. In the second method, the specific features-based customized recommender that works in the training and recommendation steps by applying the split and conquer strategy on the problem datasets, which are clustered into a minimum number of clusters and the better recommendation list, is created among all the clusters. This strategy automatically tunes the tuning parameter λ that serves the role of supervised learning in generating the better recommendation list for the large datasets. The quality of the proposed recommenders for some of the large scale datasets is improved compared to some of the well-known existing methods. The proposed methods work well when λ = 0.5 with the size of the recommendation list, |L| = 30 and the size of the neighborhood, |S| < 30. For a large value of |S|, the significant difference of the root mean square error becomes smaller in the proposed methods. For large scale datasets, simulation of the proposed methods when varying the user sizes and when the user size exceeds 500, the experimental results show that better values of the metrics are obtained and the proposed method 2 performs better than proposed method 1. The significant differences are obtained in these methods because the structure of computation of the methods depends on the number of user attributes, λ, the number of bipartite graph edges, and |L|. The better values of the (Precision, Recall) metrics obtained with size as 3000 for the large scale Book-Crossing dataset in the proposed methods are (0.0004, 0.0042) and (0.0004, 0.0046) respectively. The average computational time of the proposed methods takes <10 seconds for the large scale datasets and yields better performance compared to the well-known existing methods.

A new upper bound for sorting permutations with prefix transpositions

2020 ◽  
Vol 12 (06) ◽  
pp. 2050077
Author(s):  
Pramod P. Nair ◽  
Rajan Sundaravaradhan ◽  
Bhadrachalam Chitturi
Keyword(s):  
Symmetric Group ◽  
Upper Bound ◽  
A Genome ◽  
Minimum Number ◽  
Discrete Structures ◽  
The Given

Permutations are discrete structures that naturally model a genome where every gene occurs exactly once. In a permutation over the given alphabet [Formula: see text], each symbol of [Formula: see text] appears exactly once. A transposition operation on a given permutation [Formula: see text] exchanges two adjacent sublists of [Formula: see text]. If one of these sublists is restricted to be a prefix then one obtains a prefix transposition. The symmetric group of permutations with [Formula: see text] symbols derived from the alphabet [Formula: see text] is denoted by [Formula: see text]. The symmetric prefix transposition distance between [Formula: see text] and [Formula: see text] is the minimum number of prefix transpositions that are needed to transform [Formula: see text] into [Formula: see text]. It is known that transforming an arbitrary [Formula: see text] into an arbitrary [Formula: see text] is equivalent to sorting some [Formula: see text]. Thus, upper bound for transforming any [Formula: see text] into any [Formula: see text] with prefix transpositions is simply the upper bound to sort any permutation [Formula: see text]. The current upper bound is [Formula: see text] for prefix transposition distance over [Formula: see text]. In this paper, we improve the same to [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document