Romanian Journal of Information Science and Technology

Current impact factor: 0.30

Impact Factor Rankings

2016 Impact Factor Available summer 2017
2014 / 2015 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
Year

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: Authorship trends and collaborative research are studied in the North Eastern Hill University (NEHU) based on the data collected from Annual Report and NEHU Institutional Repository published during the year 2000-2010. Outcome of the study shows that multi authored articles 64.93% prevail the single authored articles 35.07%. The degree of collaboration in NEHU is 0.65. Average number of authors per paper varies from 2.29 to 3.44. In 10 years from 2000 to 2010 the average no. of authors per paper is 2.72. . This study is in support for the fact that NEHU faculty members preferred collaborative trends for their research and publication work.
    No preview · Article · Dec 2015 · Romanian Journal of Information Science and Technology
  • [Show abstract] [Hide abstract]
    ABSTRACT: We provide a nominal semantics of the monadic version of the fusion calculus. A set of compact transition rules is presented in the Fraenkel-Mostowski framework by using a specific nominal quantifier. Using several nominal techniques, it is proved the equivalence between the new nominal semantics and the original semantics of the monadic fusion calculus.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [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.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [Show abstract] [Hide abstract]
    ABSTRACT: Spiking neural P systems with astrocytes (SNPA systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes, where also astrocytes are considered, having an excitatory or an inhibitory influence on synapses. Looking for small universal computing devices is a classical research topic in computer science. In this work, we investigate small universal SNPA systems as both devices computing functions and devices generating sets of numbers. Specifically, as devices of computing functions, a universal SNPA system (without delay and forgetting rules) using 57 neurons and 19 astrocytes is obtained; as generators of sets of numbers, a universal SNPA system (without delay and forgetting rules) using 54 neurons and 17 astrocytes is found. These improve previous results on SN P systems without astrocytes and show the role of these features.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we are molding the phase profile of a Gaussian beam in order to achieve a phase singularity called optical vortex. For this purpose, we apply the beam shaping technique for a 635 nm wavelength radiation using a diffractive optical element with high diffractive efficiency. We use reflective spiral phase plates and fork-like computer generated holograms, fabricated with photolithographic processes and electron beam lithography, respectively. Uniform ring intensity is achieved in the optical vortex configurations and also zero intensity where the phase is undefined. Phase singularities interferences are done using a Michelson interferometer. Beam shaping simulations results based on the Kirchhoff integral are in concordance with experimental results.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [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].
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [Show abstract] [Hide abstract]
    ABSTRACT: This work presents a study of a new binary coded firefly algorithm. The firefly algorithm is a novel nature-inspired metaheuristic, inspired by the social behavior of fireflies, which is being applied to solve many optimization problems. We test the proposed binary coded firefly algorithm solving the non-unicost set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary coded firefly algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [Show abstract] [Hide abstract]
    ABSTRACT: Region growing-based color image segmentation approaches suffer from expensive computation cost. In order to overcome this issue, a novel region-based color image segmentation method based on P systems is proposed in this paper. A tissue-like P system is designed in such a way that an adaptive selection of target regions is achieved. The proposed method is evaluated on several real-life color images.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [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.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology
  • [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.
    No preview · Article · Jan 2014 · Romanian Journal of Information Science and Technology