{"title":"Fit Adequacy of Dichotomous Logit Response Models of the Regressor Bernoulli and Binomial Probability Distributions","authors":"G. U. Ugwuanyim, C. Ogbonna","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.16.38","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.16.38","url":null,"abstract":"Logit models belong to the class of probability models that determine discrete probabilities over a limited number of possible outcomes. They are often called ‘Quantal Variables’ or ‘Stimulus and Response Models’ in Biological Literature. The conventional 2 R measure of goodness-of-fit is problematic in logit models. This has therefore led to the proposal of several alternative goodness-of-fit measures. But researchers in this area have identified the base rate problem in using these several alternative goodness-of-fit measures. This research is an extension of work done by people in this area. Specifically, this research is aimed at investigating the goodnessof-fit performances of eight statistics using the Bernoulli and Binomial distributions as explanatory variables under various scenarios. The study will draw conclusions on the “best” fit. The data for the study was generated through simulation and analysed using the multiple correlation analysis. The findings clearly show that for the Bernoulli Distribution, the goodness-of-fit statistics to use are: 2 2 2 , , o C M p R R R and λ ; and for the Binomial Distribution, the goodness-of-fit statistics to use are: 2 N R and p λ . 2 o R stood out as the “best” goodness-of-fit statistics.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132761802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adomian Decomposition Method for Solving Ratio-Dependent Prey-Predator System with Harvesting on Predator","authors":"V. Madhusudanan, P. Duraiswamy, S. Vijaya","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.15.36","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.15.36","url":null,"abstract":"In this article, Adomian Decomposition Method is used to find out the approximate solution of ratio-dependent prey-predator model with predator harvesting. The significance of ADM over other numerical discretization techniques is that it has the eminence to solve problems directly with no un-physical restrictive assumptions such as linearization, per-turbation, massive computation and any other transformation. ADM solves the problem and arrives at the approximate solution in the form of series with solution components that are easily computable. It requires very less work in comparison with other traditional methods. The graphical representations of prey and predator population contrasted with time are drawn to examine the performance and reliability of this technique.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124914335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Linear Complementarity Problem and a Modified Newton's Method to Find its Solution","authors":"Y. E. Foutayeni, M. Khaladi","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.15.17","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.15.17","url":null,"abstract":"In this paper, we present a new interior-point method of convergence order six to solve the linear complementarity problem. Computational efficiency in its general form is discussed and a comparison between the efficiency of the proposed method and existing ones is made. The performance is tested through numerical experiments on some test problems and a practical example of bio-economic equilibrium model.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130155262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Chebyshev Collocation Method for Finding the Eigenvalues of Fourth-Order Sturm-Liouville Problems","authors":"R. Darzi, B. Agheli","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.15.62","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.15.62","url":null,"abstract":"In this work, we have suggested that the Chebyshev collocation method can be employed for detecting the eigenvalues of fourth-order Sturm-Liouville problems. Two examples are presented subsequently. Numerical eventuates indicate that the present method is accurate. Introduction The boundary value problems for ordinary differential equations have a notable role theoretically. Also, they have diverse applications. A great number of physical, biological and chemical phenomena, can be explained through using boundary value problems. In this paper, Chebyshev collocationmethod is used to acquire the solutions for the subsequent fourth order nonsingular Sturm-Liouville problems (q0(x)y ′′(x))′′ + (q1(x)y ′(x))′ + (μv(x)− q2(x))y(x) = 0, a < x < b, (1) or y = F (y(x), y′(x), y′′(x), y′′′(x), μ) (2) or y + p3(x)y ′′′(x) + p2(x)y ′′(x) + p1(x)y ′(x) + (μw(x)− r(x))y(x) = 0 (3) with the four linearly independent homogeneous boundary conditions","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124880814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Chaoticity Properties of Fractionally Integrated Generalized Autoregressive Conditional Heteroskedastic Processes","authors":"A. Yilmaz, Gazanfer Unal","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.15.69","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.15.69","url":null,"abstract":"Fractionally integrated generalized autoregressive conditional heteroskedasticity (FIGARCH) arises in modeling of financial time series. FIGARCH is essentially governed by a system of nonlinear stochastic difference equations. In this work, we have studied the chaoticity properties of FIGARCH (p,d,q) processes by com- puting mutual information, correlation dimensions, FNNs (False Nearest Neighbour), the largest Lya- punov exponents (LLE) for both the stochastic difference equation and for the financial time series by applying Wolf's algorithm, Kant'z algorithm and Jacobian algorithm. Although Wolf's algorithm pro- duced positive LLE's, Kantz's algorithm and Jacobian algorithm which are subsequently developed methods due to insufficiency of Wolf's algorithm generated negative LLE's constantly. So, as well as experimenting Wolf's methods' inefficiency formerly pointed out by Rosenstein (1993) and more recently Dechert and Gencay (2000), based on Kantz's and Jacobian algorithm's negative LLE outcomes, we concluded that it can be suggested that FIGARCH (p,d,q) is not deter- ministic chaotic process.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129457840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ideals of Largest Weight in Constructions Based on Directed Graphs","authors":"A. Kelarev, W. Susilo, Mirka Miller, J. Ryan","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.15.8","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.15.8","url":null,"abstract":"We introduce a new construction based on directed graphs. It provides a common general- ization of the incidence rings and Munn semirings. Our main theorem describes all ideals of the largest possible weight in this construction. Several previous results can be obtained as corollaries to our new main theorem.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125882883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decomposition of S*α-Continuity","authors":"V. Thiripurasundari, S. Suganya","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.15.43","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.15.43","url":null,"abstract":"","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121957092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Method of Exterior Forms in Linear Programming","authors":"G. Kondratiev","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.14.7","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.14.7","url":null,"abstract":"The method of exterior forms by H. Grassmann and E. Cartan is used for solving the linear programming problem. It captures the essence of the problem in a convenient, compact form. The solution is presented by Cramer's like rules and is reduced to computing the set of values of the objective function at the vertices of the polyhedron constraints, without any explicit calculation of the vertices themselves.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134643849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"New Pretreatment and Resolution using the Bee Colony Optimization for the Two-Dimensional Bin Packing Problem","authors":"Aida Kenza Amara, B. Djebbar","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.14.13","DOIUrl":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.14.13","url":null,"abstract":"The two-dimensional bin packing problem involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. In this paper, we propose and develop mathematically a new pretreatment for the oriented version of the problem in order to reduce its size, identify and value the lost spaces by increasing the size of some objects. A heuristic method based on the first-fit strategy adapted to this problem is proposed. We present an approach of resolution using the bee colony optimization. The computational results show the effectiveness of the pretreatment in reducing the number of bins.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125613023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}