International Journal of Computer Mathematics (INT J COMPUT MATH )

Publisher: Taylor & Francis

Description

Section A: Computer Systems: Programming Languages. This section contains work concerning research and development in computer systems and the theory of programming languages. Papers relating directly or indirectly to aspects of these fields are welcome. Of great interest is work in computer systems architectures and organisation, computer software and data structures, mathematical logic, formal languages, automata, artificial intelligence, parallelism and concurrency, analysis of algorithms, computational complexity, combinatorial algorithms, and symbol manipulation. The journal is intended to provide a forum for the expression of new ideas, as well as a place for exposition of these areas of knowledge. Section B: Computational Methods: Application. This section contains work concerning mathematical techniques that are of interest to computer users in the fields of numerical analysis, mathematical software, discrete mathematics, computational geometry and graphics, image processing, pattern recognition, simulation and modelling, operations research and applied mathematics in general.

  • Impact factor
    0.54
    Show impact factor history
     
    Impact factor
  • 5-year impact
    0.56
  • Cited half-life
    5.00
  • Immediacy index
    0.37
  • Eigenfactor
    0.00
  • Article influence
    0.23
  • Website
    International Journal of Computer Mathematics website
  • Other titles
    International journal of computer mathematics (Online)
  • ISSN
    0020-7160
  • OCLC
    50166329
  • Material type
    Document, Periodical, Internet resource
  • Document type
    Internet Resource, Computer File, Journal / Magazine / Newspaper

Publisher details

Taylor & Francis

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author cannot archive a post-print version
  • Restrictions
    • 12 month embargo for STM, Behavioural Science and Public Health Journals
    • 18 month embargo for SSH journals
  • Conditions
    • Some individual journals may have policies prohibiting pre-print archiving
    • Pre-print on authors own website, Institutional or Subject Repository
    • Post-print on authors own website, Institutional or Subject Repository
    • Publisher's version/PDF cannot be used
    • On a non-profit server
    • Published source must be acknowledged
    • Must link to publisher version
    • Set statements to accompany deposits (see policy)
    • Publisher will deposit to PMC on behalf of NIH authors.
    • STM: Science, Technology and Medicine
    • SSH: Social Science and Humanities
    • 'Taylor & Francis (Psychology Press)' is an imprint of 'Taylor & Francis'
  • Classification
    ​ yellow

Publications in this journal

  • International Journal of Computer Mathematics 05/2013;
  • [show abstract] [hide abstract]
    ABSTRACT: A stage-structured model for a theoretical epidemic process that incorporates immature, susceptible and infectious individuals in independent stages is formulated. In this analysis, an input interpreted as a birth function is considered. The structural identifiability is studied using the Markov parameters. Then, the unknown parameters are uniquely determined by the output structure corresponding to an observation of infection. Two different birth functions are considered: the linear case and the Beverton-Holt type to analyze the structured epidemic model. Some conditions on the parameters to obtain nonzero disease-free equilibrium points are given. The identifiability of the parameters allows us determine uniquely the basic reproduction number $\mathcal{R}_0$ and the stability of the model in the equilibrium is studied using $\mathcal{R}_0$ in terms of the model parameters.
    International Journal of Computer Mathematics 05/2013;
  • [show abstract] [hide abstract]
    ABSTRACT: Ear is a relatively new biometric among others. Many methods have been used for ear recognition to improve the performance of ear recognition systems. In continuation of these efforts we propose a new ear recognition method based on curvelet transform. Features of the ear are computed by applying Fast Discrete Curvelet Transform (FDCT) via wrapping technique. Feature vector of each image is composed of approximate curvelet coefficient and 2nd coarsest level curvelet coefficients at eight different angles. K-NN (k-nearest neighbour) is utilized as classifier. The proposed method is experimented on two ear databases from IIT Dehli. Results achieved by using the proposed method on publicly available ear database are up to 97.77% which show encouraging performance.
    International Journal of Computer Mathematics 04/2013;
  • [show abstract] [hide abstract]
    ABSTRACT: In this article, we provide a matrix method in order to compute orbits of parallel and sequential dynamical systems on Boolean functions. In this sense, we develop algorithms for systems defined over directed (and undirected) graphs when the evolution operator is a general minterm or maxterm and, likewise, when it is constituted by independent local Boolean functions, so providing a new tool for the study of orbits of these dynamical systems.
    International Journal of Computer Mathematics 03/2013; 90(9):1796-1808.
  • [show abstract] [hide abstract]
    ABSTRACT: A $k$-partition $\Pi$ $=$ $\{S_1, S_2,\ldots,S_k\}$ of the vertex set of $G$ is said to be a locatic partition if for every pair of distinct vertices $v$ and $w$ of $G$, there exists a vertex $s \in S_i$ for all $1\leq i\leq k$ that distinguishes $v$ and $w$. The cardinality of a largest locatic partition is called the locatic number of $G$. In this paper, we study the locatic number of paths, cycles and characterize all the connected graphs of order $n$ having locatic number $n$, $n-1$ and $n-2$. Some realizable results are also given in this paper.
    International Journal of Computer Mathematics 02/2013; 90(5):912-920.
  • [show abstract] [hide abstract]
    ABSTRACT: In this paper, we present many new fourth-order optimal families of Jarratt’s method and Ostrowski’s method for computing simple roots of nonlinear equations numerically. The proposed families of Jarratt’s method having the same scaling factor of functions as that of Jarratt’s method (i.e. quadratic scaling factor of functions in the numerator and denominator of the correction factor) are the main finding of this paper. It is observed that the body structures of our proposed families of Jarratt’s method are simpler than those of the original families of Jarratt’s method. The efficiency of these methods is tested on a number of relevant numerical problems. Furthermore, numerical examples suggest that each member of the proposed families can be competitive to other similar robust methods available in the literature. Keywords: nonlinear equations; simple roots; Halley’s method; Schröder’s method; Jarratt’s method; Ostrowski’s method; optimal order of convergence; efficiency index
    International Journal of Computer Mathematics 02/2013; Vol. 90, No. 2, 408–422, http://dx.doi.org/10.1080/00207160.2012.719078(Vol. 90, No. 2, 408–422, http://dx.doi.org/10.1080/00207160.2012.719078):408-422.
  • [show abstract] [hide abstract]
    ABSTRACT: The cost of time has been suggested as a factor associated with the choice overload problem. This term refers to the discomfort or paralysis experienced by individuals when facing a choice within a large set of alternatives, as it has been evidenced in experiments by behavioural and social psychologists. We introduce a rational model of time allocation to analyse how increasing the number of options of a given product may change consumer's allocation of time and in turn affect her welfare. Under some standard assumptions, the numerical analysis of the model reproduces two key experimental findings, namely choice paralysis – i.e. the choice problem is abandoned if the number of options is too large – and choice dissatisfaction – that is, the apparent paradox that increasing the number of considered options beyond certain limit, in turn choosing better, eventually diminishes welfare. The model analysis provides specific threshold values for the occurrence of both phenomena.
    International Journal of Computer Mathematics 01/2013;
  • [show abstract] [hide abstract]
    ABSTRACT: A class of high order Continuous Third Derivative Formulas (CTDFs) for second order Ordinary Differential Equations (ODEs) is proposed. The CTDFs are used to generate main and additional methods which are combined to give the Block Third Derivative Formulas (BTDFs). The BTDFs are applied as single block matrix equations to simultaneously provide approximate solutions for second order ODEs. The stability properties of the BTDFs are discussed. Numerical examples are given to illustrate the accuracy and efficiency of the block extensions of the methods
    International Journal of Computer Mathematics 01/2013;
  • [show abstract] [hide abstract]
    ABSTRACT: In a previous work, for parallel dynamical systems over digraphs corresponding to the simplest Boolean functions AND and OR, we proved that only fixed or eventually fixed points appear, as it occurs over undirected dependency graphs. Nevertheless, for general Boolean functions, it was shown that any period can appear, depending on the Boolean function that infers the global evolution operator of the system and on the structure of the dependency digraph. Motivated by these results, in this work, we analyse the orbit structure of parallel discrete dynamical systems over some special digraph classes.
    International Journal of Computer Mathematics 01/2013; 90(10):2039-2048.
  • International Journal of Computer Mathematics 01/2013;
  • [show abstract] [hide abstract]
    ABSTRACT: In generalized one-sided forbidding grammars (GOFGs), each context-free rule has associated a finite set of forbidding strings, and the set of rules is divided into the sets of left and right forbidding rules. A left forbidding rule can rewrite a nonterminal if each of its forbidding strings is absent to the left of the rewritten symbol. A right forbidding rule is applied analogically. Apart from this, they work like any generalized forbidding grammar. This paper proves the following three results. (1) GOFGs where each forbidding string consists of at most two symbols characterize the family of recursively enumerable languages. (2) GOFGs where the rules in one of the two sets of rules contain only ordinary context-free rules without any forbidding strings characterize the family of context-free languages. (3) GOFGs with the set of left forbidding rules coinciding with the set of right forbidding rules characterize the family of context-free languages.
    International Journal of Computer Mathematics 01/2013; 90(2):1-11.

Related Journals