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

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

Journal: :The Journal of Egyptian Archaeology 1922

Journal: :Bankarstvo 2015

Journal: :Journal of Combinatorial Theory, Series A 1994

Journal: :Bankarstvo 2018

Journal: :Journal of risk and financial management 2022

This paper examined a set of over two thousand crypto-coins observed between 2015 and 2020 to estimate their credit risk by computing probability death. We employed different definitions dead coins, ranging from academic literature professional practice; alternative forecasting models, scoring models machine learning time-series-based models; horizons. found that the choice coin-death definitio...

2007
Preeti Parashar

The largest ensemble of qubits which satisfy the general transformation of equal superposition is obtained by different methods, namely, linearity, no-superluminal signalling and non-increase of entanglement under LOCC. We also consider the associated quantum random walk and show that all unitary balanced coins give the same asymmetric spatial probability distribution. It is further illustrated...

2011
D J Finney

Deductive reasoning Deductive reasoning is reasoning from the general to the specific. It is what we colloquially think of as "logic". A deductive inference is a judgment or generalization based on axioms or assumptions. For example, if two coins are assumed perfectly balanced then one can conclude that the mean number of heads of tossing these two coins must be one. The deductive generalizatio...

2006
S. D. Karunanayaka Sen Gupta

This paper has described use of different types of planar electromagnetic sensors to test integrity of currency coins from several different countries. Three types of planar electromagnetic sensors, Mesh, Meander and Interdigital configuration have been used for testing. An effective method to test the integrity of coins using these three types of sensors has been explored. Finite Element model...

Journal: :Discrete Applied Mathematics 1995
Annalisa De Bonis Luisa Gargano Ugo Vaccaro

We consider the problem of locating a light coin out of a set containing n coins, n ? 1 of which have the same weight. The weighing device is a balance with r 2 pans and, when r equally sized subset of coins are weighted, it indicates the eventual subset containing the light coin. We give an algorithm to nd the counterfeit coin that requires the minimum possible average number of weighings. All...

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

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