2015/2
http://hdl.handle.net/11012/63083
Thu, 19 Sep 2019 23:48:53 GMT2019-09-19T23:48:53ZBookmaker's dilemma
http://hdl.handle.net/11012/63091
Bookmaker's dilemma
Haugen, K. K.
In this paper, a game between two bookmakers is analysed. The simple game involves high or low odds strategies for each bookmaker, and an inherent Prisoner's Dilemma structure is revealed. However, this structure may be partially resolved given parametric changes in pro t structures that might lead to a “Stag Hunt Game". An argument for possible bookmaker arbitrage is added. Although this argument is well known, it is sparsely treated in research literature. A proof of the necessity of di ering beliefs between gamblers to obtain bookmaker arbitrage is added.
Thu, 01 Jan 2015 00:00:00 GMThttp://hdl.handle.net/11012/630912015-01-01T00:00:00ZOn perturbation of binary linear codes
http://hdl.handle.net/11012/63090
On perturbation of binary linear codes
Das, P. K.; Vashisht, L. K.
We present new codes by perturbation of rows of the generating matrix of a given linear code. Some properties of the perturbed linear codes are given.
Thu, 01 Jan 2015 00:00:00 GMThttp://hdl.handle.net/11012/630902015-01-01T00:00:00ZThe Role of Continuous Processes in Cognitive Development
http://hdl.handle.net/11012/63094
The Role of Continuous Processes in Cognitive Development
Pfaltz, J. L.
Many scientists observing the cognitive development in children have noted distinct phases in the way they learn. One phase appears to be a gradual accumulation of experience. Another phase appears to be a reorganization of those experiences to make them more useful. In this paper we show how mathematical closure concepts can be used to abstractly model these cognitive processes. Closed sets, which we will call knowledge units, represent tight collections of experience, facts, or skills, etc. Associated with each knowledge unit is the notion of its generators consisting of those attributes which characterize it. Finally, we provide a rigorous mathematical model of these di erent kinds of learning in terms of continuous and discontinuous transformations. There are illustrations of both kinds of transformation, together with necessary and su cient criteria for certain kinds of transformation to be continuous. By using a rigorous de nition, one can derive necessary alternative properties which may be more easily observed in experimental situations. The formal mathematics is illustrated with reference to Lev Vygotsky's view of cognitive psychology, but it is not a veri cation of his model. We believe that this concept of \continuity" can be re ned to test, and possibly verify, his and other models of cognitive behavior.
Thu, 01 Jan 2015 00:00:00 GMThttp://hdl.handle.net/11012/630942015-01-01T00:00:00ZEfficiency comparison of Hopfield network with simulated annealing as optimization methods for solving the traveling salesman problem
http://hdl.handle.net/11012/63092
Efficiency comparison of Hopfield network with simulated annealing as optimization methods for solving the traveling salesman problem
Křivan, M.; Budínská, B.
This paper formulates an open traveling salesman optimization problem and presents a general description of the solution of this problem using Hop eld network and simulated annealing heuristic optimization technique. The experiment described is performed on a set of 45 European cities. The experiment was processed by a specialized computer program.
Thu, 01 Jan 2015 00:00:00 GMThttp://hdl.handle.net/11012/630922015-01-01T00:00:00Z