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

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

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

silver coins of alexander of macedonia, until the arrival of parthians in the 1st century bc, have been put in wdxrf in order to determin ag, cu, pb and au as major and trace elements for fineness, debasement and refinement of silver in ancient persia. seleucid kingdom from 4th to 1st century bc was succeeded by several dynasties and kings. but the chemical composition of their silver coins an...

We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let G be a weighted graph with n vertices. In the most general setting, the n vertices are known and no other information about G is given. The problem is finding all edges of G and their weights using additive queries, where, for an additive query, one chooses a set of vertices and asks the sum...

Last time we introduced the notion of interactive proof systems which models computation as a result of interaction between two parties. We defined public/private coin protocols, and showed that the graph non-isomorphism problem admits an interactive proof using private coins, as well as one using public coins. Today we will continue our discussion of interactive proof systems. We will study th...

This set of notes explains the process that Prof. Jones used to develop the FSM for the lab. The lab simulates a vending machine mechanism for automatically identifying coins (dimes and quarters only), tracking the amount of money entered by the user, accepting or rejecting coins, and emitting a signal when a total of 35 cents has been accepted. In the lab, we will only drive a light with the “...

We provide a mechanism that uses two biased coins and implements any distribution on a finite set of elements, in such a way that even if the outcomes of one of the coins is determined by an adversary, the final distribution remains unchanged. We apply this result to show that every quitting game in which at least two players have at least two continue actions has an undiscounted ε-equilibrium,...