International Journal of Applied Mathematics and Computer Science (INT J AP MAT COM-POL)

Publisher: Uniwersytet Zielonogórski; Lubuskie Towarzystwo Naukowe

Journal description

The International Journal of Applied Mathematics and Computer Science is a quarterly published jointly by the University of Zielona óra and the Lubuskie Scientific Society in Zielona óra, Poland, since 1991. The Journal strives to meet the demand for the presentation of interdisciplinary research concerned with applications of mathematical methods to computer science and engineering. It publishes high quality original research results in the following areas: mathematical methods in computer science and engineering; modern control theory and applications; artificial intelligence techniques; applied mathematics and mathematical optimization techniques.

Current impact factor: 1.23

Impact Factor Rankings

2016 Impact Factor Available summer 2017
2014 / 2015 Impact Factor 1.227
2013 Impact Factor 1.39
2012 Impact Factor 1.008
2011 Impact Factor 0.487
2010 Impact Factor 0.794
2009 Impact Factor 0.684

Impact factor over time

Impact factor

Additional details

5-year impact 1.28
Cited half-life 5.60
Immediacy index 0.15
Eigenfactor 0.00
Article influence 0.27
Website International Journal of Applied Mathematics and Computer Science (AMCS) website
Other titles International journal of applied mathematics and computer science (Online)
ISSN 1641-876X
OCLC 54678624
Material type Document, Periodical, Internet resource
Document type Internet Resource, Computer File, Journal / Magazine / Newspaper

Publications in this journal

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.
    Full-text · Article · Dec 2015 · International Journal of Applied Mathematics and Computer Science
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Over a century of research resulted in a set of more than a hundred binary association measures. Many of them share similar properties. An overview of binary association measures is presented, focused on their order equivalences. Association measures are grouped according to their relations. Transformations between these measures are shown, both formally and visually. A generalization coefficient is proposed, based on joint probability and marginal probabilities. Association measure combination is one of recent trends in computer science. Measures are combined in linear and non-linear discrimination models, automated feature selection or construction. Knowledge about their relations is particularly important to avoid problems of meaningless results, zeroed generalized variances, curse of dimensionality or simply to save time.
    Full-text · Article · Aug 2015 · International Journal of Applied Mathematics and Computer Science

  • No preview · Article · Jun 2015 · International Journal of Applied Mathematics and Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider a nonparametric Shewhart chart for fuzzy data. We utilize the fuzzy data without transforming them into a real-valued scalar (a representative value). Usually fuzzy data (described by fuzzy random variables) do not have a distributional model available, and also the size of the fuzzy sample data is small. Based on the bootstrap methodology, we design a nonparametric Shewhart control chart in the space of fuzzy random variables equipped with some L2 metric, in which a novel approach for generating the control limits is proposed. The control limits are determined by the necessity index of strict dominance combined with the bootstrap quantile of the test statistic. An in-control bootstrap ARL of the proposed chart is also considered.
    No preview · Article · Jun 2015 · International Journal of Applied Mathematics and Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: The paper deals with cost effective compensator placement and sizing. It becomes one of the most important problems in contemporary electrical networks, in which voltage and current waveform distortions increase year-by-year reaching or even exceeding limit values. The suppression of distortions could be carried out by means of three types of compensators, i.e., passive filters, active power filters and hybrid filters. So far, passive filters have been more popular mainly because of economic reasons, but active and hybrid filters have some advantages which should cause their wider application in the near future. Active power filter placement and sizing could be regarded as an optimization problem. A few objective functions have been proposed for this problem. In this paper we compare solutions obtained by means of combinatorial and genetic approaches. The theoretical discussion is followed by examples of active power filter placement and sizing. Full text:
    No preview · Article · Jun 2015 · International Journal of Applied Mathematics and Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we present the extraproximal method for computing the Stackelberg/Nash equilibria in a class of ergodic controlled finite Markov chains games. We exemplify the original game formulation in terms of coupled nonlinear programming problems implementing the Lagrange principle. In addition, Tikhonov's regularization method is employed to ensure the convergence of the cost-functions to a Stackelberg/Nash equilibrium point. Then, we transform the problem into a system of equations in the proximal format. We present a two-step iterated procedure for solving the extraproximal method: (a) the first step (the extra-proximal step) consists of a "prediction" which calculates the preliminary position approximation to the equilibrium point, and (b) the second step is designed to find a "basic adjustment" of the previous prediction. The procedure is called the "extraproximal method" because of the use of an extrapolation. Each equation in this system is an optimization problem for which the necessary and efficient condition for a minimum is solved using a quadratic programming method. This solution approach provides a drastically quicker rate of convergence to the equilibrium point. We present the analysis of the convergence as well the rate of convergence of the method, which is one of the main results of this paper. Additionally, the extraproximal method is developed in terms of Markov chains for Stackelberg games. Our goal is to analyze completely a three-player Stackelberg game consisting of a leader and two followers. We provide all the details needed to implement the extraproximal method in an efficient and numerically stable way. For instance, a numerical technique is presented for computing the first step parameter (λ) of the extraproximal method. The usefulness of the approach is successfully demonstrated by a numerical example related to a pricing oligopoly model for airlines companies.
    No preview · Article · Jun 2015 · International Journal of Applied Mathematics and Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of the crossed cube (ITCC) is presented. The ITCC is to find a maximal independent set (MIS), which is based on building an induced tree of the crossed cube network, and then to connect the MIS nodes to form a CDS. The priority of an induced tree is determined according to a new parameter, the degree of the node in the square of a graph. This paper presents the proof that the ITCC generates a CDS with a lower approximation ratio. Furthermore, it is proved that the cardinality of the induced trees is a Fibonacci sequence, and an upper bound to the number of the dominating set is established. The simulations show that the algorithm provides the smallest CDS size compared with some other traditional algorithms.
    No preview · Article · Jun 2015 · International Journal of Applied Mathematics and Computer Science