Publications of Journal, Conference, Seminars etc.

Browse

Filters

2012 - 20155

Settings

Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    Item
    Good spanning trees in graph drawing
    (Elsevier Science Publishers Ltd. Essex, UK, 2015-11-15) Md. Iqbal, Hossain; Md. Saidur, Rahman
    Introduces a good spanning tree of a plane graph.Solves two open problems on monotone drawings using good spanning trees.Finds a 2-visibility drawing of a planar graph using a good spanning tree.Gives algorithms to find an spike-VPG and T-shaped drawings of a planar graph. A plane graph is a planar graph with a fixed planar embedding. In this paper we define a special spanning tree of a plane graph which we call a good spanning tree. Not every plane graph has a good spanning tree. We show that every connected planar graph has a planar embedding with a good spanning tree. Using a good spanning tree, we show that every connected planar graph G of n vertices has a straight-line monotone grid drawing on an O ( n ) × O ( n 2 ) grid, and such a drawing can be found in O ( n ) time. Our results solve two open problems on monotone drawings of planar graphs posed by Angelini et al. Using good spanning trees, we also give simple linear-time algorithms for finding a 2-visibility representation of a connected planar graph G of n vertices on a ( 2 n - 1 ) × ( 2 n - 1 ) grid and for finding a spike-VPG representation of G on a ( 2 n - 1 ) × n grid.
  • Thumbnail Image
    Item
    SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching.
    (Hindawi Publishing Corporation, 2015-03-21) Azim, Md. Aashikur Rahman; Iliopoulos, Costas S.; Rahman, M. Sohel; Samiruzzaman, M.
    This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting problem in many biological contexts. CPM consists in finding all occurrences of the rotations of a patternPof length𝑚in a textTof length𝑛. In this paper, we present SimpLiFiCPM (pronounced “Simplify CPM”), a simple and lightweight filter-based algorithm to solve the problem. We compare our algorithm with the state-of-the-art algorithms and the results are found to be excellent. Much of the speed of our algorithm comes from the fact that our filters are effective but extremely simple and lightweight.
  • Thumbnail Image
    Item
    Assurance of the Maximum Destruction in Battlefield using Cost-Effective Approximation Techniques
    (Journal of Networks, Academy Publisher, 2012) Jaigirdar, Fariha Tasmin; Islam, Mohammad Mahfuzul
    Military Applications of Wireless Sensor Network in domains of maximizing security and gaining maximum benefits while attacking the opponent is a challenging and prominent area of research now-a-days. A commander’s goal in a battle field is not limited by securing his troops and the country but also to deliver proper commands to assault the enemies using the minimum number of resources. In this paper, we propose two efficient and low cost approximation algorithms—the maximum clique analysis and the maximum degree analysis techniques. Both of the techniques find the strategies of maximizing the destruction in a battlefield to defeat the opponent by utilizing limited resources. Experimental results show the effectiveness of the proposed algorithms in the prescribed areas of applications. Gaining the cost-effectiveness of the algorithms are also major concerns of this research. A comparative study explaining the number of resources required for commencing required level of destruction made to the opponents has been provided in this paper. The studies show that the maximum degree analysis technique is able to perform more destruction than the maximum clique analysis technique using same number of resources and requires relatively less computational complexity as well.
  • Thumbnail Image
    Item
    Deterministic cluster head selection for wireless sensor networks
    (IEEE, 2012) Azim, Akramul; Islam, Mohammad Mahfuzul
    The applications and adoption of wireless sensor networks (WSNs) in social and environmental purposes are increasing because of monitoring different infrastructures such as military, scientific, environmental, and domestic infrastructures. Low energy adaptive clustering hierarchy (LEACH) and its variants use some intermediate nodes, known as cluster heads, for relaying the communications made between the sensor nodes and the base station. These schemes, however, lack of a deterministic cluster head selection technique to form a certain number of required clusters. In this paper, we propose a deterministic cluster head selection technique to select expected number of clusters. Simulations justify the mathematical modeling of such a cluster head selection scheme which can be applied directly in realistic systems.
  • Thumbnail Image
    Item
    Biometric Based: 3-D Ear Recognition System Combining Local and Holistic Features
    (International Journal of Modern Education and Computer Science (IJMECS), Modern Education and Computer Science (MECS) Press, 2013) Ali, Md. Akkas; Islam, Mohammad Mahfuzul
    This paper introduces an improved ear recognition approach based on 3 dimensional keypoint matching and combining local and holistic features. At first, the 3D keypoints are detected using the shape index image. The system consists of four primary steps: i) ear image segmentation; ii) local feature extraction and matching; iii) holistic feature extraction and matching; and iv) combination of local and holistic features at the match score level. For the segmentation purpose, we use an efficient skin segmentation algorithm, to localize a rectangular region containing the ear. For the local feature extraction and representation purpose, we use the Sparse Representation based Localized Feature Extraction. For the holistic matching component, we introduce a voxelization scheme for holistic ear representation. The match scores obtained from both the local and holistic matching components are combined to generate the final match scores.