نتایج جستجو برای: sasanian coins

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

Journal: :Abstracta iranica 2021

This overview of Sasanian stuccoes includes sites divided chronologically – without losing sight the regional premises. The iconographic repertoire found in hitherto had been then catalogued ornamental, plant, figural, animal, and monograms. Noteworthy is paragraph on transmission architectural decorations. Although just a few motifs influenced Byzantine decorative language, several were transm...

2010
Pankaj Tandon

It seems fitting that, at a seminar organized to celebrate the 100 th anniversary of the Numismatic Society of India, I present a paper that offers a solution to a problem even older than the Society. In 1905, E. J. Rapson had published a small group of five coins which he identified as „Coins with reverse type “Svastika.”‟ 2 The coins were unified by the presence on their reverses of a central...

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 ...

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

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