Divisible e-cash, proposed in 1991 by Okamoto and Ohta, addresses a practical concern of electronic money, the problem of paying the exact amount. Users of such systems can indeed withdraw coins of a large value N and then divide it into many pieces of any desired values V ≤ N . Such a primitive therefore allows to avoid the use of several denominations or change issues. Since its introduction,...

In its simplest form, the coin problem is this: what is the largest positive amount of money that cannot be obtained using two coins of specified distinct denominations? For example, using coins of 2 units and 3 units, it is easy so see that every amount greater than or equal to 2 can be obtained, but 1 cannot be obtained. Using coins of 2 units and 5 units, every amount greater than or equal t...

This paper proposes the creation of a Sovereign Borrowing Entity (SBE) under the auspices of the International Monetary Fund (IMF) and other International Financial Institutions (IFIs). The SBE guarantees bond issuances by developing nations, packages them in relatively small denominations, and auctions them to the public. Should a developing debtor country fail to pay its debt, the SBE would r...

The findings, interpretations, and conclusions expressed herein are those of the authors and do not necessarily reflect the views of the Board of Executive Directors of the World Bank, the governments they represent, or of any other organization. The World Bank does not guarantee the accuracy of the data included in this work. The boundaries, colors, denominations, and other information shown o...

Automatic Directory Assistance (DA) for business listings poses many application specific problems. One of the main problem is that customers formulate their requests for the same listing with a great variability. This paper presents the results of a study aiming at the evaluation of an approach towards automatic learning, from field data, of expressions typically used by customers to formulate...

Given a set of positive integers A = {a1, . . . , ad} with gcd(a1, . . . , ad) = 1, we call an integer n representable if there exist nonnegative integers m1, . . . ,md such that n = m1a1 + · · ·+mdad . In this paper, we discuss the linear diophantine problem of Frobenius: namely, find the largest integer which is not representable. We call this largest integer the Frobenius number g(a1, . . . ...

The electrocardiogram (ECG) criteria for the left septal fascicular block (LSFB) are not universally accepted and many other denominations can be seen in literature: focal septal block, septal focal block, left septal fascicular block, left anterior septal block, septal fascicular conduction disorder of the left branch, left septal Purkinje network block, left septal subdivision block of the le...

RDF Data Cube allows the modeling and publishing of Linked Statistical Data (LSD) in the Semantic Web. Often, variable values of such statistical data come in a non-standardized way and represented by too narrow, concrete or wrongly typed literals. Generally, adequate and standard concept schemes for such variables (especially in very specific domains like historical religious denominations, or...

Bangladesh hosts religious minorities that reflect the diverse faith traditions that have been influential in the historical region of Bengal over the millennia. Hindus, at 9.1 percent of the national population, are Bangladesh’s largest religious minority, though the Hindu population has declined significantly over the past 60 years since Partition (see figure 4). Buddhist communities, concent...

A coin set is a strictly increasing list of positive integers that always begins with 1. A coin set is called greedy when the simple greedy change-making algorithm always produces the fewest number of coins in change. Here, the greedy changemaking algorithm repeatedly selects the largest denomination coin less than the remaining amount until it has assembled the correct change. Pearson has prov...