The complexity of restrictions of Boolean functions is studied in various computational models. Lower bounds for the complexity of the most complicated restrictions to domains of fixed size are established. The complexity bounds are shown to be tight up to a constant multiplicative factor in the...

In this paper we compare two non-stationary time series using non-parametric procedures. Evolutionary spectra are estimated for the two series. Randomization tests are performed on groups of spectral estimates for both related and independent time series. Simulation studies show that in certain...

Discrete Mathematics is a fundamental subject for Information Technology (IT) majors. For students whose primary orientation is not to mathematics, but computing, it is important to relate fundamental mathematical principles to practical computing realities. At Bond University, Microsoft Excel...

We describe a mathematical model and simulation study for Jackpot Keno, as implemented by Jupiters Network Gaming (JNG) in the Australian state of Queensland, and as controlled by the Queensland Office of Gaming Regulation (QOGR) [7]. The recurrences for the house net hold are derived and it is...

It is shown that fractional voting system (FVS) can be used to circumvent Arrow's paradox. In the FVS, the input to the voting system is the preference distribution of the voters and not the usual preference order. As a consequence, it turns out that it is possible to associate a unique...

A set theory called Intuitive Set Theory is introduced in which Skolem Paradox does not appear. A measure function called real measure is defined in which Axiom of Choice cannot produce a nonmeasurable set

Least square method has been using in each domain of science and technology, but only suitable for equal precision data—because the evaluation is on the basis of the roughly the same absolute error. Yet most data of science research and observation are often evaluated according to the relative...

Let denote the class of intersection graphs of linear 3-uniform hypergraphs. In this paper a polynomial algorithm solving the recognition problem for the graphs with bound on minimum vertex degree δ()≥ 13 is proposed