By Topic

Computing and Communication Systems (NCCCS), 2012 National Conference on

Date 21-22 Nov. 2012

Filter Results

Displaying Results 1 - 25 of 74
  • About the institution [Dr. B.C. Roy Engineering College, Durgapur (BCREC)]

    Publication Year: 2012 , Page(s): ii
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (684 KB)  

    A brief overview and history of Dr. B.C. Roy Engineering College, Durgapur (BCREC). BCREC was set up on 21st August, 2000, under the overall management of Dr. B.C. Roy Engineering College Society. Born of a vision of a group of Durgapur based philanthropic entrepreneurs, the institute is dedicated to the memory of Dr. Bidhan Chandra Roy, the architect of modern West Bengal and BCREC management is deeply committed to gradually build the college as one of the best seats of Engineering and Management Education in Eastern India with domestic and global requirements in view. Dr. B.C. Roy Engineering College, Durgapur was affiliated to the University of Burdwan for the students admitted in 2000-01 session. But from 2001-2002 Session onwards the college was affi Iiated to the West Bengal University of Technology (WBUT). The college is approved by All India Council for Technical Education (AICTE), Directorate of Technical Education (DTE) and Department of Higher Education, Govt. of West Bengal. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authors' index

    Publication Year: 2012 , Page(s): 1 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (77 KB)  
    Freely Available from IEEE
  • Conference committees

    Publication Year: 2012 , Page(s): iii - vii
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (94 KB)  
    Freely Available from IEEE
  • Cuckoo search for business optimization applications

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (707 KB) |  | HTML iconHTML  

    Cuckoo search has become a popular and powerful metaheuristic algorithm for global optimization. In business optimization and applications, many studies have focused on support vector machine and neural networks. In this paper, we use cuckoo search to carry out optimization tasks and compare the performance of cuckoo search with support vector machine. By testing benchmarks such as project scheduling and bankruptcy predictions, we conclude that cuckoo search can perform better than support vector machine. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified circuit design technique for feedthrough logic

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (836 KB) |  | HTML iconHTML  

    In this paper a circuit design technique to reduce dynamic power consumption of a new CMOS domino logic family called feedthrogh logic is presented. The need for low power circuit with high speed has made it common practice to use feedthrough logic. The proposed modified circuit has very low dynamic power consumption compared to recently proposed circuit techniques for feedthrough logic styles. The proposed circuit is simulated using 0.18 μm, 1.8 V CMOS process technology. Intensive simulation results in cadence environment shows that the proposed modified circuit reduces the dynamic power consumption approximately 24% along with a significant reduction in power delay product, as compared to existing feedthrough logic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In silico prediction of MicroRNA's from chromosome no, 1 & 2 of Plasmodium vivax

    Publication Year: 2012 , Page(s): 1 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (878 KB) |  | HTML iconHTML  

    MicroRNAs (MiRNA's) are ~22nt long; one of the types of non-coding RNA having an important role in the control of the gene regulation, either by termination of the translation procedure or sometimes activating the gene actively or passively. Host-Parasite relationship largely depends on the gene regulatory network as the parasite has to survive in the host cell against the immune response of the host. So miRNA may have an important role in the host parasite relationship. The malarial parasite needs to survive in the human host cell during its life cycle. As it is well known to us today that the gene regulatory network is largely controlled by the non coding miRNA, here we are interested to find out potential miRNA in the parasite genome computationally. We have identified few putative miRNA genes in the chromosome 1 & 2 of Plasmodium vivax which need to be validated by experimental procedures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel pre-processing technique for web log mining by removing global noise and web robots

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (682 KB) |  | HTML iconHTML  

    Today internet has made the life of human dependent on it. Almost everything and anything can be searched on net. Web pages usually contain huge amount of information that may not interest the user, as it may not be the part of the main content of the web page. Web Usage Mining (WUM) is one of the main applications of data mining, artificial intelligence and so on to the web data and forecast the user's visiting behaviors and obtains their interests by investigating the samples. Since WUM directly involves in applications, such as, e-commerce, e-learning, Web analytics, information retrieval etc. Weblog data is one of the major sources which contain all the information regarding the users visited links, browsing patterns, time spent on a particular page or link and this information can be used in several applications like adaptive web sites, modified services, customer summary, pre-fetching, generate attractive web sites etc. There are varieties of problems related with the existing web usage mining approaches. Existing web usage mining algorithms suffer from difficulty of practical applicability. This paper continues the line of research on Web access log analysis is to analyze the patterns of web site usage and the features of users behavior. It is the fact that the normal Log data is very noisy and unclear and it is vital to preprocess the log data for efficient web usage mining process. Preprocessing is the process comprises of three phases which includes data cleaning, user identification, and pattern discovery and pattern analysis. Log data is characteristically noisy and unclear, so preprocessing is an essential process for effective mining process. In this paper, a novel pre-processing technique is proposed by removing local and global noise and web robots. Preprocessing is an important step since the Web architecture is very complex in nature and 80% of the mining process is done at this phase. Anonymous Microsoft Web Dataset and MSNBC.com Anonymous Web D- taset are used for evaluating the proposed preprocessing technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power-aware traffic grooming in WDM optical mesh networks for bandwidth wastage minimization: A genetic algorithm-based approach

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (697 KB) |  | HTML iconHTML  

    The cost of optical backbone network has increased nowadays. So we need to reduce this cost. One of the major contributory costs is the power consumed by the underlying network. Power may also be consumed by different network equipments viz. add-drop multiplexers (ADM), Network Interface Device (NID), Optical Network Terminal (ONT), electrical-to-optical-to-electrical (EOE) conversion etc. In this article we have only considered the power consumption by EOE conversion in a mesh network. We have proposed a genetic algorithm to minimize the EOE conversions needed for a mesh network to satisfy all the traffic requests for a given physical topology. We have also considered the amount of wavelength wastages for our solution and we have minimized these wastages below a user given value. The results have been demonstrated on two optical mesh networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of band nonparabolicity and material composition on intersubband transition energies of a heterostructure quantum ring for optical transmitter

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (783 KB) |  | HTML iconHTML  

    Intersubband transition energies of a semiconductor heterostructure quantum ring with cylindrical geometry are computed considering three lowest eigenstates. Band nonparabolicity is considered to observe the change in transition energy compared with parabolic band, as well as material composition of the heterostructure is varied taking AlxGa1-xAs as an example. Electric field is applied along the axis of the structure. Time-independent Schrödinger equation is solved with appropriate boundary conditions, and first and second order Bessel functions are considered for computation of energy subbands. Quantized electron energy states have been observed by changing different dimensions of the ring structure. Precise tailoring of dimension and material composition for helps to obtain required emission and absorption spectra, making it a potential candidate for novel photonic applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of object oriented approach to query processing for video subsequence identification

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (767 KB) |  | HTML iconHTML  

    To manipulate a large video database, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame wise user query or video content query, whereas few video-sequence matching algorithms have been investigated. In this paper, we propose an efficient algorithm for video sequence matching using the modified Hausdorff distance and the directed divergence of histograms between successive frames. To effectively match the video sequences with a low computational load, we use the key frames extracted by the cumulative directed divergence and compare the set of key frames using the modified Hausdorff distance. Experimental results with color video sequences show that the proposed algorithms for video sequence matching yield better performance than conventional algorithms such as histogram difference, histogram intersection, and chi-square test methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fingerprint pores extractor

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1230 KB) |  | HTML iconHTML  

    Automatic Fingerprint Recognition Systems (AFRSs) rely on minutiae position and orientation within the fingerprint image for matching. Minutiae information is highly accurate provided that the fingerprint image matched is of high quality. However, this is not always the case because of diseases and hash working conditions that affect fingerprints. In order to maintain high level of security independent of varying fingerprint image quality research suggests the use of other fingerprint features to compliment minutiae. These are things like ridge contours, sweat pores, dots, and incipient ridges. Sweat pores have been proven as one of the most distinctive among these feature. Thus in order to improve accuracy of AFRSs pores can be fused with minutiae or used alone. Sweat pores have been less utilized in the past due to constraints imposed by fingerprint scanning devices and resolution standards. Recently, progress has been made on both scanning devices and resolution standards to support the use of pores in AFRSs. However, very few techniques exist for extracting, matching and fusing them with minutiae. Matching and fusion can only be possible if pores are available. Some techniques have been proposed to reliable extract pores. However, existing techniques can only work on one resolution i.e. an algorithm proposed and tested on 500dpi cannot work on 1000dpi without minor modifications because pores size change if resolution changes. In addition, existing pore extraction techniques are computationally expensive. In this paper an algorithm to extract feature level 3 (pores) is proposed. The algorithm uses Laplacian of Gaussian (LoG) in Fourier domain in order to reduce computation. The performance of the proposed algorithm is tested on two distinct databases with different resolutions in order to validate its accuracy. The accuracy of the proposed algorithm is further measured using false detection rate (FDR) and true detection rate (TDR). Results show that FDR ranges - rom 10-35% while TDR ranges from 65-90%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Domain classification using B+trees in fractal image compression

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (782 KB) |  | HTML iconHTML  

    The computational complexity of fractal image compression is mainly because of the huge number of comparisons required to find a matching domain block corresponding to the range blocks within the image. Various schemes have been presented by researchers for domain classification which can lead to significant reduction in the time spent for range-domain matching. All the schemes propose to first separate domains into different classes and then select the appropriate class for matching with selected range block. Here, we propose a dynamic classification scheme based on local fractal dimensions. The method can be experimented with other features of image blocks measured locally. In this work we have investigated the computational efficiency of multi-way search trees for storing domain information. The domains can be listed in a B+ tree ordered on one or more selected local features of each domain. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy matching scheme on fourier descriptors for retrieval of 2 dimensional shapes

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (938 KB) |  | HTML iconHTML  

    Shape is one of the most important features in Content Based Image Retrieval (CBIR). When a shape is used as feature, edge detection might be the first step of feature extraction. Invariance to the different transformations like translation, rotation, and scale is required by a good shape representation. In the literature, a large number of shape representations and retrieval methods can be found. In this paper a novel method of shape based retrieval is presented which uses of the modulus and amplitude part of Fourier transform to extract features and to derive the similarity measure. A multi-interval valued type data is used for shape feature representation. Several experiments are conducted on different categories of test images to show the effectiveness of the proposed method. From the results of the experiment, it is clear that the proposed method gives superior precision and recall values compared to a popular work in this field and is invariant to different transformations mentioned above. Also the algorithm proposed in this paper is efficient with respect to computational time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advantage of carbon nannotube field effect transistor (CNTFET) over double-gate MOSFET in nanometre regime

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (791 KB) |  | HTML iconHTML  

    Carbon nanotube based FET devices are getting more and more importance today because of their high channel mobility and improved gate capacitance versus voltage characteristics. In this paper we compare and analyse the effect of gate capacitance on varying oxide thickness for double gate MOSFET and CNTFET. It is seen that in nanometre regime quantum capacitance plays the major role in deciding the gate capacitance of a CNTFET and we find a favourable characteristics of decreasing gate capacitance with the decrease in the oxide thickness which is not possible to get in double gate MOSFET. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of a bandwidth optimized wideband-integrator on FPGA

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1121 KB) |  | HTML iconHTML  

    Analysis of digital design and implementation of Nam Quoc Ngo's 32 bit integrator is being presented in this paper. The design objective is to realize a wider bandwidth integrator. Proposed design is optimized using conditional sum adder for addition, Radix 4 Booth with Wallace tree carry save adder algorithm for multiplication and a modified algorithm to calculate 2s complement of a binary number. The time complexity of proposed design is compared with hardware design generated by Matlab Xilinx system generator and design by default hardware of DSP48 slices on virtex-5. Proposed design is having larger bandwidth compared to the design by system generator and DSP48 slice based design. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph semantic based semi structured data management for insurance industry: A case study

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1014 KB) |  | HTML iconHTML  

    This paper has proposed a case study of insurance industry through implementing the Graph - semantic based conceptual model for semi-structured database system, called GOOSSDM. The GOOSSDM reveals a set of concepts to the conceptual level design phase of semi-structured database system, which are understandable to the users, independent of implementation issues and provide a set of graphical constructs to facilitate the designers of such system. A rule based transformation mechanism of GOOSSDM schema into the equivalent XML Schema Definition (XSD) also has been applied in this paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probability based playlist generation based on music similarity and user customization

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1059 KB) |  | HTML iconHTML  

    Playlist generation may be defined as the generation of a list of music items or songs based on a preexisting set of songs. A common approach would be to suggest a number of songs based on the currently playing song. An exhaustive algorithm, based on similarity calculation between two songs, would involve computation of similarity of musical attributes of all of the songs with respect of the reference song. This paper introduces a methodology focused towards decreasing the computational complexity of such an algorithm. The suggested algorithm uses a probability based model inspired by Ant Colony Optimization (ACO) to select only a small number of candidate songs for the playlist, instead of the entire database. The calculation of similarity and probability values is modified based on user feedback. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User customized playlist generation based on music similarity

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1057 KB) |  | HTML iconHTML  

    Playlist generation may be defined as the generation of a list of musical items or songs based on a pre-existing set of songs selected by the user. A common approach would be to suggest a number of songs based on the currently playing song. An exhaustive algorithm would involve computation of similarity of musical attributes of all of the songs with respect of the reference song. This paper introduces a methodology focused towards decreasing the computational complexity of such an algorithm. The suggested algorithm uses a distance function derived from a measure of similarity. This metric is cumulative and thus replaces complex calculations with operations involving only addition. Values of similarity are modified based on user feedback. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Products of Mealy-type rough finite state machines

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (846 KB) |  | HTML iconHTML  

    The aim of this paper is to introduce several kinds of products of Mealy-type rough finite state machines (a rough finite-state machine with output). We establish the relationship among such products through coverings and investigate some algebraic properties of these products. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Confusion and diffusion of grayscale images using multiple chaotic maps

    Publication Year: 2012 , Page(s): 1 - 5
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1177 KB) |  | HTML iconHTML  

    In present age chaos based cryptosystem has gained attention in research of information security and number of chaos based image encryption algorithms has been proposed. In this paper, a new symmetric image encryption algorithm based on multiple chaotic maps is proposed. In the proposed algorithm, the plain image is first scrambled using generalized Arnold Cat Map. Further, the scrambled image at a particular iteration is encrypted using chaotic sequences generated by one-dimensional Logistic Map after preprocessing them to integers. The experimental results depicts that the proposed algorithm can successfully encrypt and decrypt grayscale images with secret keys. The simulation analysis also exhibit that the proposed method is loss-less, secure and efficient measured in terms of statistical tests, key sensitivity test and some well known tests like NPCR, UACI and entropy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless Sensor Network application for water quality monitoring in India

    Publication Year: 2012 , Page(s): 1 - 5
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (667 KB) |  | HTML iconHTML  

    Polluted water became a very serious issue for civilization from last few decades. Scarce access to potable water due to acceleration in urbanization, industrialization along-with crowded population, untreated sewage disposal and industrial effluents leads to various life threatening diseases especially in case of infants and women. To control level of contamination water surveillance becomes important. Manual water quality surveillance methods in India dramatically exacerbate water quality deterioration. Considering monitoring essence, we need a continuous, real-time, in-situ monitoring system for water quality management. Wireless Sensor Network (WSN) fascinated us for pro-active water quality management due to their real-time, continuous and dynamic nature, to act as early warning system so that WSN can trigger appropriate alarm in hazardous situations. Despite years of research and their extreme capabilities, application of WSN in environmental monitoring remains limited. In this paper, our aim is to discuss requirement and suitability of WSN for water quality surveillance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parametric estimation of handoff

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1067 KB) |  | HTML iconHTML  

    The efficiency of wireless technology depends upon the seamless connectivity to the user at anywhere any time. Heterogeneous wireless networks are an integration of different networks with diversified technologies. The most essential requirement for Seamless vertical handover is that the received signal strength should always be healthy. Mobile device enabled with multiple wireless technologies makes it possible to maintain seamless connectivity in highly dynamic environment. Since the available bandwidth is limited and the number of users is growing rapidly, it's a real challenge to maintain the received signal strength in a healthy stage. In this work, the proposed, cost-effective parametric estimation for vertical handover shows that the received signal strength maintains a healthy level by considering the novel concept. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FPGA based implementation of MPPT of solar cell

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (806 KB) |  | HTML iconHTML  

    In P-V (Power-Voltage) curve of a solar panel, there is an optimum operating point such that the PV delivers the maximum possible power to the load. The optimum operating point changes with the solar irradiation, and cell temperature. Therefore, on line tracking of the maximum power point of a PV array is an essential part of any successful PV system. A variety of maximum power point tracking (MPPT) methods is developed. The methods vary in implementation complexity, sensed parameters, and required number of sensors, convergence speed, and cost. This paper presents FPGA based implementation of a simple MPPT algorithm (Perturb-and-observe method) in such a way that does not require special measurements of open circuit voltage or short circuit current. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved mobility management technique for IEEE 802.11 based WLAN by predicting the direction of the mobile node

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (789 KB) |  | HTML iconHTML  

    In wireless local area network (WLAN), mobility management becomes a sophisticated issue of research due to the limited coverage of the Access Points (AP). For the successful communication between the mobile nodes (MN), every node should be connected with an access point (AP) during their operating mode, irrespective of their mobility. When a MN travels into the coverage area of its current AP, no special technique is required to maintain the connectivity. But when a MN travels out of the coverage area of its current AP and tries to associate with another AP, a delay occurs during the handover of connection which leads to a failure of connection. Throughout the last few years plenty of researches had been done to reduce this handover delay by reducing the scanning delay as the scanning process causes 90% of the total handover delay. In this paper, we propose a new scanning technique where the most potential AP is chosen according to the direction of the MN. First, we fit a polynomial equation along the trajectory of its motion and then to predict the direction of motion, we analyze the slope of the trajectory. Our simulation results show the effectiveness and accuracy of our proposed scheme in practical field. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.