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

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
  • [Show abstract] [Hide abstract]
    ABSTRACT: Rotation symmetric Boolean functions have been extensively studied for about 15 years because of their applications in cryptography and coding theory. Until recently little was known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in 2009. For the much more complicated case of cubic rotation symmetric functions generated by a single monomial, the affine equivalence classes under permutations which preserve rotation symmetry were determined in 2011. It was conjectured then that the cubic equivalence classes are the same if all nonsingular affine transformations, not just permutations, are allowed. This conjecture is probably difficult, but here we take a step towards it by proving that the cubic affine equivalence classes found in 2011 are the same if all permutations, not just those preserving rotation symmetry, are allowed. The needed new idea uses the theory of circulant matrices.
    International Journal of Computer Mathematics 08/2015; 92(8). DOI:10.1080/00207160.2014.964693
  • [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, 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 we discuss a local radial basis function-based finite difference (RBF-FD) scheme for numerical solution of multi-asset American option problems. The governing equation is discretized by the -method and the option price is approximated by the RBF-FD method. Numerical experiments are performed with the multiquadratic radial basis function for single and double asset problem and results obtained are compared with existing ones. We show numerically that the scheme is second-order accurate. Stability of the scheme is also discussed.
    International Journal of Computer Mathematics 08/2015; 92(8). DOI:10.1080/00207160.2014.950571
  • [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
  • [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
  • International Journal of Computer Mathematics 05/2015; DOI:10.1080/00207160.2015.1041935
  • International Journal of Computer Mathematics 05/2015; DOI:10.1080/00207160.2015.1046846
  • International Journal of Computer Mathematics 05/2015; DOI:10.1080/00207160.2015.1045887
  • [Show abstract] [Hide abstract]
    ABSTRACT: In order to minimize the impact of secret signing key exposure in attribute based signature scenario, we construct an attribute based key-insulated signature (ABKIS) scheme for expressive monotone boolean function access structures utilizing only 4 pairing operations in verification process and making the signature length constant, i.e., the number of pairings required for signature verification and the size of signature are independent of the size of attribute set participated in the respective process. The (strong) key-insulated selective security of our ABKIS scheme is reduced to the computational Diffie Hellman Exponent problem without using any random oracles. The proposed construction attains signer privacy, which is a fundamental requirement of the signature schemes in the attribute based setting.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1037838
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the linear matrix equation AXB=C is considered, where A ∈ ℝn × m, B ∈ ℝq × s are given large matrices and C ∈ ℝn × s, X ∈ ℝm × q are right-hand side and unknown matrices, respectively. The GL-LSQR algorithm is applied to approximate the solution of this group of matrix equations. The right-left preconditioned global least squares algorithm is presented for obtaining the approximate solution of the mentioned matrix equation. This preconditioner is based on the C-orthogonalization process, where C is a symmetric positive definite matrix. Also the itearive method and its preconditioned algorithm are proposed to find the approximate generalized inverses of nearly singular matrices and rectangular matrices. Finally, some numerical experiments are given to illustrate the efficiency of the new preconditioners.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1045420
  • [Show abstract] [Hide abstract]
    ABSTRACT: A technique for extending the Laplace transform method to solve nonlinear differential equations is presented. By developing several theorems, which incorporate the Adomian polynomials, the Laplace transformation of nonlinear expressions is made possible. A number of well-known nonlinear equations including the Riccati equation, Clairaut's equation, the Blasius equation and several other ones involving nonlinearities of various types such as exponential and sinusoidal are solved for illustration. The proposed approach is analytical, accurate, and free of integration.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1045421
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study the vulnerability of networks in the case of random removal of individual nodes. To achieve this goal, a network reliability measure, the probability of messages facing malfunctions, has been proposed. The benefit of this measure is its capability of applying in the wide range of graphs. Moreover, it is well suited to human activities and foraging patterns of some sorts of animals, while they are trying to make an alternative path in the case of facing failures. We examine the most prominent communication networks such as meshes and tori; further, CAN, Chord, Petersen, PRU, and Hypergrid, that are well suited for P2P networks, have been investigated. In order to gain a better understanding of the studied networks vulnerability and easier evaluating the proposed measure, an ant colony-based communication protocol has been presented. Experimental results verify the correctness of the proposed measure.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1045296
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose a new reformulation for stochastic complementarity problems (SCP). The new formulation is based on the minimum mean squared deviation (MMSD) rule in statistics. Under mild conditions, we prove the existence of the solution of the new reformulation for SCP. Furthermore, we present a smoothing sample average approximation (SAA) method for solving the problems. The convergence properties of the optimal solutions of the approximation problems is studied under mild conditions. Finally, some numerical results are listed as well.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1040400
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the mixed Navier-Stokes/Darcy problem which describes a fluid flow filtrating through porous media is considered. Based on two-grid discretizations, two local and parallel finite element algorithms for solving this mixed model are proposed. Numerical analysis and experiments are presented to show the efficiency and effectiveness of the local and parallel finite element algorithms.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1026338
  • [Show abstract] [Hide abstract]
    ABSTRACT: We treat the way to achieve great computational savings and accuracy in the evaluation of barrier options through Boundary Element Method (BEM). The proposed method applies to quite general pricing models. The only requirement is the knowledge of the characteristic function for the underlying asset distribution, usually available under general asset models. This paper serves as an introductory work to illustrate the implementation of BEM using numerical Fourier inverse transform of the characteristic function and to numerically show its stability and efficiency under simple frameworks such as the Black-Scholes model.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1020304
  • [Show abstract] [Hide abstract]
    ABSTRACT: An efficient identity-based encrypion (IBE) scheme over lattice is proposed in this paper. Under the hardness of the learning with errors problem (LWE), the proposed scheme is semantic secure against adaptive chosen identity and chosen plaintext attack in the standard model. To improve the efficiency of the lattice-based IBE scheme, unlike the identity string is encoded into a matrix by a group of public matrices in several known constructions, the identity string of l bits is encoded into a vector with the help of l+1 vectors in this paper. With the help of this idea, we achieve the private key extraction of IBE scheme at the same lattice. Then, the public key of the proposed scheme only consists as one n×m matrix and l+1 vectors, compared with that the public keys of the known lattice-based IBE schemes all consist as a group of n×m matrices. Hence the public key size of this scheme is shorter than that of the known constructions.
    International Journal of Computer Mathematics 04/2015; DOI:10.1080/00207160.2015.1029464
  • [Show abstract] [Hide abstract]
    ABSTRACT: We describe multi-parameter continuation methods combined with spectral collocation methods for computing numerical solutions of rotating two-component Bose–Einstein condensates (BECs), which are governed by the Gross–Pitaevskii equations (GPEs). Various types of orthogonal polynomials are used as the basis functions for the trial function space. A novel multi-parameter/multiscale continuation algorithm is proposed for computing the solutions of the governing GPEs, where the chemical potential of each component and angular velocity are treated as the continuation parameters simultaneously. The proposed algorithm can effectively compute numerical solutions with abundant physical phenomena. Numerical results on rotating two-component BECs are reported.
    International Journal of Computer Mathematics 04/2015; 92(4). DOI:10.1080/00207160.2014.915959