Abstract Sorting is one of the major research topics. It is defined as the process of rearranging a sequence of values. Generally, many applications require implementation of sorting algorithm that can be evaluated according to different criteria related to time complexity. In this paper, we present a new reconfigurable algorithm for sorting binary numbers; based on iterative approach; where the data elements are represented... Sorting is one of the major research topics. It is defined as the process of rearranging a sequence of values. Generally, many applications require implementation of sorting algorithm that can be evaluated according to different criteria related to time complexity. In this paper, we present a new reconfigurable algorithm for sorting binary numbers; based on iterative approach; where the data elements are represented in a binary manner. Our system is based on a systematic mathematical calculation, updated iteratively. The proposed approach offers a useful tradeoff between rapidity of the algorithm and the memory resources. A simulation program has been developed in C++ in order to validate the proposed approach. The complexity of our algorithm according to the number of iterations is O (n) in the worst case. However, the complexity reaches O (log_2 (n)) in the best case. Read More Read Less

Abstract Database systems and temporal extension is core part of the data and information system processing. However, temporal paradigm has never been standardized. Object level temporal approach is based on extension of the primary key, whereas our approach uses column granularity, thanks to that, sensorial data with various granularity and frequency of changes can be effectively managed and accessed. Moreover, significant performance parameter is... Database systems and temporal extension is core part of the data and information system processing. However, temporal paradigm has never been standardized. Object level temporal approach is based on extension of the primary key, whereas our approach uses column granularity, thanks to that, sensorial data with various granularity and frequency of changes can be effectively managed and accessed. Moreover, significant performance parameter is just index structure and mostly used B+tree. Such developed index cannot manage and deal with NULL values, therefore in this paper, we propose effective solution for storing undefined attribute values as well as time attributes delimiting validity. Read More Read Less

Abstract Machine Translation is a highly demanding research field in natural language processing. The goal is to investigate a model which can automatically translate a document from one language to another. The mainstream approach for that is the Phrase-based Machine Translation (PBMT). In [9], a innovative method based on distributed representations was proposed to automate the process of generating dictionaries and phrase tables of... Machine Translation is a highly demanding research field in natural language processing. The goal is to investigate a model which can automatically translate a document from one language to another. The mainstream approach for that is the Phrase-based Machine Translation (PBMT). In [9], a innovative method based on distributed representations was proposed to automate the process of generating dictionaries and phrase tables of PBMT-based solutions, that primarily rely on raw counts. In this paper, as in the Mikolov’s, we have used distributed representations of words to perform automatic machine translation between languages but, unlike it, we have included the Portuguese language in the analysis which, actually, is the primary goal of our work. We have properly evaluated the performance in regards to Precision metrics. Results shows a precision of up to 89% if we consider translation between the Portuguese and the English. Read More Read Less