Open Access Short communication

Scalable Functions Used for Empirical Forecasting

Peter Stallinga

Journal of Advances in Mathematics and Computer Science, Page 1-6
DOI: 10.9734/BJMCS/2016/28107

Empirical forecasting is the science of using past data to predict the future, without physical modeling. For these, probability functions are used, normally bell-shaped Gaussian or Gaussian- like. Taleb in his book the Black Swan introduces for this purpose the concept of scalable functions. Here it is shown that the only scalable functions are power-law functions and they can be treated as one and the same. Moreover, the analytical problems of these functions are discussed. Scalable functions are inadequate for empirical forecasting.

Open Access Original Research Article

Dynamics of Water Hyacinth in a Fishery System with Delay Effect

B. S. N. Murthy, M. A. S. Srinivas

Journal of Advances in Mathematics and Computer Science, Page 1-13
DOI: 10.9734/BJMCS/2016/27141

This paper analyses the dynamics of a fishery system in an aquatic environment that consists of two zones: water hyacinth zone and free zone. Fish harvesting is allowed in both the zones and fish migration is allowed from water hyacinth zone to free zone and not back. This paper presents dynamics of the stability when discrete time delay is incorporated in the fish death rate due to oxygen depletion and water pollution caused by water hyacinth. It is shown that the time delay can cause a switch from stable state to unstable state and there by Hopf-bifurcation occurs. Numerical simulations are carried out to validate the analytical findings.

Open Access Original Research Article

On the Non-Existence of Difference Sets with Perfect Square Order

Adegoke S. Osifodunrin

Journal of Advances in Mathematics and Computer Science, Page 1-17
DOI: 10.9734/BJMCS/2016/9173

The existence of Paley-Hadamard (4t − 1, 2t − 1, t − 1) difference sets provides a platform for solving the equation δ¯δ = n in the cyclotomic ring Z[ζ4t−1], where ζ4t−1 is root of unity, n > 1 and t > 1 are integers. We look at cases where ⟨n⟩ = ⟨δ⟩⟨¯δ⟩ in Z[ζ4t−1] but δ¯δ = n has trivial solutions. This criterion is combined with other results to conclude non-existence of some difference set parameters.

Open Access Original Research Article

Symbolic Dynamics Generated by a Hybrid Chaotic Systems

Carlos Correia Ramos, Ana Isabel Santos, Sandra Vinagre

Journal of Advances in Mathematics and Computer Science, Page 1-12
DOI: 10.9734/BJMCS/2016/27863

We consider piecewise defined differential dynamical systems which can be analysed through symbolic dynamics and transition matrices. We have a continuous regime, where the time flow is characterized by an ordinary differential equation (ODE) which has explicit solutions, and the singular regime, where the time flow is characterized by an appropriate transformation. The symbolic codification is given through the association of a symbol for each distinct regular system and singular system. The transition matrices are then determined as linear approximations to the symbolic dynamics. We analyse the dependence on initial conditions, parameter variation and the occurrence of global strange attractors.

Open Access Original Research Article

Common Fixed Points of Kannan and Chatterjea Types of Mappings in a Complete Metric Space

Risto Malčeski, Aleksa Malčeski, Katerina Anevska, Samoil Malčeski

Journal of Advances in Mathematics and Computer Science, Page 1-11
DOI: 10.9734/BJMCS/2016/27906

This paper contains several generalizations of the theorems for common fixed point of R. Kannan, S. K. Chatterjea and P. V. Koparde & B. B. Waghmode types of mappings. These generalizations are done by using a sequentially convergent mappings. Trough several examples, we have shown that the generalized claims are inapplicable, and that the obtained generalized claims prove the existence of a unique common fixed point of considered mappings.

Open Access Original Research Article

Open Access Original Research Article

Development of an Improved Cognitive Complexity Metrics for Object- Oriented Codes

O. Isola Esther, O. Olabiyisi Stephen, O. Omidiora Elijah, A. Ganiyu Rafiu, T. Ogunbiyi Dimple, Y. Adebayo Olajide

Journal of Advances in Mathematics and Computer Science, Page 1-11
DOI: 10.9734/BJMCS/2016/28515

Cognitive informatics helps in comprehending the software characteristics and its complexity measures can be used to predict critical information about testability of software system. In this paper, a cognitive complexity metric for C++ programming language is formulated. Since C++ is an object – oriented language, the cognitive complexity metric is capable to evaluate any object- oriented language. This paper presents a new cognitive complexity metric named Improved Cognitive Complexity Metric (ICCM) and perform a comparative study of the proposed metric with the existing metric such as NCCOP, CFS, CICM and CPCM. The result shows that the proposed metric performs better than other metrics by giving more information contained in the software and reflecting the understandability of a source code. Also, an attempt has also been made to present the relationship among ICCM, NCCOP, CICM, CFS and CPCM using Pearson correlation coefficient method.