By Topic

Computer and Communication Technology (ICCCT), 2012 Third International Conference on

Date 23-25 Nov. 2012

Filter Results

Displaying Results 1 - 25 of 78
  • [Cover art]

    Page(s): C4
    Save to Project icon | Request Permissions | PDF file iconPDF (11757 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (123 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (118 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (156 KB)  
    Freely Available from IEEE
  • Message from General Chair and the International Chairs

    Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (79 KB)  
    Freely Available from IEEE
  • Privacy preservation in context aware systems: Overview and applications

    Page(s): xix
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (85 KB)  

    Summary form only given, as follows. Advent of 4 G networks, IPv6 and increasing number of subscribers indicate that each mobile device will have its own IP address and virtually become a hotspot. In the coming years, systems that track and record our movements will indispensably be integrated in our everyday life. Location-based systems: dashboard navigation systems, Internet enabled smartphones with GPS features, and electronic tags that help us at various locations are extensively in use. In near future, location-aware/ context aware tools will become more common and sophisticated. Increasing number of services (apps)/devices that will track not only the location, but also the context / environment of the user will enter the market. The perils of exposure on Internet and subsequent exploitation have been widely recorded in literature. Some of the services provided do necessitate the knowledge of exact location, context and some personal details, like in case of assistance during accidents, but generally, applications like finding the restaurants or movies playing in an area do not require the exact location and context of the user. When a user??s movement in public spaces is tracked and systematically recorded along with the context of his actions, his contextual privacy is under threat. This presentation will discuss the current state of research in this area and analyses the effect of threat on the privacy of context aware system users. Based on the insight, this talk will provide an integrated framework to tackle the privacy preservation issue comprehensively: from user perspective as well as service provider perspective. In addition, this talk will also include a discussion on context aware distributed storage system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Ontology-Based Topical Crawling Algorithm for Accessing Deep Web Content

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

    Due to the large volume of the Web information and relatively high speed of information update, the coverage and quality of the retrieved pages by modern search engines is comparatively small. Given the volume of the Web and its frequency of content change, the coverage and quality of pages retrieved by modern search engines is relatively small since they crawl only hypertext links ignoring the search forms which are the entry points for accessing deep web content where two-thirds of information is resides. In this paper an algorithm has been designed to enable topical crawlers to access hidden web content by using domain based ontology to determine the forms' relevance to the domain. In this work scientific research publications domain has been considered. Experimental results show that proposed approach is better as compared to keyword based crawlers in terms of both relevancy and completeness. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Mining: A New Approach for Data Mining Based on Texture

    Page(s): 7 - 9
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (255 KB) |  | HTML iconHTML  

    Image data mining can be done manually by slicing and dicing the data until a pattern becomes obvious. Or, it can be done with programs that analyse the data automatically. Colour, texture and shape of an image have been primitive image descriptors in Content Based Image Retrieval (CBIR) system. Primitive features of an image used to identify and retrieve closely matched images from an image database. It is very difficult to extract images manually from image database because they are very large. This paper presents a novel framework for texture information of an image and achieves higher retrieval efficiency than the shape features of an image. There is a trade-off between accuracy and computational cost. The trade-off decreases as more efficient algorithm is used to solve the problem and increases the computational power and will decreases the cost of the whole system as well. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision Making through Multi Rule Algorithm: An Extension to 1 Rule Algorithm

    Page(s): 10 - 13
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (136 KB) |  | HTML iconHTML  

    Mining is a process of searching data in huge database to infer useful information and deduces relationships and patterns. Though we can predict certain patterns from our database manually, but as soon as size of data increases (becomes in terabytes) it becomes difficult and tedious to deduce the important information from huge database (or data warehouse). Various data-mining algorithms exist to identify possible patterns in data. 1Rule algorithm is one such algorithm but is capable of classifying rule based on only one attribute. This paper extends 1Rule algorithm by classifying more rules based on multiple attributes, so that more accurate decision or prediction are made thereby improving revenue and reducing costs in a company. 1Rule creates a rule for a data based on one attribute, it chooses the rule that gives the lowest classification error after comparing the error rates from all the attributes. In our work we identified and create more rules based on multiple attributes by considering the lowest error attribute as the new classified attribute. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User Centric Retrieval of Learning Objects in LMS

    Page(s): 14 - 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (399 KB) |  | HTML iconHTML  

    Research and Academic Institutions own and archive a great number of documents like lesson plan, study material and research related resources, which are needed to be stored and used over for a longer period of time by lecturers and researchers. In order to achieve this it is required to convert these educational resources into Learning Objects and store them in structured & meaningful way via a learning management system (LMS) thus enriching classical teaching. Also with enhancement of e-learning environment there is a great need of managing the LMS repositories by storing information resources as Learning object, a digital entity which can be used in electronic learning environment. These learning objects are stored in repositories and are managed by Learning Management Systems. It aids teaching and learning process and helps in communications between users. Many designs of LMS are non user-centric and has limited capabilities in delivering user preferred learning material. Searching through keywords or metadata of learning material will result in display of huge quantity of information. Thus there is an earnest need to identify the techniques that can provide more efficient mechanism for information retrieval. Recommendation techniques have shown to be successful in many domains (e.g. movies, books, music, etc.). Thus there is a need to deploy a recommending system in the E-Learning domain to extend the functionality of standard-based learning management systems with providing the user based retrieval. In this paper a model is being proposed that can enhance the search and delivery of a relevant learning object based on his/her preferences and further ranking & clustering of learning objects are done through K-Mean and Self Organising Maps for a personalised learning environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Web Pre-fetching at Proxy Server Using Sequential Data Mining

    Page(s): 20 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (610 KB) |  | HTML iconHTML  

    Reducing latency for accessing web objects is a major challenge in Proxy Server and various techniques such as web caching and Web pre-fetching is used for it. In this paper we have integrated the approach of web caching and pre-fetching using sequential data mining techniques to enhance the proxy server's performance. The web access logs collected at squid proxy servers, can be used derive interesting information regarding user's web navigation pattern which can be utilized in improving the performance of proxy server by integrating the approach of web caching and pre-fetching using sequential data mining techniques. The work presented here uses Pre-order linked position coded Web Access pattern (PLWAP) Algorithm for finding frequent accessed web objects of each user by analyzing the browsing history from the access log files and then compares the results over page replacement algorithms such as, Least Recently Used (LRU) and Least Frequently Used (LFU), first without using concept of pre-fetching and then by using pre-fetching. The experimental results show that for each data set the pre-fetching improves the performance of proxy server. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy Preserving Data Mining Techniques: Current Scenario and Future Prospects

    Page(s): 26 - 32
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (173 KB) |  | HTML iconHTML  

    Privacy preserving has originated as an important concern with reference to the success of the data mining. Privacy preserving data mining (PPDM) deals with protecting the privacy of individual data or sensitive knowledge without sacrificing the utility of the data. People have become well aware of the privacy intrusions on their personal data and are very reluctant to share their sensitive information. This may lead to the inadvertent results of the data mining. Within the constraints of privacy, several methods have been proposed but still this branch of research is in its infancy. The success of privacy preserving data mining algorithms is measured in terms of its performance, data utility, level of uncertainty or resistance to data mining algorithms etc. However no privacy preserving algorithm exists that outperforms all others on all possible criteria. Rather, an algorithm may perform better than another on one specific criterion. So, the aim of this paper is to present current scenario of privacy preserving data mining tools and techniques and propose some future research directions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Combined Architecture for FDCT Algorithm

    Page(s): 33 - 37
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (393 KB) |  | HTML iconHTML  

    A single generalized architecture has been deviced which can perform 4 FDCT algorithms namely, Arai's, Chen's, Loeffler's and Vetterli's by varying the control signals. Simulink files containing block design files of 4 FDCT algorithms are included. From the Simulink file appropriate language (VHDL) for the target board (FPGA) can be generated. The VHDL code is run in MODELSIM XE III/Starter 6.1e-custom Xilinx Version. Here the target board is XILINX VIRTEX-IV PRO. The obtained results are compared and concluded. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to Adaptive Locality Based Maintenance of Correlated Data

    Page(s): 38 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (564 KB) |  | HTML iconHTML  

    Operations performed in a Binary Search Tree generally starts from root node. As result search space (total number of nodes) constitutes entire tree, where a normal users intention is only certain part of the tree. In this paper we propose a noble method for performing operations such as insertion, deletion and retrieval within the local search space of a lookup node rather than the root node. To define local search space of a node, we implement leaf nodes null pointers, which are generally remains unused. These local search spaces divides the actual search space which generally constitutes entire tree. Hence complexity reduced to O(log m) from O(log n) for a local node, where m is the number of nodes present in sub tree formed by local search space and n is the number of nodes present in the tree. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel Single Input Five Output Voltage Mode Universal Filter Based on DDCCTA

    Page(s): 46 - 51
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (207 KB) |  | HTML iconHTML  

    A novel single input five output voltage mode universal filter based on differential difference current conveyor transconductance amplifier (DDCCTA) is presented. It employs grounded passive components namely two capacitors and a resistor. The proposed filter offers the following advantageous features: high input impedance-a desirable property of voltage mode filters; simultaneous availability of low pass, band pass, high pass, notch, and all pass; no matching constraint; low sensitivity performance and use of grounded capacitors suitable for integration. The effect of DDCCTA non-idealities on filter behaviour has also been addressed. The functionality of the design is verified through SPICE simulations using 0.25 μm TSMC CMOS technology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Time Error Estimation Technique for OFDM System

    Page(s): 52 - 56
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (363 KB) |  | HTML iconHTML  

    OFDM based systems are extremely sensitive to time and frequency synchronization errors. This paper addresses the issue of time synchronization. In this paper we are presenting a simple and novel technique for time synchronization. The time synchronization error causes Inter Symbol Interference and hence must be corrected at receiver. In many wireless communication systems, the data packets or frame start with the preamble called training symbol followed by data symbols. The training symbol consists of some specific pattern. The similar frame structure is used for this new algorithm which consists of training symbol followed by OFDM data symbols. This novel technique uses new pattern for training symbol which consists of all identical samples. After applying our new algorithm, a peak is obtained at the end of training symbol. This is used to mark beginning of frame and estimation of timing error. Estimation error graph and BER graph are presented for 4QAM and 16 QAM in this paper. The results are shown for AWGN channel. The technique used is simple and results are encouraging and can be used in any of the OFDM based system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variability Analysis of MTJ-Based Circuit

    Page(s): 57 - 62
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (202 KB) |  | HTML iconHTML  

    This paper presents a study of MTJ-based logic circuit in terms of propagation delay, power dissipation, and power-delay product. The paper also analyzes impact of PVT process, voltage, and temperature) variations on most of the design metrics of logic circuit and compares the results with hose conventional CMOS logic circuit. The MTJ-based logic circuit are found to be robust compared with conventional CMOS logic circuits at the cost longer delay and higher power dissipation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voltage Mode Single OTRA Based Biquadratic Filters

    Page(s): 63 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (181 KB) |  | HTML iconHTML  

    In this paper, single operational transresistance amplifier (OTRA) based biquadratic filter configuration is proposed. The topology can be used to synthesize low pass, high pass and band pass filter functions with appropriate admittance choices. This configuration can implement filters with high quality factor which can be controlled independent of angular frequency. Workability of the proposed biquad configuration is demonstrated through PSPICE simulations using 0.5 ìm CMOS process parameters provided by MOSIS (AGILENT). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Estimation Using Correlator for OFDM Based Wireless Communication System

    Page(s): 67 - 72
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (483 KB) |  | HTML iconHTML  

    Nowadays, correlator is a crucial part of communication systems. The correlation function has a great practical importance when it is necessary to process a signal in the presence of noise. Use of correlator in modern communication system have more precise frequency and timing synchronization, which improves its ability against interference of multipath and frequency selective fading channels. Even in the circumstances of low signal to noise ratio, it also has a very high accuracy of synchronization[1]. It plays an important role in the future communication systems such as broadband wireless network, or 4G. When a delay-correlator operates in the real system, timing synchronization deviation is quite obvious, which seriously affects the system performance. The aim of this project is to design a correlator which has more precise frequency and timing synchronization. Firstly the correlator functionality will be verified using MATLAB tool. Also simulation will be done using HDL and then hardware implementation will be done. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of DVCCCTA Based Mutually Coupled Circuit

    Page(s): 73 - 76
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (198 KB) |  | HTML iconHTML  

    This paper presents Differential Voltage Current Controlled Conveyor Transconductance Amplifier (DVCCCTA) based realization of floating mutually coupled circuit. It employs only three DVCCCTAs and three grounded capacitors. The attractive feature of the circuit is independent and electronic control of primary, secondary and mutual inductance values. The proposed circuit is also analyzed for non ideal behavior of DVCCCTA. The SPICE simulations sing the parameters of 0.25ìm TSMC CMOS Technology are presented to validate the proposed theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MOS-C Third Order Quadrature Oscillator Using OTRA

    Page(s): 77 - 80
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (149 KB) |  | HTML iconHTML  

    In this paper a voltage mode third order quadrature oscillator is proposed. The proposed filter is suitable for MOS-C implementation making oscillation frequency electronically tunable. The non-ideality analysis of the circuit is also given and for high frequency applications self compensation can be used. PSPICE simulations have been included to demonstrate the workability of the proposed quadrature oscillator. Simulations are carried out using 0.5 ìm CMOS process parameters provided by MOSIS (AGILENT). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic Study of Binocular Depth Finding Using Two Web Cameras

    Page(s): 88 - 89
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (132 KB) |  | HTML iconHTML  

    A stereovision sensor system for depth measurement has been developed in our department. Stereo cameras attached to a robot can perform several tasks effectively, such as calculating distance of an object or that of a person by using depth map, which can further lead to achieve a bigger goal of grasping or manipulation of objects. We have calibrated the cameras and applied rectification algorithm to the images to develop the stereo pair. While taking the data we have observed that due to divergence of cameras, the calculated distances were larger than the actual distances. We concluded that a further improved system can be developed which can take care of this systematic error and achieve more accurate results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mouse Cursor Control System Based on Facial Electromyogram and Mechanomyogram

    Page(s): 90 - 91
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (172 KB) |  | HTML iconHTML  

    This paper reports the development of a mouse cursor control system as an assistive technology for upper arm amputees. The control is based on facial electromyogram (fEMG) and mechanomyogram (MMG) signals. The fEMG and MMG signals are collected for six words from eight subjects. A reference signal has been simulated based on the mean values of the signals representing the six words. The Euclidian distance between the Cepstral coefficients of the six words from that of the reference signal comprised the feature vector. Classification is through a probabilistic neural network. Six mouse cursor operations: up, down, left, right, left click and right click are reproduced. We have achieved an average classification rate of 91.5% using fEMG and 89.5% using MMG signal. The classification result is mapped into cursor operations through a switch based linear control. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced Variable Neighbourhood Search for Pagenumber Minimization Problem

    Page(s): 92 - 97
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (212 KB) |  | HTML iconHTML  

    In this paper we apply reduced variable neighbourhood search (RVNS) to the page number minimization problem (PNP). In RVNS, random depth first search of the graph is used for placing the vertices on the spine and three edge embedding heuristics are used to distribute the edges on a minimal number of pages. The results show that the algorithm achieves the optimal page number for most of the standard graphs tested by us. RVNS performance is also compared with the genetic algorithm and hybrid evolutionary algorithm present in the literature on select instances of standard and random graphs. It is observed that RVNS gives better solutions for random instances. Extensive experiments were carried out on classes of graphs with known results/upper bounds. Optimal values were achieved by RVNS for all the graphs tested and substantially lower values were obtained for the graphs with known upper bounds of page number. The main contribution of the paper are some Harwell-Boeing Sparse Matrix Collection graphs and cartesian product of complete graphs with unknown page numbers. View full abstract»

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