International Journal of Computer Mathematics Impact Factor & Information

Publisher: Taylor & Francis

Journal 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.

Current impact factor: 0.72

Impact Factor Rankings

2015 Impact Factor Available summer 2015
2013 / 2014 Impact Factor 0.721
2012 Impact Factor 0.542
2011 Impact Factor 0.499
2010 Impact Factor 0.489
2009 Impact Factor 0.478
2008 Impact Factor 0.308
2007 Impact Factor 0.423
2006 Impact Factor 0.428
2005 Impact Factor 0.254
2004 Impact Factor 0.216
2003 Impact Factor 0.226
2002 Impact Factor 0.139
2001 Impact Factor 0.162
2000 Impact Factor 0.121
1999 Impact Factor 0.133
1998 Impact Factor 0.145
1997 Impact Factor 0.18
1996 Impact Factor 0.18
1995 Impact Factor 0.092
1994 Impact Factor 0.126
1993 Impact Factor 0.192
1992 Impact Factor 0.22

Impact factor over time

Impact factor
Year

Additional details

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 can archive a post-print version
  • Conditions
    • Some individual journals may have policies prohibiting pre-print archiving
    • On author's personal website or departmental website immediately
    • On institutional repository or subject-based repository after either 12 months embargo
    • 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)
    • The publisher will deposit in on behalf of authors to a designated institutional repository including PubMed Central, where a deposit agreement exists with the repository
    • STM: Science, Technology and Medicine
    • Publisher last contacted on 25/03/2014
    • This policy is an exception to the default policies of 'Taylor & Francis'
  • Classification
    ​ green

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: Task Assignment in distributed server systems focuses on the policy that assigns the tasks reached these systems in order to improve the response time. These tasks, generally, have the property that there is a tiny fraction (about 3%) of the large tasks that makes half (50%) of the total load. However, this property creates additional problems: the large tasks make the load difficult to balance among the servers, and the small tasks will be delayed by the large ones when they are in the same queue. In this paper, we propose a new policy for the Web clusters that we call Partitioning Large Tasks (PLT) and which deals with these problems mostly under a high traffic demand and a high variability of task sizes. PLT partitions each large task into fragments and assigns them to be processed in a parallel way and completing at the same time to improve the mean response time, and separates the small tasks from the large tasks to avoid being delayed. Performance tests show a significantly improvement in performance of PLT over the existing task assignment policies.
    International Journal of Computer Mathematics 09/2015; 92(2):250-265. DOI:10.1080/00207160.2014.901660
  • International Journal of Computer Mathematics 09/2015; 92(9). DOI:10.1080/00207160.2015.1049010
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, an affine-scaling derivative-free trust-region method with interior backtracking line search technique is considered for solving nonlinear systems subject to linear inequality constraints. The proposed algorithm is designed to take advantage of the problem structured by building polynomial interpolation models for each function in the nonlinear system function F. The proposed approach is developed by forming a quadratic model with an appropriate quadratic function and scaling matrix: there is no need to handle the constraints explicitly. By using both trust-region strategy and interior backing line search technique, each iteration switches to backtracking step generated by the trust-region subproblem and satisfies strict interior point feasibility by line search backtracking technique. Under reasonable conditions, the global convergence and fast local convergence rate of the proposed algorithm are established. The results of numerical experiments are reported to show the effectiveness of the proposed algorithms.
    International Journal of Computer Mathematics 08/2015; 92(8). DOI:10.1080/00207160.2014.959942
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a computational method for numerical solution of a class of integro-differential equations with a weakly singular kernel of fractional order which is based on Cos and Sin (CAS) wavelets and block pulse functions is introduced. Approximation of the arbitrary order weakly singular integral is also obtained. The fractional integro-differential equations with weakly singular kernel are transformed into a system of algebraic equations by using the operational matrix of fractional integration of CAS wavelets. The error analysis of CAS wavelets is given. Finally, the results of some numerical examples support the validity and applicability of the approach.
    International Journal of Computer Mathematics 08/2015; 92(8). DOI:10.1080/00207160.2014.964692
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider the problem of capacitated covering with unit balls. In this problem, a set of weighted points in a metric space is given, and we want to cover them with a minimum number of the unit balls of that metric space provided that the total weight assigned to each unit ball is at most one. The problem is NP-hard as it generalizes the covering-with-unit-balls problem. We consider the problem in two cases: (1) the weight of each point can be split among several unit balls and (2) the unsplittable case. In the latter case, the problem is a generalization of the bin-packing problem even when , and thus it is not approximable under 1.5, unless P=NP. We design a polynomial-time approximation scheme (PTAS) for the splittable case when is a fixed constant and is an metric. This also results in a PTAS for the unsplittable case when all the points have the same weight. We also analyse several natural algorithms for this problem and prove that they achieve constant approximation factors.
    International Journal of Computer Mathematics 08/2015; 92(8). DOI:10.1080/00207160.2014.959506
  • International Journal of Computer Mathematics 07/2015; DOI:10.1080/00207160.2015.1061125
  • International Journal of Computer Mathematics 06/2015; DOI:10.1080/00207160.2015.1067311
  • [Show abstract] [Hide abstract]
    ABSTRACT: The Intellects-Masses Optimizer (IMO) is a new variant of cultural algorithm, which is used to solve continuous numerical optimization problems. The proposed method divides its population into two sub-populations, one that contains the fittest individuals (called the intellects) and the other sub-population, which includes the rest of the individuals in the population (called the masses). The two sub-populations evolve in parallel and influence each other. IMO is a simple, easy to code approach that has few, easy to tune parameters. The performance of IMO is investigated on 25 problems; five of them are real-world engineering problems and six high-dimensional problems. IMO is compared with 6 other state-of-the-art swarm intelligence approaches on the 25 problems. The results show that IMO generally outperforms the other approaches.
    International Journal of Computer Mathematics 06/2015; DOI:10.1080/00207160.2015.1067309
  • [Show abstract] [Hide abstract]
    ABSTRACT: Burgers’ equation can model several physical phenomena. In the first part of this work, we derive a three-level linearized difference scheme for Burgers’ equation, which is then proved to be energy conservative, unique solvable and unconditionally convergent in the maximum norm by the energy method combining with the inductive method. In the second part of the work, we prove the L ∞ unconditional convergence of a two-level linearized difference scheme for Burgers’ equation proposed by Sheng [A new difference scheme for Burgers equation, J. Jiangsu Normal Univ. 30 (2012), pp. 39–43], which was proved previously conditionally convergent.
    International Journal of Computer Mathematics 06/2015; 92(6). DOI:10.1080/00207160.2014.927059
  • [Show abstract] [Hide abstract]
    ABSTRACT: Circles are one of the basic drawing primitives for computers and while the naive way of setting up an equation for drawing circles is simple, implementing it in an efficient way using integer arithmetic has resulted in quite a few different algorithms. We present a short chronological overview of the most important publications of such digital circle generation algorithms. Bresenham is often assumed to have invented the first all integer circle algorithm. However, there were other algorithms published before his first official publication, which did not use floating point operations. Furthermore, we present both a 4 and an 8-connected all integer algorithm. Both of them proceed without any multiplication, using just one addition per iteration to compute the decision variable, which makes them more efficient than previously published algorithms.
    International Journal of Computer Mathematics 05/2015; DOI:10.1080/00207160.2015.1056170
  • [Show abstract] [Hide abstract]
    ABSTRACT: A vertex-colored graph G is said to be rainbow vertex-connected if every two vertices of G are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. In this paper, we study the rainbow vertex-connection number on the lexicographical, strong, Cartesian and direct product and present several upper bounds for these products of graphs. The rainbow vertex-connection number of some product networks are also investigated in this paper.
    International Journal of Computer Mathematics 05/2015; DOI:10.1080/00207160.2015.1047356