Numismatics deals with various historical aspects of the phenomenon Money. Computer vision explores the theory and technology to obtain and interpret information from images. Nowadays, numismatics is at a point where it can benefit greatly from the application of computer vision methods, and in turn provides a large number of new, challenging and interesting conceptual problems and data for com...

MAARTEN J.M. CHRISTENHUSZ, WILLIAM BAKER, MARK W. CHASE, MICHAEL F. FAY, SAMULI LEHTONEN, BEN VAN EE, MATT VON KONRAT, THORSTEN LUMBSCH, KAREN S. RENZAGLIA, JON SHAW, DAVID M. WILLIAMS & ZHI-QIANG ZHANG Botanical Garden and Herbarium, Finnish Museum of Natural History, PL 7 (Unioninkatu 44), 00014, University of Helsinki, Finland. E-mail: [email protected] Royal Botanic Gardens, ...

sezgin argued that written documents were used from early on and although collectors transmitted their works orally but extracted hadiths from written sources. according to him the isnads contain the name of authors and the authoritative transmitters of the books. also he proposed a method based on isnad analysis to single out the sources of a collector and to reconstruct the early lost works. ...

sources which were used for minting coins may help us recognize the mines that parthians used for mint houses that were marked on their coins. these signs may solve many politico-economic issues or may even lead to the recognition of their mines. the coins under study were related to ecbatana mint house and were extracted from silver mines through cupellation. the chemical composition of these ...

Off-line e-cash systems are the digital analogue of regular cash. One of the main desirable properties is anonymity: spending a coin should not reveal the identity of the spender and, at the same time, users should not be able to double-spend coins without being detected. Compact e-cash systems make it possible to store a wallet of O(2) coins using O(L+ λ) bits, where λ is the security paramete...

We study the efficiency of randomised solutions to the mutual search problem of finding k agents distributed over n nodes. For a restricted class of so-called linear randomised mutual search algorithms we derive a lower bound of k−1 k+1 (n + 1) expected calls in the worst case. A randomised algorithm in the shared-coins model matching this bound is also presented. Finally we show that in genera...

We study the multiparty communication model where players are the nodes of a network and each of these players knows his/her own identifier together with the identifiers of his/her neighbors. The players simultaneously send a unique message to a referee who must decide a graph property. The goal of this article is to separate, from the point of view of message size complexity, three different s...