Romanian Journal of Information Science and Technology Impact Factor & Information

Current impact factor: 0.30

Impact Factor Rankings

2015 Impact Factor Available summer 2016
2014 Impact Factor 0.304
2013 Impact Factor 0.453
2012 Impact Factor 0.283
2011 Impact Factor 0.154
2010 Impact Factor 0.188

Impact factor over time

Impact factor

Additional details

5-year impact 0.32
Cited half-life 6.70
Immediacy index 0.00
Eigenfactor 0.00
Article influence 0.10
ISSN 1453-8245

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: In 2-dimensional bin packing problem each item is a rectangle of side lengths not greater than 1. The items are packed online into square bins of size 1 x 1 and 90 degrees-rotations are allowed. In t-space bounded model of online bin packing each item can be packed only into one of t active bins. If it is impossible to pack an item into any active bin, we close one of the current active bins and open a new active bin to pack that item. In this paper a 3.577-competitive 3-space bounded online packing algorithm is presented. Furthermore, an online algorithm for packing squares with the competitive ratio 2.8 is described.
    Romanian Journal of Information Science and Technology 01/2014; 17(2):190-203.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The harmonic index H(G) of a graph G is defined as the sum of weights 2/d(u) + d(v) of all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this paper, we first present a sharp lower bound on the harmonic index of unicyclic conjugated graphs (unicyclic graphs with a perfect matching). Also a sharp lower bound on the harmonic index of unicyclic graphs is given in terms of the order and given size of matching.
    Romanian Journal of Information Science and Technology 01/2014; 17(3):230-236.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Spiking neural P systems (shortly called SN P systems) are a class of distributed and parallel neural-like computing devices, which are inspired by the way of biological neurons communicating with each other by means of impulses/spikes. SN P systems with cooperating rules are a new variant of SN P systems, where each neuron has the same number of components and some components of a neuron can be empty. In a step of a computation, one component from each neuron is used, with the same label in all neurons; from these components, one rule is applied, in the way usual in SN P systems. In the terminating mode, adopted in this paper, after choosing a component of the neurons, this component is applied until no rule from this component, in any neuron, is enabled (we switch from a component to another one, nondeterministically chosen, when no rule of the component can be used, in any neuron of the system). In this work, we investigate how many neurons are needed to construct a Turing universal SN P system with cooperating rules as a number generator in terminating mode. Specifically, we construct a Turing universal SN P system having 8 neurons, which can generate/compute any set of Turing computable natural numbers. This result gives an answer to an open problem formulated in [V.P. Metta, S. Raghuraman, K. Krithivasan, CMC15, 267-282, 2014].
    Romanian Journal of Information Science and Technology 01/2014; 17(2):177-189.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The Map Reduce architecture and the associated programming model defined for the one-chip Connex organization gets an important additional feature: the associated data vectors can be organized as a two-dimension arrays of vertical and horizontal vectors which are managed by the transpose operation in order to maximize the degree of parallel execution. Thus, a one-chip Map-Reduce engine is able to perform easy additional intra vector operations by transforming the horizontal vectors, involved in Map operations, in vertical vectors using the transpose operation. We propose the Transpose-Map Reduce high-level architecture supported by a fine grain cellular structure the Connex system already implemented in silicon. It is structured in three sub-architectures: the data processing, data transfer and inter-cell communication architectures. A simulator written in SCHEME is used to write and evaluate few meaningful algorithms: AES encryption, FFT, Batcher's merge-sort.
    Romanian Journal of Information Science and Technology 01/2014; 17(2):150-176.
  • [Show abstract] [Hide abstract]
    ABSTRACT: One considers a finite set X (the alphabet), the code space X∞ of all sequences formed with elements (letters) from the alphabet X and B the Borel sets of X∞. A concrete representation of all Sugeno measures on B is given. This representation is, heuristically speaking, matricial, being inspired by the concrete representation of all probabilities on B.
    Romanian Journal of Information Science and Technology 01/2014; 17(3):289-301.
  • [Show abstract] [Hide abstract]
    ABSTRACT: A Constraint Satisfaction Problem (CSP) consists in a sequence of variables holding a domain of possible values and relations among these variables called constraints. A meta-CSP can be seen as a metaproblem whose decomposition leads to a set of CSPs. The meta-variables correspond to sub-problems of the original problem, and a meta-constraint is a relation among those meta-variables. Meta-CSPs find many applications in industry, usually in processes that involve time and actions such as the control of a robot, a manufacturing process, or the scheduling of any common activity. In this paper, we introduce the notion of Sequentially Dependent Meta-CSP (SD Meta-CSP), which extends the meta-CSP in order to support applications where a dependency between sub-problems is mandatory. In this case, the meta-CSP is decomposed into a set of sub-problems {P-i, Pi+1,..., P-n}, but the instance of the sub-problem Pi+1 sequentially depends on the solution of the sub-problem P-i. In this work we provide a formal definition for the SD Meta-CSPs, a framework to handle it, and we illustrate its applicability to video games. In particular, we model and implement agents as SD Meta-CSPs able to autonomously play two classic games: Ms. Pac-Man and Super Mario Bros.
    Romanian Journal of Information Science and Technology 01/2014; 17(2):204-216.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The performance of a speaker recognition systems based on Gaussian mixture models is often impaired both by the low quality and by short duration of test speech samples. A best material selection criterion is described in this paper, especially suitable for forensic automatic speaker recognition systems, where even enrollment speech quality might be important in some cases. The material selection is performed by checking well known short-time measures of input speech that carry quality information, such as linear cepstral peak, spectral autocorrelation peak to valley ratio, and windowed autocorrelation lag energy. Our tests show that the proposed approach outperforms reported speaker recognition solutions that consider quality of the input speech, at least in co-channel speech conditions.
    Romanian Journal of Information Science and Technology 01/2014; 17(2):134-149.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we provide a new way for constructing and storing the convex polygon triangulations. The main motivation for the presented method is derived from two combinatorial problems: ballot problem and problem of lattice path. The method is derived upon the so-called movement through polygon. The movement is defined on ballot records and validity of the lattice path through the grid. We give two algorithms: Triangulation to ballot and Ballot to triangulation. Also, we give a method to make coding for a ballot record or the corresponding triangulation even more compact using a stack. All mentioned algorithms are implemented in the Java programming language.
    Romanian Journal of Information Science and Technology 01/2014; 17(3):237-251.