for Journals by Title or ISSN
for Articles by Keywords
Followed Journals
Journal you Follow: 0
Sign Up to follow journals, search in your chosen journals and, optionally, receive Email Alerts when new issues of your Followed Jurnals are published.
Already have an account? Sign In to see the journals you follow.
Journal Cover   International Journal of Research in Computer and Communication Technology
  [2 followers]  Follow
  This is an Open Access Journal Open Access journal
   ISSN (Print) 2320-5156 - ISSN (Online) 2278-5841
   Published by Suryansh Publications Homepage  [2 journals]
  • Encrypting Data on Cloud Using Advanced Encryption Algorithm

    • Authors: Aditya Singh Kushwah
      Abstract: In recent years, cloud computing has been adopted by large sphere of public and private organizations due to its streamline processes, reduced capital, improved flexibility and accessibility, and resource sharing ability. More and more IT industries are taking a voyage to cloud from dedicated data centres. But with the advent of cloud technology comes avant-garde and byzantine issues, primarily, data security issues. While benefits of using cloud are riveting, data security for stow data is still a major topic of apprehension for every IT organization. This paper presents a method to safeguard the data which is stored on the cloud by implementing Advanced Encryption Standard (ASE) algorithm.
      PubDate: 2015-10-01
      Issue No: Vol. 4 (2015)
  • Fixed Point Lms Adaptive Filter Using Partial Product Generator

    • Authors: vidyamol s
      Abstract— The adaptive system whose structure is adjustable in such a way that the behavior or performance of the system improve. The simple example of adaptive system is automatic gain controller in radio and television system. This paper deals with architecture of efficient adaptive filter which include partial product generators for multiplication purpose.By using improved adder structure the area power efficiency can be increased. An adaptive algorithm is a procedure for adjusting the parameters of an adaptive filter to minimize a cost function chosen for the task at hand. We use Xilinx 14.5 to provide VHDL coding for our architecture. Two main part in the adaptive filter system are error computation block and weight update block. The error computation block will calculate the new error values, function of weight update block is calculate new weight from the error value computed from the error update block.
      PubDate: 2015-10-01
      Issue No: Vol. 4 (2015)
  • Coverage Modeling For Verification Of Floating Point Arithmetic Units

    • Authors: T. Seshagiri
      Abstract: Scope displaying is one of the key errands of the confirmation stream in frameworks improvement. The subsequent model is regularly used to assess the advancement and nature of the check process; it likewise gives a valuable deliberation to the era of test vector designs. This work shows a heuristic methodology for scope model definition in view of the ideas of equality classes and limit esteem investigation to address the check of skimming point number juggling units. As a contextual investigation, a scope model was intended to confirm the ADD operation of a drifting point module for the binary16 number configuration characterized in the IEEE 754-2008 standard, and a System Verilog test seat was actualized to perform the check process. The adequacy of the heuristic and the nature of the subsequent model are broke down by measuring the scope acquired in the execution of an outsider test suite, and by creating an arrangement of test vectors from the model and invigorating an outline under confirmation (DUV) to recognize bugs for configuration survey.
      PubDate: 2015-10-01
      Issue No: Vol. 4 (2015)
  • A Brief Servey Of Rfid Devices And Its Security Protocols

    • Authors: Rakesh Kumar Chandraul, Rajat Paliwal, Anurag Jain
      Abstract: Security plays a very important role during the transmission of information in RFID devices. RFID are the wireless devices that contain a tag and a reader. While there are many authentication protocols put into operation for the security of data starting the tag to the reader. The main purpose of this brief survey is to provide the information of the most related privacy and security protection protocols which applied to Radio Frequency Identification operation. The aim of this paper is to choose to most relevant protocols for RFID devices security.
      PubDate: 2015-10-01
      Issue No: Vol. 4 (2015)
  • A Comparative Study Of Text Detection Algorithm For Natural Scenes

    • Authors: Ameya Shanbhag, Ronak Thakkar, Harsh Patel
      Abstract: Text detection from image is highly needed application in current techno world. However, text detection is no longer an unsolved problem as many approaches/algorithms for it are encouraged by researchers. Algorithms used for text detection can be categorized by their nature of work, approach used in algorithm development, behavior of algorithm on a dataset and performance of the algorithm. To make a successful use of these available algorithms, one should have the complete information about these algorithms as well as the application on which they want to use the algorithm. Hence, in this paper we present the comparative study of the selected three text detection algorithms. We have studied three different algorithms Stoke width Transform, Adaptive algorithm and Text Localization.
      PubDate: 2015-10-01
      Issue No: Vol. 4 (2015)
  • Energy Efficiency For MIMO-OFDM Using Iterative Water Filling Algorithm

    • Authors: M. Venkateshwararao, K.Aruna Kumari, D. Swathi
      Abstract: Energy proficiency will be getting to be progressively critical for remote correspondence frameworks so as with minimize carbon foot shaped impression of remote networks and on expansion those battery term from claiming portable terminals. Those spectral-energy effectiveness exchange-off will be from claiming elementary hugeness with figure out upon what amount of vitality for every bit will be required done a remote correspondence framework with accomplish a particular ghastly effectiveness. In this paper, we examine energyefficient asset allotment plan to orthogonal FrequencyDivision different entry (OFDMA) frameworks with various clients. The exchange-off the middle of ghastly and vitality efficiencies will be broke down under those demand for looking after the equitability Around clients. We principal define the Vitality productive streamlining issue as a basic fragmentary modifying. We afterward apply a iterative fractional method to simplify the problem to integer linear programming (ILP) problem
      PubDate: 2015-09-28
      Issue No: Vol. 4 (2015)
  • An Algorithmic Framework In Order To Deal With Efficient Resource
           Allocation In Overlay Routing

    • Authors: A.Lakshman Rao
      Abstract: Overlay routing has been projected in latest years as an effectual way to attain convinced routing properties devoid of leaving into the extended and monotonous procedure of consistency and worldwide exploitation of a novel routing protocol. Overlay routing was used to progress TCP presentation over the Internet where the major proposal is to break the end-to-end criticism loop into minor loops. This requires that nodes competent of performing TCP Piping would be there all along the direct at comparatively diminutive detachments. We contemplate on this indicate and swot up the smallest amount of communications nodes that require to be additional in order to preserve a detailed possessions in the overlay routing. Inspite of the precise insinuation in mind we describe a universal optimization difficulty called the Overlay Routing resource allocation (ORRA) trouble and swot up its intricacy. It revolves out that the predicament is NP-hard and we present a nontrivial estimate algorithm for it.
      PubDate: 2015-09-28
      Issue No: Vol. 4 (2015)
  • Echo Noise Reduction Using Dynamic Selection Of Sub Band Adaptive Filters

    • Authors: M.Sri Kantha Reddy, B. Samuyelu, P. Karunakar
      Abstract: Versatile filters assume a paramount part clinched alongside advanced day sign transforming with provisions for example, such that commotion cancellation, sign prediction, versatile reaction cancellated What's more reverberation cancellated. The versatile filters utilized within our thesis, LMS channel and NLMS filter, would those practically broadly utilized Furthermore simplest on execute. The provision we tried in our proposal is clamor cancellated. An point of interest ponder from claiming both filters may be carried out by taking under account different cases. Comprehensively test cases were isolated under two Classes from claiming stationary sign and non-stationary indicator will watch execution against those sort for indicator included. Clamor difference might have been An alternate element that might have been viewed as on take in its impact. Also parameters from claiming versatile filter, for example, venture span and channel order, were differed to ponder their impact around execution of versatile filters. Those effects attained through these test instances are examined done point of interest and will assistance in superior Comprehension from claiming versatile filters for admiration to sign type, commotion difference and channel parameters.
      PubDate: 2015-09-28
      Issue No: Vol. 4 (2015)
  • Optimal Gabor Filter for Multi Scale Texture Segmentation with Color

    • Authors: K Betty, P Sasi Kiran
      Abstract: Image segmentation is the procedure of the subdivision of a picture into its constituent districts or items. The aftereffect of Image segmentation is an arrangement of sections that all in all cover the whole picture or an arrangement of shapes separated from the picture. Each of the pixels in a district is comparable regarding some trademark or processed property, for example, shading, power or surface. Particularly this venture manages surface division of a picture to figure out the diverse sorts of compositions present in the picture. Here we augmented the current single-channel technique for composition division to multi-channel strategy by utilizing numerous Gabor channels. In light of this expansion the present work manages multi-channel composition division of dim scale and shading pictures. Particularly this task manages multi-channel surface division of a shading and dim scale pictures to discover the diverse surfaces present in the composite picture. In this venture we proposed a way to deal with do composition division in view of Gabor channels. The proposed "Ideal GABOR channel for multi scale composition division with shading evidence" has been actualized in MATLAB.
      PubDate: 2015-09-26
      Issue No: Vol. 4 (2015)
  • Augmentation of very fast decision tree algorithm aimed at data mining

    • Authors: Ch.S.K.V.R Naidu, T.Y Ramakrushna
      Abstract: The reason for information order is to build a grouping model. The choice tree calculation is a more broad information characterization capacity estimate calculation taking into account machine learning. The choice tree is coordinated and non-cyclic. Iterative Dichotomiser 3(ID3) calculation developed by Ross Quinlan is utilized to create choice tree from a dataset. Considering its restrictions layer an improved calculation is recommended that can successfully abstain from favoring the characteristic with an expansive number of credit qualities prompting better tree results. It has its confinements as for time and with respect to missing qualities taking care of. Proposes to execute and utilize the quick choice tree (VFDT) calculation can adequately perform a test-and-train process with a restricted portion of information. Conversely with customary calculations, the VFDT does not oblige that the full dataset be perused as a major aspect of the learning process in this manner lessening time. As a preemptive way to deal with minimizing the effects of defective information streams, an information store and missing-information speculating component called the assistant compromise control (ARC) is proposed to capacity as an inside VFDT. The ARC is intended to determine the information synchronization issues by guaranteeing information are pipelined into the VFDT one window at once. In the meantime, it predicts missing qualities, replaces commotions, and handles slight deferrals and changes in approaching information streams before they Even enter the VFDT classifier along these lines prepared better to handle missing qualities. A viable execution of the proposed framework approves our case concerning the effectiveness of the VDFT plan.
      PubDate: 2015-09-24
      Issue No: Vol. 4 (2015)
  • Exploration Distribution And Appliances Problems In Mobile Sensor Networks

    • Authors: K Komali
      Abstract: This paper goes for examining different exploration issues of executing the portable entryway to coordinate remote sensor system (WSN) and different systems and another strategy for actualizing cell telephones itself serve as sensor of remote sensor system and different versatile sensor system based applications. Lately, the organization of remote sensor systems are utilized as a part of mixture of fields, for example, medicinal, ecological and environment checking production lines, movement control, structure observing, flame recognition and framework security and so on. WSN comprises of sensor hubs of low power, low information rate correspondence capacity and low preparing force. So there is a plausibility of loss of information which are detected by the sensors furthermore numerous challenges to transmit the detected information to different systems effortlessly. Beat this circumstance, an advanced cell furnished with high handling force sensors are utilized as sensors as a part of WSN or utilized as a door in the middle of WSN and other system and this usefulness of coordinating WSN and different systems through PDA innovation called portable remote sensor network(MSN) is utilized as a part of numerous applications. Rich-sensor advanced mobile phones have made conceivable the late conception of the versatile detecting examination range as a major aspect of omnipresent detecting which incorporates different territories, for Example, remote sensor systems and web detecting. There are a few sorts of portable detecting: individual, participatory, artful, swarm, social, and so on. The object of detecting can be individuals focused or environment-focused. The detecting space can be home, urban, vehicular… Currently hindrances restrain the social acknowledgment of versatile detecting frameworks. Cases of social hindrances are security concerns, prohibitive laws in a few nations and the nonappearance of monetary motivating forces that may urge individuals to take an interest in a detecting crusade. A few specialized boundaries are telephone vitality investment funds and the mixed bag of sensors and programming for their administration. Some current studies mostly handle the theme of portable detecting frameworks. Distributed papers hypothetically or somewhat fathom the above obstructions. We finish the above overviews with new works, audit the boundaries of versatile detecting frameworks and propose a few thoughts for effectively actualizing detecting, combination, learning, security, protection and vitality putting something aside for any kind of portable detecting framework, and propose a few sensible exploration challenges. The fundamental goal is to lessen the expectation to absorb information in versatile detecting frameworks where the intricacy is high.
      PubDate: 2015-09-24
      Issue No: Vol. 4 (2015)
  • Design Basis Concerns And Challenges For The Data Environment

    • Authors: T Chandana Gouri
      Abstract: Big Data are becoming a new technology focus both in science and in industry and motivate technology shift to data centric architecture and operational models. There is a vital need to define the basic information/semantic models, architecture components and operational models that together comprise a so-called Big Data Ecosystem. This paper discusses a nature of Big Data that may originate from different scientific, industry and social activity domains and proposes improved Big Data definition that includes the following parts: Big Data properties ( also called Big Data 5V: Volume, Velocity, Variety, Value and Veracity), data models and structures, data analytics, infrastructure and security. The paper discusses paradigm change from traditional host or service based to data centric architecture and operational models in Big Data. The Big Data Architecture Framework (BDAF) is proposed to address all aspects of the Big Data Ecosystem and includes the following components: Big Data Infrastructure, Big Data Analytics, Data structures and models, Big Data Lifecycle Management, Big Data Security. The paper analyses requirements to and provides suggestions how the mentioned above components can address the main Big Data challenges. The presented work intends to provide a consolidated view of the Big Data Phenomena and related challenges to modern technologies, and initiate wide discussion.
      PubDate: 2015-09-24
      Issue No: Vol. 4 (2015)
  • Elimination Of Repeated Data Copies With Enhanced Security In Hcloud

    • Authors: N Mary Joycy Deborah, R Sailaja
      Abstract: Intending at economically solving the trouble of deduplication with discrepancy privileges in cloud computing we regard as a hybrid cloud structural design consisting of a public cloud and a private cloud. Dissimilar existing data deduplication systems, the private cloud is occupied as a proxy to tolerate data owner/users to firmly achieve duplicate check with differential privileges. Such architecture is realistic and has concerned much attention from researchers. The data owners only outsource their data storage by employing public cloud while the data operation is handled in private cloud. A new deduplication system supporting differential duplicate check is planned under this hybrid cloud architecture where the S-CSP dwells in the public cloud. The user is only authorized to carry out the duplicate ensure for files marked with the corresponding privileges. The users without equivalent privileges cannot perform the duplicate check. Additionally such unconstitutional users cannot decrypt the cipher text even conspire with the S-CSP.

      PubDate: 2015-09-22
      Issue No: Vol. 4 (2015)
  • A New Heuristic Approach For Hide Valuable Information Of Organizations

    • Authors: N Aruna Sandhya, B Sujatha
      Abstract: Organizationsamass and analyze customer data to pick up their services. Access Control Mechanisms(ACM) is used to make sure that only authorized informationis on hand to users. Onthe other hand, sensitive information can at rest be changed by authorized users to conciliation the privacy of consumers. We use the perception of imprecision bound for permission to characterize a porch on the quantity of imprecision that can be tolerated. Existing workload aware anonymization techniques decrease the imprecision combined for all queries and the vaguenessadded to each permission/query in the anonymizedmicro data is not acknowledged. Creation the privacy requirement more rigorous (e.g., increasing the value of k or l) results in extra imprecision for queries. However the dilemma of enjoyable exactness constriction for entity permissions in a policy/workload has not been considered before. The heuristics proposed in this paper foraccuracy-constrained privacy-preserving access controlare also significant in the framework of workload-aware anonymization.
      PubDate: 2015-09-21
      Issue No: Vol. 4 (2015)
  • A New Approach On Incremntal Affinity Propagation Clustering Technique
           Based On Preference

    • Authors: T. V Satyavathi, Dr. A Krishna Mohan
      Abstract: Many of the clustering algorithms were intended for discovering patterns in static data. Nowadays, more and more data e.g., blogs, Web pages, video surveillance, etc., are come into view in dynamic manner, known as datastreams. Consequently, incremental clustering, evolutionary clustering, and data stream clustering are becoming scorching topics in data mining societies. Characteristics of the dynamic data, or data streams, include their high volume and potentially unbounded size, sequential access, and dynamically evolving nature. This impresses additional requirements to traditional clustering algorithms to hastily process and recap the immense amount of ad infinitum arriving data. It also necessitate the aptitude to adapt to changes in the data distribution, the ability to detect emerging clusters and differentiate them from outliers in the data, and the ability to merge old clustersor discard expired ones. All of these needs make lively data clustering an important confront.
      PubDate: 2015-09-21
      Issue No: Vol. 4 (2015)
  • To Enable Base Station To Obtain The ‘True’ Estimate Of The
           Aggregate In The Presence Of The Attack

    • Authors: G Jaya lakshmi, Usha Devi SSSN
      Abstract: The sensor nodes appearance a multi-hop network as the base station (BS) proceeds as the central point of control. Wireless sensor networks used in different kinds of applications like Forest monitoring, weather forecasting and oil and gas pipeline leakages. To reduce communication overhead and energy consumption a new concept is introduced that is data aggregation means partial data is aggregated in intermediate nodes. Existing synopsis diffusion framework can’t separate the false Aggregate data which is generated by compromised nodes by the attacker. We propose a new protocol for mobile sensing to obtain the sum aggregate of time-series data in the presence of an untrusted aggregator. The proposed protocol employs an additive homomorphic encryption and a novel key management scheme based on efficient HMAC to ensure that the aggregator can only obtain the sum of all sensor’s data, without knowing individual sensor’s data or intermediate result.
      PubDate: 2015-09-21
      Issue No: Vol. 4 (2015)
  • Public Key Encryption Using Key Aggregate Cryptosystem

    • Authors: M Siri Madhavi, A Sowjanya Deepthi
      Abstract: Data contribution is an imperative functionality in cloud storage. For illustration bloggers can let their friends view a separation of their private pictures. An endeavour may contribution her employee’s contact to a segment of sensitive data. The demanding difficulty is how to efficiently share encrypted data. Of course users can download the encrypted data from the storage, decrypt them then send them to others for sharing but it loses the worth of cloud storage. Users should be capable to hand over the access rights of the sharing data to others so that they can way in these data from the server unswervingly. Though judgment a well-organized and protected way to divide up biased data in cloud storage is not unimportant.
      PubDate: 2015-09-21
      Issue No: Vol. 4 (2015)
  • Principled Probabilistic Methods To Integrate Information From The Query
           Workload Into The Data Annotation Process

    • Authors: K Ramesh, P Arun Patnaik
      Abstract: The aspiration of CADS is to persuade and inferior the cost of crafting adequately interpreted documents that can be right away helpful for usually issued partially prearranged enquiries. Our solution ambition is to promote the annotation of the documents at creation time at the same time as the creator is still in the “document generation” segment even nonetheless the procedures can also be used for post generation document annotation. In our circumstances the author produces a new document and uploads it to the ordnance. We suggest Collaborative Adaptive Data Sharing platform (CADS) which is an “annotate-as-you create” communications that makes easy field data annotation. An explanation payment of our system is the straight use of the enquiry workload to straight the annotation processes in addition to exploratory the content of the document. In other words we are annoying to prioritize the annotation of documents toward generating characteristic values for attributes that are frequently used by querying users.
      PubDate: 2015-09-21
      Issue No: Vol. 4 (2015)
  • A Personalized Anonymization Technique Based On An Aggregate Formulation
           Implemented In Polynomial Time

    • Authors: Y Srinivas, D Srinivas
      Abstract: Differential Privacy makes available a conjectural formulation for solitude that guarantees that the system basically performs the identical way despite of whether any personality is incorporated in the database. In this paper, we deal with both scalability and privacy risk of data anonymization. We recommend a scalable algorithm that meets differential privacy when be appropriate an explicit random sampling. Make known the minimum amount of information or no information at all is undeniable more than ever when organizations try to look after the seclusion of individuals. To accomplish such a purpose, the organizations naturally try to hide from view the uniqueness of an individual to whom data pertains and affect a set of transformations to the micro data previous to liberate it.
      PubDate: 2015-09-21
      Issue No: Vol. 4 (2015)
  • Providing Privacy For Sensitive Data In Relational Database With
           Imprecision Bounds

    • Authors: R Pragathi, G Kalyan Chakravarthy
      Abstract: The perception of privacy-preservation for receptive data can necessitate the enforcement of privacy policies or the fortification against uniqueness revelation by rewarding some privacy requirements. In this paper we inspect privacy-preservation from the obscurity aspect. The sensitive information even later than the exclusion of identifying attributes is still disposed to linking attacks by the approved users. This predicament has been considered expansively in the area of micro data publishing and solitude definitions e.g., k-anonymity, l-diversity and variance diversity. Anonymization algorithms use repression and sweeping statement of records to please solitude needs with minimal bend of micro data. The secrecy methods can be used with an access control mechanism to make sure both safety and solitude of the sensitive information. The seclusion is attained at the cost of correctness and vagueness is introduced in the authorized information under an right of entry manage strategy.
      PubDate: 2015-09-21
      Issue No: Vol. 4 (2015)
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2015