Automated guided vehicle systems, state-of-the-art control algorithms and techniques

In this paper, a new stemmer has been proposed named as "Maulik" for Hindi Language. This stemmer is purely based on Devanagari script and it uses the Hybrid approach (combination of brute force and suffix removal approach). Stemming can be used to improve the effectiveness of information retrieval. The proposed stemmer is both computationally inexpensive and domain independent. The results are favorable and indicate that the proposed stemmer can be used effectively in Information Retrieval systems. This stemmer also reduces the problem of over-stemming and under-stemming which was found in A Light weight Stemmer for Hindi.

MAULIK: An Effective Stemmer for Hindi Language

Long non-coding RNAs (lncRNAs) are a rapidly expanding field of research, with many new transcripts identified each year. However, only a small subset of lncRNAs has been characterized functionally thus far. To aid investigating the mechanisms of action by which new lncRNAs act, bioinformatic tools and databases are invaluable. Here, we review a selection of computational tools and databases for the in silico analysis of lncRNAs, including tissue-specific expression, protein coding potential, subcellular localization, structural conformation, and interaction partners. The assembled lncRNA toolkit is aimed primarily at experimental researchers as a useful starting point to guide wet-lab experiments, mainly containing multi-functional, user-friendly interfaces. With more and more new lncRNA analysis tools available, it will be essential to provide continuous updates and maintain the availability of key software in the future.

https://www.mdpi.com/2311-553X/6/4/49/pdf

The lncRNA Toolkit: Databases and In Silico Tools for lncRNA Analysis.

Running parallel applications requires special and expensive processing resources to obtain the required results within a reasonable time. Before parallelizing serial applications, some analysis is recommended to be carried out to decide whether it will benefit from parallelization or not. In this paper we discuss the issue of speed up gained from parallelization using Message Passing Interface (MPI) to compromise between the overhead of parallelization cost and the gained parallel speed up. We also propose an experimental method to predict the speed up of MPI applications.

To Parallelize or Not to Parallelize, Speed Up Issue

This study proposes a string searching algorithm as an improvement of the brute-force searching algorithm. The algorithm is named as, Occurrences algorithm. It is based on performing preprocessing for the pattern and for the text before beginning to search for the pattern in the text.

/pdf/occurrences-algorithm-for-string-searching-based-on-brute-4l7ekcfag5.pdf

Occurrences Algorithm for String Searching Based on Brute-force Algorithm

This study, discusses several kinds of attacks that may meet the watermarked image such as JPEG compression, Gaussian noise and median filter. The study introduces an approach capable of selecting the optimal blocks in cover image to be used in embedding process. Also, in this study, we propose a technique in robust digital watermarking system looking for finding a relation between the contrast of cover image and robustness to increase the resistance of previous attacks.

/pdf/an-optimization-approach-for-selecting-blocks-of-embedding-hjy5v67a94.pdf

Ababneh M.F. Mohammad

Papers

Occurrences Algorithm for String Searching Based on Brute-force Algorithm

An Optimization Approach for Selecting Blocks of Embedding Process in Robust Watermarking System