نتایج جستجو برای: 62 parthian coins

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

1997
Warren E. Weber

We develop a model of commodity money and use it to analyze the following two questions motivated by issues in monetary history: What are the conditions under which Gresham's Law holds? And, what are the mechanics of a debasement (lowering the metallic content of coins)? The model contains light and heavy coins, imperfect information, and prices determined via bilateral bargaining. There are eq...

Journal: :BMJ 2009
P G Firth H Zheng J A Biller

OBJECTIVE To examine the relation between coins ingested by children and the Dow Jones Industrial Average. DESIGN Observational study. Main outcome measures Total value of coins ingested and number of incidents of coins versus other objects swallowed, measured before and after the stock market crash of October 2008. RESULTS Eighteen objects, including 11 coins, were ingested (NASDAQ (numism...

Journal: :Bulletin of the School of Oriental and African Studies 2013

2016
Frank Vriesekoop Jing Chen Jenna Oldaker Flavien Besnard Reece Smith William Leversha Cheralee Smith-Arnold Julie Worrall Emily Rufray Qipeng Yuan Hao Liang Amalia Scannell Cryn Russell

In this study we report the underlying reasons to why bacteria are present on banknotes and coins. Despite the use of credit cards, mobile phone apps, near-field-communication systems, and cryptocurrencies such as bitcoins which are replacing the use of hard currencies, cash exchanges still make up a significant means of exchange for a wide range of purchases. The literature is awash with data ...

Journal: :Computational Geometry 2006

Journal: :Emergency Medicine Journal 1999

Journal: :Scientific American 1896

1997
Yair Frankel Boaz Patt-Shamir Yiannis Tsiounis

We consider the k-payment problem: given a total budget of N units, represent this budget as a set of coins, so that any k exact payment requests of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k The actual payments are made on-line, namely without knowing all payment requests in advance. Our motivation ...

1997
Pat Frankel

We consider the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any givenN and k, while allowing the actual payments to be made on-line, namely without the need to know all payment ...

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

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