International Journal of Computer Applications in Technology Impact Factor & Information

Publisher: Inderscience

Journal description

IJCAT addresses issues of computer applications, information and communication systems, software engineering and management, CAD/CAM/CAE, numerical analysis and simulations, finite element methods and analyses, robotics, computer applications in multimedia and new technologies, computer aided learning and training. The objective of IJCAT is to help professionals working in the field, educators and policy makers to contribute, to disseminate information and to learn from each other's work. IJCAT also aims at establishing channels of communication between Centres of Excellence for computer applications, computer manufacturers, software developers and users worldwide. IJCAT is the official publication of the International Network of Centres for Computer Applications (INCCA).

Current impact factor: 0.00

Impact Factor Rankings

2015 Impact Factor Available summer 2016
2000 Impact Factor 0.041
1999 Impact Factor 0.068
1998 Impact Factor 0.015
1997 Impact Factor 0.058

Impact factor over time

Impact factor

Additional details

5-year impact 0.00
Cited half-life 0.00
Immediacy index 0.00
Eigenfactor 0.00
Article influence 0.00
Website International Journal of Computer Applications in Technology website
Other titles IJCAT
ISSN 0952-8091
OCLC 163253392
Material type Internet resource
Document type Internet Resource, Computer File, Journal / Magazine / Newspaper

Publisher details


  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author cannot archive a post-print version
  • Restrictions
    • 6 months embargo
  • Conditions
    • Cannot archive until publication
    • Author's pre-print and Author's post-print on author's personal website, institutional repository or subject repository
    • Publisher copyright and source must be acknowledged
    • Must link to journal webpage and /or DOI
    • Publisher's version/PDF cannot be used, unless covered by funding agency rules
    • Authors covered by funding agency rules, may post the Publisher's Version/PDF in subject repositories after a 6 months embargo
    • Reviewed 10/02/2014
    • Author's post-print equates to Inderscience's Proof
  • Classification

Publications in this journal

  • International Journal of Computer Applications in Technology 12/2015;

  • International Journal of Computer Applications in Technology 07/2015; 12(I):233-240.

  • International Journal of Computer Applications in Technology 07/2015; 51(4). DOI:10.1504/IJCAT.2015.070492

  • International Journal of Computer Applications in Technology 01/2015; 51(4):306. DOI:10.1504/IJCAT.2015.070493
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the algorithms to scan converting conics on hexagonal grid using method of deviation are proposed. The method of deviation computes the pixel nearest to the analogue curve using only integer arithmetic. The proposed algorithm is compared favourably with the latest conics drawing algorithm on hexagonal grid. The idea may be applied to scan converting any arbitrary curves. The transformation function to convert Cartesian coordinate system to hexagonal coordinate system is also proposed.
    International Journal of Computer Applications in Technology 01/2015; 51(1). DOI:10.1504/IJCAT.2015.068402

  • International Journal of Computer Applications in Technology 01/2015; 51(1). DOI:10.1504/IJCAT.2015.068401
  • [Show abstract] [Hide abstract]
    ABSTRACT: For packing problems that are complex optimisation problems, the solutions must rely on heuristics. Particle swarm optimisation (PSO) is an emerging technique that utilises heuristics. Because of its simplicity, PSO has been widely applied to a variety of fields, including applications to the packing problem. This paper researches the search efficiency of the PSO algorithm. Through fitting the data to the length of the solution interval and the number of iterations, a strong search capability for the PSO is proved. Then, the results of experiments with comparisons of many disturbance strategies show that a stochastic strategy is beneficial for raising the search capability of the algorithm.
    International Journal of Computer Applications in Technology 01/2015; 51(1). DOI:10.1504/IJCAT.2015.068395
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper describes a technique - efficient cloud detection and removal (ECDR) algorithm based on remote sensing information. It is obvious that cloud masking has been a challenging risk in receiving the information from the satellite sensor images. For instance, in-paint and multitemporal averaging method, which are existing approaches implemented against the cloud masking but still the requirement has been found inadequate as it has partially contributed to its removal. Hence, the proposed ECDR algorithm paves the way to find accurate information. The cloud-obscured area reconstructed by the ECDR algorithm involves two steps: detecting the cloudy region by pixels values and reconstruction of cloudy regions. For cloud masking, the algorithm calculates the percentage of variance in earlier remote sensing information and, based on the percentage, the cloud pixel value is replaced. Thus, the found ECDR algorithm accuracy is much better than the existing algorithms for deducing information.
    International Journal of Computer Applications in Technology 01/2015; 51(1). DOI:10.1504/IJCAT.2015.068400
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recently, sparse classifier (SC) has become a promising classification technique and is increasingly attracting attention in signal processing, computer vision and pattern recognition. In this paper, a new classification algorithm based on a weighted sparse representation model, called improved sparse classifier, is proposed for robust facial expression recognition. The effectiveness and robustness of the proposed method is investigated on clean and occluded facial expression images. The performance of the proposed method on robust facial expression recognition is compared with SC, the nearest neighbour (NN), linear support vector machines (SVM) and the nearest subspace (NS). Experimental results on two benchmarking facial expression databases, i.e., the JAFFE database and the Cohn-Kanade database, demonstrate that the proposed method obtains promising performance and a strong robustness to corruption and occlusion on robust facial expression recognition tasks.
    International Journal of Computer Applications in Technology 01/2015; 52(1):59. DOI:10.1504/IJCAT.2015.071420
  • [Show abstract] [Hide abstract]
    ABSTRACT: Simulated annealing (SA) algorithm is extremely slow in convergence, and the implementation and efficiency of parallel SA algorithms are typically problem-dependent. To overcome such intrinsic limitations, this paper presents a multi-agent SA (MSA) algorithm to address protein structure prediction problems based on the 2D off-lattice model. Inspired by the learning ability of the mutation operators in differential evolution algorithm, three differential perturbation (DP) operators are defined to generate candidate solutions collaboratively. This paper also analyses the effect of different sampling grain, which determines how many dimensions will be perturbed when a candidate solution is generated. The proposed MSA algorithm can achieve better intensification ability by taking advantage of the learning ability from DP operators, which can adjust its neighbourhood structure adaptively. Simulation experiments were carried on four artificial Fibonacci sequences, and the results show that the performance of MSA algorithm is promising.
    International Journal of Computer Applications in Technology 01/2015; 51(3):164. DOI:10.1504/IJCAT.2015.069330
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we examined the significance of position-based routing with bordernode- based forwarding for vehicular ad hoc network (VANET) to optimise path length between vehicles. We have mathematically evaluated the performance of border node-based forwarding method such as Border node-based MFR (B-MFR). B-MFR strongly avoids the interior nodes within the transmission range for further transmitting the packets. Furthermore, we have developed a mathematical model for B-MFR to determine average number of hop counts, expected distance between source and destination, and maximum progress of the next-hop node towards the destination node using Poisson distribution for node deployment. Analytical and simulation results indicate that B-MFR can provide efficient routing in VANETs. In our work, results clearly show that using the border-nodes is an advantage to maximise the performance of routing protocol in terms of average number of hops with minimum delay. We have mathematically simulated the proposed protocol in MATLAB and compared the result with existing routing protocol MFR.
    International Journal of Computer Applications in Technology 01/2015; 51(2). DOI:10.1504/IJCAT.2015.068919
  • [Show abstract] [Hide abstract]
    ABSTRACT: In mobile ad hoc networks (MANET), security attack due to malicious nodes can affect normal operation of routing protocols, performance of transmission control protocol (TCP), and the network at large. This paper has investigated the effects of packet drop attack on the performance of TCP variants and routing protocols. Simulation was conducted by adding different percentage of malicious nodes in the network. Results have shown that from TCP variants, Vegas outperformed Newreno and SACK with 0% malicious nodes. However, as the percentage of malicious nodes added in the network increases from 5% to 50%, Newreno and SACK performed better than Vegas. Moreover, ad hoc on-demand (AODV) is more robust to packet drop attack than dynamic source routing (DSR). Finally, we have proposed TCP-PLDR (Packet Loss Detection and Response technique), which differentiate packet loss due to congestion or malicious packet drop attack. Experimental results have shown that TCP-PLDR performed better than TCP-SACK.
    International Journal of Computer Applications in Technology 01/2015; 51(3):235. DOI:10.1504/IJCAT.2015.069338
  • [Show abstract] [Hide abstract]
    ABSTRACT: An inverse analysis method based on coupled numerical modelling and soft computing has been investigated for estimating the magnitude of horizontal earth stresses based on borehole displacements. The method integrates genetic algorithm (GA), artificial neural network (ANN) and numerical computation. In the displacement-based inverse analysis method, a hybrid ANN-GA model is used to identify horizontal earth stresses. An ANN is used to represent the non-linear relationship between the maximum and minimum horizontal earth stresses (σH, σh) and borehole displacements. GA is used to search the set of unknown horizontal earth stresses based on the objective function. Numerical computation is used to create the necessary training and testing samples for the hybrid ANN-GA model. Results of numerical experiments demonstrate that a hybrid ANN-GA model for displacement-based inverse analysis can effectively identify horizontal earth stresses based on wellbore movements during drilling.
    International Journal of Computer Applications in Technology 01/2015; 52(1):18. DOI:10.1504/IJCAT.2015.071416
  • [Show abstract] [Hide abstract]
    ABSTRACT: Fault hierarchy specifies the inter-relationships amongst various fault classes in terms of their fault detection capability. Kuhn has developed a fault hierarchy for Boolean expression in disjunctive normal form which was complemented by Tsuchiya and Kikuno. Lau and Yu extended the fault hierarchy by adding more fault classes in the hierarchy. In this paper, we give the fault detection criteria for clause disjunction fault (CDF) and associative shift fault (ASF) and further extend the fault hierarchy by adding these fault classes in the fault hierarchy.
    International Journal of Computer Applications in Technology 01/2015; 52(1):29. DOI:10.1504/IJCAT.2015.071417

  • International Journal of Computer Applications in Technology 01/2015; 51(4):283. DOI:10.1504/IJCAT.2015.070491