Results 41 to 50 of about 38,613 (175)
One-Dimensional Quantum Walks with a Position-Dependent Coin [PDF]
We investigate the evolution of a discrete-time one-dimensional quantum walk driven by a position-dependent coin. The rotation angle which depends upon the position of a quantum particle parameterizes the coin operator. For different values of the rotation angle, we observe that such a coin leads to a variety of probability distributions, e.g ...
arxiv +1 more source
ESTETIKA VISUAL DAN NONVISUALKOIN CINA KUNO ASLI YANG DITEMUKAN DI BALI DAN KOIN CINA BUATAN LOKAL
Up to now, Balinese culture and art cannot be separated from the utiliza- tion of old Chinese coins which local people in Bali call pis bolong. The use of those old Chinese coins in traditional ritual in Bali is found even from the infants until the end ...
Tjokorda Udiana Nindhia Pemayun Pemayun+1 more
doaj
Dynamics and Probability in the Toss of a Coin with Symmetric Inhomogeneous Density [PDF]
Under investigation in this paper is the dynamics and probability of heads in the toss of a coin with symmetric inhomogeneous density. Such coins are assumed to have diagonal inertia matrix. The rotational motion of the coin is determined by the initial angular momentum and initial position of the coin.
arxiv
Optimal non-adaptive solutions for the counterfeit coin problem [PDF]
We give optimal solutions to all versions of the popular counterfeit coin problem obtained by varying whether (i) we know if the counterfeit coin is heavier or lighter than the genuine ones, (ii) we know if the counterfeit coin exists, (iii) we have access to additional genuine coins, and (iv) we need to determine if the counterfeit coin is heavier or ...
arxiv
Canonical Coin Systems for Change-Making Problems [PDF]
The Change-Making Problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, in most real money systems, the greedy algorithm yields optimal solutions. In this paper, we study what type of coin systems that guarantee the optimality of the greedy
arxiv
Coins of Three Different Weights [PDF]
We discuss several coin-weighing problems in which coins are known to be of three different weights and only a balance scale can be used. We start with the task of sorting coins when the pans of the scale can fit only one coin. We prove that the optimal number of weighings for $n$ coins is $\lceil 3n/2\rceil -2$.
arxiv
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits [PDF]
Consider the following abstract coin tossing problem: Given a set of $n$ coins with unknown biases, find the most biased coin using a minimal number of coin tosses. This is a common abstraction of various exploration problems in theoretical computer science and machine learning and has been studied extensively over the years.
arxiv
Coin Production in the Low Countries: Fourteenth Century to the Present.
The new dataset and web application ‘Coin Production in the Low Countries: fourteenth century to the present’ provides scholars with user-friendly access to mintmasters’ accounts going back to the Middle Ages.
Jaco Zuijderduijn+2 more
doaj
Brăţări din sârme torsionate şi împletite, lăţite la capete (secolele X–XV)
This paper analyses the torsioned bracelets, and the knitted bracelets, with plaques at the ends. The first part synthesizes the stage of the research in Romania.
Oța, S., Dragotă, A., Rustoiu, G.
doaj +1 more source
During preventive archaeological excavations in the area of Remetea Mare commune (Timiș County) in 2020, several medieval vestiges came to light, including nine coins (all silver alloy): Banat of Severin - Nicolae Redwitz (1429-1435?), 1 coin (coin no. 1)
Raoul Șeptilici+2 more
doaj