for Journals by Title or ISSN
for Articles by Keywords
help
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.
International Journal of Research in Computer and Communication Technology
   Journal TOC RSS feeds Export to Zotero [4 followers]  Follow    
  This is an Open Access Journal Open Access journal
     ISSN (Print) 2320-5156
     Published by Suryansh Publications Homepage  [2 journals]
  • Filtered Wall: An Automated System to Filter Unwanted Messages from OSN
           User Profiles

    • Authors: Pechetti Santosh, R.Praveen kumar
      Abstract: In recent years, Online Social Networks (OSNs) have become an important part of daily life. Users build explicit networks to represent their social relationships. Users can upload and share information related to their personal lives. The potential privacy risks of such behavior are often ignored. And the fundamental issue in today On-line Social Networks is to give users the ability to control the messages posted on their own private space to avoid that unwanted content is displayed. Today OSNs provide very little support to prevent unwanted messages on user walls.  For that purpose, we proposed a new system allowing OSN users to have a direct control on the messages posted on their walls. This is achieved through a flexible rule-based system, that allows users to customize the filtering criteria to be applied to their walls, and a Machine Learning (ML) based soft classifier automatically labeling messages in support of content-based filtering. The system exploits a ML soft classifier to enforce customizable content-dependent Filtering Rules. And the flexibility of the system in terms of filtering options is enhanced through the management of Blacklists. The proposed system gives security to the On-line Social Networks
      PubDate: 2014-10-19
      Issue No: Vol. 3 (2014)
       
  • Time-Based All-Digital Technique for Analog Built-in Self-Test

    • Authors: Katheragandla Kishore, G Venkata Karthik
      Abstract: A scheme for built-in self-test of analog signals with minimal area overhead for measuring on-chip voltages in and all-digital manner is presented. The method is well suited for a distributed architecture, where the routing of analog signal saver long paths is minimized. A clock is routed serially to the sampling heads placed at the nodes of analog test voltages. This sampling head present at each test node, which consists of a pair of delay cells and a pair of flip-flops, locally converts the test voltage to a skew between a pair of sub sampled signals, thus giving rise to as many sub sampled signal pairs as the number of nodes. To measure a certain analog voltage, the corresponding sub sampled signal pair is fed to a delay measurement unit to measure the skew between this pair. The concept is validated by designing a test chip in a UMC 130-nm CMOS process .Sub-mill volt accuracy for static signals is demonstrated for measurement time of a few seconds, and an effective number of bits of 5.29 is demonstrated for low-bandwidth signals in the absence of sample-and-hold circuitry
      PubDate: 2014-10-19
      Issue No: Vol. 3 (2014)
       
  • Low-Power Digital Signal Processor Architecture for Wireless Sensor Nodes

    • Authors: Kamanuru Naga Dasaradha, Putha Pavankumar Reddy
      Abstract: Radio communication exhibits the highest energy consumption in wireless sensor nodes. The sensor networks are intended to support a variety of applications . Providing sensor network with flexible nodes design will make possible to support  a variety of application . In these paper we currently they are designed around off the shelf low power microcontrollers, But by employing a more appropriate processing element , the energy consumption can be significantly reduced.  This paper describes the design and implementation of newly proposed folded – tree architecture for on – the  node data processing in wireless sensor networks using Berunt – kung Parallel prefix operation and data locality in hardware . Due to Berunt – Kung parallel prefix architecture it reduces the number of logic cells and delay is more .  This paper is implemented and simulated in Xilinx ISE software and resulted are observed .  Limited  data set by pre – processing  with parallel –prefix  operations, reuseability with floding technique
      PubDate: 2014-10-19
      Issue No: Vol. 3 (2014)
       
  • Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor communication
           of Networks

    • Authors: Dantam. Ramesh, Dasari . Koteswara Rao
      Abstract: Low power Wireless sensor network is getting more attention recently by the researchers due to its security issues on denial of communication at the routing or medium access control levels. In this work we discussed a method to explore the attacks in  routing protocol layer, which permanently disable networks by draining battery power. These “Vampire” attacks protocol dependent.  It is a difficult task to determine these attacks except sending only protocol-compliant messages and detect it. Sometimes, a single Vampire can increase network-wide energy usage by a factor of O (N), where N in the number of network nodes.  Here we discuss a method/ protocol to decrease the risk and damage during the packet forwarding phase.
      PubDate: 2014-10-09
      Issue No: Vol. 3 (2014)
       
  • Confidential And Stabilized Security For Third Party On Clouds

    • Authors: Giribabu Yalamarthi, Kommu Hephzibah, Saritha Seelam
      Abstract: Using Cloud Storage, users can remotely store their data and enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources, without the burden of local data storage and maintenance. However, the fact that users no longer have physical possession of the outsourced data makes the data integrity protection in Cloud Computing a formidable task, especially for users with constrained computing resources. Moreover, users should be able to just use the cloud storage as if it is local, without worrying about the need to verify its integrity. Thus, enabling public auditability for cloud storage is of critical importance so that users can resort to a third party auditor (TPA) to check the integrity of outsourced data and be worry-free. To securely introduce an effective TPA, the auditing process should bring in no new vulnerabilities towards user data privacy, and introduce no additional online burden to user. In this paper, we propose a secure cloud storage system supporting privacy-preserving public auditing. We further extend our result to enable the TPA to perform audits for multiple users simultaneously and efficiently. Extensive security and performance analysis show the proposed schemes are provably secure and highly efficient.
      PubDate: 2014-10-08
      Issue No: Vol. 3 (2014)
       
  • Strategy And Necessity Trades For Smile Networks

    • Authors: Dendukuri rama Manohar, Barigala Srikanth, Saritha Seelam
      Abstract: The mobile social networks are likely to a large extent enhance interaction with mobile users and shared the information in encounter-based social network. In this encounter traditional social network as opposed users abuse the information’s. So this new approach challenges network basically different by previous social network designs this new approach presents challenges that are fundamentally different from those tackled by previous social network designs. In this paper, we explore the functional and security requirements for these new systems, such as availability, security, and privacy, and present several design options for building secure encounter-based social networks. Here also we explore different requirements for these new systems. We first provide an introduction to the surveillance, social and institutional privacy perspectives. We then explore the differences between these approaches in order to understand their complementarity. In this paper, we explore the privacy requirements for Encounter- based social networks. We provide an overview on the privacy guarantees and feasibility of SMILE and also its drawback in meeting certain requirements. So we describes the design of SMILE, is secure for a privacy-protection “missed-connections” service for mobile users. It also provides services using mobile devices without relying on trusted coordinating server. Here SMILE design using key exchange protocols. We develop cryptography hash technique for protect the information through the mobile application. This paper presents a design of secure encounter-based social network by implementing in android application called MeetUp.
      PubDate: 2014-10-08
      Issue No: Vol. 3 (2014)
       
  • Contribution Of Information Sharing In Wireless Sensor Network With Prune
           Delay

    • Authors: Bollareddy Vamsi, Barigala Srikanth, Saritha Seelam
      Abstract: The widespread availability of miniature wireless devices such as cell phones, laptops, mobiles has become an indispensable part of our life. The increase in the number of smart phone users has lead to the increase in the peer-to-peer adhoc content sharing. Traditional data delivery schemes are not suitable for such networks due to intermittent connectivity between smart phones. In Delay Tolerant Networks (DTNs) the core challenge is to cope with lack of persistent connectivity and yet be able to deliver messages from source to destination. In particular, routing schemes that leverage relays’ memory and mobility are a customary solution in order to improve message delivery delay. To share the contents in such a scenario, researchers have proposed store-carry-forward as an efficient content sharing scheme where a node stores a message and carries it for certain duration until a communication opportunity arises and then delivers it to the destination. Previous works in this field focused on whether two nodes would encounter each other and the place and time of encounter and did not consider the activities of malicious peers. This paper proposes discover-predict-deliver as efficient content sharing scheme that enable peers to share contents and also presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions and recommendations .We scheduling the large file into small packets and delivering through multipath to destination, for this we use optimal user centric allocation and scheduling the packets in the receiver side.
      PubDate: 2014-10-08
      Issue No: Vol. 3 (2014)
       
  • Multiuser access control for online social networks: by using of
           multiparty access control

    • Authors: A.M.Prasanth Kumar, J. Ravi Kumar
      Abstract: Now a day Online social networks (OSNs) have got an exponential growth and become a fame to millions of Internet users. These OSNs offer attractive ways and methods for social interactions and information sharing, Also OSNs allow users to restrict access to shared data but it is not effective in enforcing security over the data.  In this paper , we propose an approach to provide the protection by considering multiparty authorization requirements. It also explained a logical representation of our access control model that allows us to leverage the features of existing logic solvers to perform various analysis tasks on our model.
      PubDate: 2014-10-08
      Issue No: Vol. 3 (2014)
       
  • A Logic Test to Minimize Test Data Volume By Single Cycle Access Structure

    • Authors: Chittari Amarnath, K Bala
      Abstract: This research proposes a a logic test to minimize test data volume by single cycle access structure. It eliminates the peak power consumption problem of conventional shiftbased scan chains and reduces the activity during shift and capture cycles. This leads to more realistic circuit behavior during stuck at and atspeed tests. It enables the complete test to run at much higher frequencies equal or close to the one in functional mode. It will be shown, that a lesser number of test cycles can be achieved compared to other published solutions. The test cycle per net based on a simple test pattern generator algorithm without test pattern compression is below 1 for larger designs and is independent of the design size. Results are compared to other published solutions on ISCAS’89 net lists. The structure allows an additional onchip debugging signal visibility for each register. The method is backward compatible to full scan designs and existing test pattern generators and simulators can be used with a minor enhancement. It is shown how to combine the proposed solution with built in self test  (BIST)  and massive parallel scan chains.
      PubDate: 2014-10-07
      Issue No: Vol. 3 (2014)
       
  • Design and Implementation of FPGA Radix-4 Booth Multiplication Algorithm

    • Authors: A.Rama Vasantha, M.Sai Satya Sri
      Abstract: Fast multipliers are essential parts of digital signal processing systems.The system performance is based on the performance of multiplier used in the system, because it is the slowest component among all components used. One of the major design issue is optimizing speed and area of the multiplier which are two conflicting constraints. Hence realization of high speed multipliers is done to enhance parallelism and to decrease the number of calculation stages. For high speed arithmetic logics, a new architecture called Radix -4 Booth Multiplication algorithm which is based on MAC logic have been designed and implemented on Xilinx FPGA device. It is a combination of multiplication with accumulation and a hybrid adder(CSA and CLA) is designed to improve system performance. Here, multiplication is done as the series of repeated addition by generating partial products and finally adding them. The modified Booth Algorithm is used to reduce the number of partial products generated by a factor of 2. The multiplicand is considered as the number to be added and the multiplier is the number of times that it is added, and the result is the product.
      PubDate: 2014-10-06
      Issue No: Vol. 3 (2014)
       
  • Target Tracking Problem in Mobile Sensor Networks

    • Authors: Brahma Mahesh Modepalli, Sabitha CH
      Abstract: Target Tracking became a challenging task for the researchers in sensor networks, where it dictates the accuracy of a targets position and is measured. This paper discussed the target tracking problem in a mobile sensor network (MSN), where it is assumed that mobility can be broken to improve the tracking resolution. This problem becomes challenging as the mobility and trajectories of both sensors and targets are to be captured. It is derived the inherent relationship between the tracking resolution and a set of crucial system parameters including sensor density, sensing range, sensor and target mobility. Investigation is made for the correlations and sensitivity from a set of system parameters and derived the minimum number of mobile sensors that are required to maintain the resolution for target tracking in an MSN. The simulation results show that the tracking performance can be improved by an order of magnitude with the same number of sensors when compared with that of the static sensor environment.
      PubDate: 2014-10-05
      Issue No: Vol. 3 (2014)
       
  • Security and Privacy in the Context of the Public Clouds

    • Authors: Chikkam Naga Venkata Prakash, Sudhir Varma Sagiraju
      Abstract: The present perspective on the confidential data hosted in the cloud is based on fine-grained encryption of the data. Under such approaches, data owners are in charge of encrypting the data before uploading them on the cloud and re-encrypting the data whenever user credentials or authorization policies change. Data owners thus incur high communication and computation costs. In order to minimize the overhead at the data owners, while assuring data confidentiality from the cloud, a better approach should be implemented to enforce the secured access control to cloud. We propose an approach, based on two layers of encryption that addresses such requirement. Under this approach, the data owner performs a one layer encryption, and whereas the cloud performs a second layer of encryption on top of the owner encrypted data. We use an effective group key management scheme for encryptions. Our approach provides secrecy of the data and maintains the privacy of the user from the cloud while accessing the cloud.
      PubDate: 2014-10-04
      Issue No: Vol. 3 (2014)
       
  • Key managing for data transfer to remote cooperative crews

    • Authors: Mukkiri Kalyan Srinivas, Ramanjaneyulu T, S.Maruthu Perumal
      Abstract: The problem of efficiently and securely broadcasting to a remote cooperative group occurs in many newly emerging networks. A major challenge in devising such systems is to overcome the obstacles of the potentially limited communication from the group to the sender, the unavailability of a fully trusted key generation center, and the dynamics of the sender. The existing key management paradigms cannot deal with these challenges effectively. In this paper, we circumvent these obstacles and close this gap by proposing a novel key management paradigm. The new paradigm is a hybrid of traditional broadcast encryption and group key agreement. In such a system, each member maintains a single public/secret key pair. Upon seeing the public keys of the members, a remote sender can securely broadcast to any intended subgroup chosen in an ad hoc way. Following this model, we instantiate a scheme that is proven secure in the standard model. Even if all the nonintended members collude, they cannot extract any useful information from the transmitted messages. After the public group encryption key is extracted, both the computation overhead and the communication cost are independent of the group size. Furthermore, our scheme facilitates simple yet efficient member deletion addition and flexible rekeying strategies.
      PubDate: 2014-10-03
      Issue No: Vol. 3 (2014)
       
  • Providing Data Confidentiality of Outsourced Data In Cloud

    • Authors: N_V_S Sowjanya, S.N.S.V.S.C Ramesh, S.Rama sree
      Abstract: Cloud means collection of storage servers maintained by the cloud service provider which minimizes investment cost for individual users and organizations. It provides on-demand self service, resource pooling, rapid elasticity and measured service. But users are worrying about their data confidentiality stored in untrusted cloud servers. Storing data in a third party’s cloud system causes serious concern over data confidentiality. In order to provide strong confidentiality for messages in storage servers, a user can encrypt messages by a cryptographic method before applying an erasure code method to encode and store messages. Constructing a secure storage system that supports multiple functions is challenging when the storage system is distributed and has no central authority. The proposed method is a proxy re-encryption scheme which was integrated with a decentralized erasure code such that a secure distributed storage system is formulated. The distributed storage system not only supports secure and robust data storage and retrieval, but also lets a user forward his data in the storage servers to another user without retrieving the data back. The main technical contribution is that the proxy re-encryption scheme supports encoding operations over encrypting messages as well as forwarding operations over encoded and encrypted messages.
      PubDate: 2014-10-03
      Issue No: Vol. 3 (2014)
       
  • UM: A Novel Seclusion Model for Defending Structural Information of Social
           Network Data

    • Authors: N Nalini Krupa, CH.S.V.V.S.N Murty
      Abstract: Publishing or sharing the social network data for social science research and business analysis lack of privacy. Existing technique   k-anonymity is used to prevent identification of micro data. Even though an attacker may gaining sensitive data if a group of nodes largely share the same sensitive labels. We propose an algorithm, universal –match based Indirect Noise Node which makes use of noise nodes to preserve utilities of the original graph. Finally that technique prevents an attacker from reidentifying a user and finding the fact that a certain user has a specific sensitive value.
      PubDate: 2014-10-03
      Issue No: Vol. 3 (2014)
       
  • A Novel Method for Crawl Forum Threads

    • Authors: CH V N Krishna Murthy, V Chandra Sekhara Rao
      Abstract: In internet crawler it is program that visits websites and reads their pages and other information in order to create entries for a search engine index. Now we introducing forum crawler which traverses the web forums. But present crawlers are not providing relevant content as well as URL type reorganization problem to forum users. In order to overcome this problem we present Forum Crawler under Supervision which crawl relevant forum content from the web with less overhead
      PubDate: 2014-10-03
      Issue No: Vol. 3 (2014)
       
  • Scattered Access Control with Seclusion Support in Wireless Sensor
           Networks by SecureQ Protocol

    • Authors: N_V_R_D Swathi, K Naga Bhargavi
      Abstract: A wireless sensor Network consists of spatially dispersed self-directed sensors to monitor the environment conditions. This work supports in-network top-k query process over uncertain data in a distributed wireless sensor network. We develop the notion of necessary Set for efficient in-network pruning of uncertain data in a distributed setting. Based on the   necessary sets, we propose, necessary set-based, algorithm for in-network processing of PT-Topk queries in a two-tier hierarchical sensor network. For providing privacy proposing locked Q protocol that prevents attackers from gaining information from both sensor collected data and sink issued queries
      PubDate: 2014-10-03
      Issue No: Vol. 3 (2014)
       
  • CDPP: Inter firewall Rules Redundancy Detection In Firewall

    • Authors: K Jyoyhirmayi, Sadineni Neelima
      Abstract: Firewalls playing very important role to provide security to private networks and organizations. . But the firewall policies cannot be communal across domains because it contains confidential information and security holes also, which leads to various attacks by attacker. In this project, we propose the cross-domain privacy- preserving cooperative firewall policy optimization protocol and a rule-based segmentation technique. Specifically, for any two adjacent firewalls belonging to two different administrative domains, our protocol can identify in each firewall the rules that can be removed because of the other firewall. The optimization process involves cooperative computation between the two firewalls without any party disclosing its policy to the other but firewall mainly depends on the quality of policy configured in the firewall. Designing and managing firewall policies are often difficult due to the complex nature of firewall configurations as well as the lack of systematic analysis mechanisms and tools. A rule-based segmentation technique to identify policy anomalies and provide effective anomaly resolutions.
      PubDate: 2014-10-03
      Issue No: Vol. 3 (2014)
       
  • AN ADVANCED ANTI PHISHING APPROACH BASED ON TWO-TIER VALIDATION

    • Authors: P P N G Phani Kumar, R John Mathew
      Abstract: Phishing on the web pages is an attempt by an individual or a group of hackers seeking to retrieve an individual’s personal private information such as passwords, usernames or confidential information, credit card information etc. In this paper, I am proposing a new approach named as “An Advanced anti phishing approach based on two-tier validation" to solve the problem of phishing. Anti-phishing schemes in the websites presently work on helping users to confirm whether a web site is honest or not. Image and OTP validation along with visual cryptography is a key advantage of this paper. The original image is divided into two blocks and rearrangement can be done and also a One Time Password will be generated. The use of visual cryptography technique((2,2) VCS scheme) is explored to reserve the privacy of image by degenerating the original image into two dissimilar image shares by manipulating the black and white pixel value of the image . Part of the image share and OTP will be stored in the servers such that the original image can be revealed only when both (client, server) of the shares are concurrently available. The individual share images do not reveal the identity of the original image . After the original image is revealed later merging different shares, which can be used as the first tier password and dynamically generated OTP can be used as password in the second tier. Dynamically generating the OTP by the system is one of the major advantages of the system.
      PubDate: 2014-10-01
      Issue No: Vol. 3 (2014)
       
  • A Novel Kind Of Dynamic Pattern Itemset In Consecutive Time Periods

    • Authors: B. Kiran Kumar, P.Bala Krishna Prasad, G.Guru Kesava Das
      Abstract: In Most itemsets mining is a widely popular technique that focuses on discovering recurrent correlations among data. The steadfast evolution of markets and business environments prompts the need of data mining algorithms to discover significant correlation changes in order to reactively suit product and service provision to customer needs. The discovery of frequent generalized item sets. First frequently occur in the source data and second provide a high-level abstraction of the mined knowledge issues new challenges in the analysis of itemsets that become rare and thus are no longer extracts from a certain point. This paper proposes a novel kind of dynamic pattern namely the History Generalized Pattern that represents the evolution of an itemset in consecutive time periods by reporting the information about its frequent generalizations characterizes by minimal redundancy in case it becomes infrequent in a certain time period.
      PubDate: 2014-10-01
      Issue No: Vol. 3 (2014)
       
  • Attribute Sparse Coding (ASC’s) for Content-Based Image Retrieval
           (CBIR)

    • Authors: Satish Kumar Koduri, V.Chandra Kumar
      Abstract: Photographs with individuals are the foremost attention of users. Consequently with the exponentially increasing pictures, large-scale content-based face image retrieval is a facilitating knowledge for various developing applications. The main objective is to apply automatically spotted human characteristics that comprise semantic cues of the face photos to increase gratified based face retrieval by creating semantic code words for effectual large-scale face retrieval. By leveraging human characteristics in a scalable and methodical framework, we suggest two orthogonal methods named attribute-enhanced sparse coding and attribute embedded inverted indexing to develop the face retrieval in the offline and online stages. The results illustrate that the proposed methods can attain up to 43.5% qualified enhancement in MAP associated to the existing methods.
      PubDate: 2014-10-01
      Issue No: Vol. 3 (2014)
       
  • UINN: Preventing Re identification Of Senstive Social Network Data

    • Authors: S. Jyothirmayee, N.Sujatha kumari
      Abstract: Publishing or sharing the social network data for social science research and business analysis lack of privacy. Existing technique   k-anonymity is used to prevent identification of microdata. Even though an attacker may gaining sensitive data if a group of nodes largely share the same sensitive labels. We propose an algorithm, universal –match based Indirect Noise Node which makes use of noise nodes to preserve utilities of the original graph. Finally that technique prevents an attacker from reidentifying a user and finding the fact that a certain user has a specific sensitive value.
      PubDate: 2014-10-01
      Issue No: Vol. 3 (2014)
       
  • Optimised Test suites with small Code Coverage In Software Testing

    • Authors: B V V Anusha, N. Naga Subrahmanyeswari
      Abstract: Testing is the process of evaluating a system or its components intended to find that whether it satisfies the specified requirements or not. Testing is executing a system in order to identify any gaps, errors or missing requirements in contrary to the actual desire or requirements. In this scenario test suites are generated it is also known as Validation suite which is a collection of test cases that are intended to be used to test a software program. But the problem is targeting one coverage goal at a time is not feasible and code coverage is also high. In order to overcome this problem generating new testsuites with the help of Evosuite tool which covering all coverage goals as well as coverage code is small.It meausured using code coverage and fundamental problemwith common apporach is coverage the goals and how an of  them are feasible.In this whole test suites are evovled covering all goals at same time.Its effectiveness not added by number of infeasible targets in code.It has a novel approach in approach Evosuote Tool and it achieved upto 188 times branch coverage in traditional approach targeting single branch strategy with upto 62% samaller test suites.In software testing many testsuites are used to debug a program to over come the testsuites Evosuite Tool was implemented to coverage goals as well as But the problem is targeting one coverage goal at a time is not feasible and code coverage is also high.In order to overcome this problem generating new test suites with the help of Evosuite tool which is covering all coverage goals as well as coverage code is small. 
      PubDate: 2014-10-01
      Issue No: Vol. 3 (2014)
       
  • Implementation of Trust Aware Routing Framework With Link Failure
           Consideration and Recovery

    • Authors: Prashant P. Rewagad, Satish Ramesh Suryawanshi
      Abstract: Wireless Sensor Network has now huge scope for research and application development but sensor networks are vulnerable to different attack. Hence security is key issue while using Sensor networks. Identity deceptions attacks are hard to detect attack. e.g. sinkhole attack, wormhole attack, Sybil attacks. Trust aware routing framework based on trust values of sensor nodes is proved effective for preventing Identity deception attacks. But DOS attacks or link failure conditions are not discussed in existing system. This paper focuses on the study behavior of Trust aware routing framework with backup path generation algorithm for link failure recovery. Link failure happens during packet routing results into packet loss. We have to recover that link failure and avoid packet loss and increasing packet delivery by using recovery phenomena of backup path generation for making routing framework robust.
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Survey on DLMS Adaptive Filter With Low Delay

    • Authors: Milna Tharakkal Johnson, S.K Mythili
      Abstract: Abstract-In practical applications of the LMS adaptive transversal filtering algorithm, a delay in the coefficient is updated. This paper discusses about the behavior of the delayed LMS algorithm. This paper present an efficient architecture for the implementation of a delayed least mean square adaptive filter .In order to achieve lower adaptation delay, a novel partial product generator is used .The convergence and steady state behaviors of the adaptive filter are compare and analyze.
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Performance Optimization in Wireless Channel Using Adaptive Fractional
           Space CMA

    • Authors: Pradyumna kumar mohapatra, Prabhat Ku. Dash, Jibanananda Mishra, Sunil Kumar Bisoi
      Abstract: In many high-data-rate band limited digital communication systems, the transmission of a training sequence is either impractical or very costly in terms of data throughput. Conventional LMS adaptive filters depending on the use of training sequences cannot be used. For this reason, blind adaptive channel equalization algorithms that do not rely on training signals have been developed. Using these “blind” algorithms, individual receivers can begin self-adaptation without transmitter assistance We present in this paper an multiple objective optimization approach to fast blind channel equalization. By investigating first the performance (mean-square error) of the standard fractionally spaced CMA (constant modulus algorithm) equalizer in the presence of noise, we show that CMA local minima exist near the minimum mean-square error (MMSE) equalizers. Consequently, Fractional Spaced CMA may converge to a local minimum corresponding to a poorly designed MMSE receiver with considerable large mean-square error. Also we presented multi channel  LTI representation of LTV channel.
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Logo Matching And Recognition System Using Surf

    • Authors: Remya Ramachandran, Andrews Jose
      Abstract: Matching is an important part of a model based object recognition system. Matching is a difficult task because images do not present perfect data, noise and occlusions greatly complicate the task. Although no existing visual system can solve the general recognition problem, some existing approaches have obtained acceptable results. Much less work has been done on parallel matching, despite the great need for speeding up the process. Some matching algorithms have been implemented using SIFT algorithm which is suitable in computer vision application. Here implemented a logo matching and recognition system using SURF algorithm. Using SURF descriptors extract the interest points from reference logo and test image. Then implement a model free context similarity function to find the similarity measure. Using the similarity measure find the matching between reference logo and test image. The performance is evaluated and compare the results with SIFT descriptors. SURF algorithm is better than the SIFT algorithm and will give better matching
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Improvement of PAPR and BER in OFDM Using Combination of SLM and Clipping
           Techniques

    • Authors: Govind Ravi Shankar Patidar, Madhvi Jangalwa
      Abstract: Orthogonal Frequency Division Multiplexing (OFDM) is high speed data transmission scheme. It has got various advantages like easy and efficient in dealing with multi-path, robust against narrow-band interference, supports various modulation schemes and perfect for MIMO etc. In spite of having various advantages it has got one major drawback of high Peak to Average Power Ratio (PAPR). One of the common technique for reducing the PAPR is Clipping, in this method a  threshold value of the amplitude is set and any sub-carrier having amplitude more than that value is clipped. Advantage of clipping is that PAPR reduction is obtained without any redundancy and no side information is needed to transmit. Another technique is Selective Mapping (SLM), where M number of random phase sequences are multiplied with the actual data  to be transmitted and out of M stream one stream is selected which have less PAPR, in SLM Bit Error Rate (BER) is improved compared to Clipping and SLM both. In this paper clipping and SLM both are combined to improve PAPR as well as BER. Simulation results show that PAPR and BER both are improved for combination as compared to clipping and SLM.  
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Novel Iris Recognition Techniques using Energy Compaction and Partial
           Energies of Transformed Iris Images with Cosine-Kekre and Cosine-Hartley
           Hybrid Wavelet Transforms

    • Authors: Sudeep Thepade, Pushpa Rajendra Mandal
      Abstract: The paper presents novel Iris Recognition technique using Energy Compaction and Partial Energies of transformed iris images with the Hybrid wavelet transform namely ‘Cosine-Kekre’ and ‘Cosine-Hartley’ Hybrid wavelet transform. These two Hybrid wavelet transforms are applied on the iris images to obtain transformed iris images from which the feature vectors are generated in five different ways. The feature vector with 100% energy considers all of the coefficients of the transformed iris images to generate the feature vector so the size of feature vector is very large, in Energy compaction based feature vectors only the coefficients that hold 99%, 98%, 97% and 96% of energy are considered. Use of Partial energy reduces the feature vector size to a great extent and also it leads to lesser number of computations. The results tested using generic iris image database consisting 384 iris images have shown performance improvement in partial energy percentages with reduced feature vector size as indicated by higher Genuine Acceptance ratios as compared to 100% energy consideration.
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • A New System To Filter Unwanted Content from OSN User Profiles

    • Authors: Thummaluru Pavan Kumar
      Abstract: Security and integrity on the data posted by the user in their social network account is became a hot issues by the researchers. There is a little provision to control this as well as to prevent to post unwanted data in their account. To fill the gap, in present system, we propose a system allowing OSN users to have a direct control on the texts posted on  user profile. This is achieved through a flexible rule depends on system, it performs all users to customize the filtering criteria to be applied to user profiles, and a Machine Learning-based soft classifier automatically labeling texts in support of text-based filtering.
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Routing Problem: MANET And Ant Colony Algorithm

    • Authors: Madhumita Dash, Madhusmita Balabantaray
      Abstract: Mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any centralized administration and the biggest challenge in MANETs is to find a path between communicating nodes .This paper shows the issues related to the adoption of MANET technology in real world situations drawing from the results from simulations. Biologically inspired techniques are employed to solve the problems of MANET routing. This paper study the Ant Colony based routing algorithms carried out by taking into consideration two of the most popular algorithms Ant based algorithms, Ant Hoc Net and the Ant Routing Algorithm (ARA) and also realizes the application of MANETs in real world applications by solving the problem of routing. The Ant Algorithm mimics the
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Design And Implementation of CMOS Adder Cell With Reduced Leakage Power
           Technique In 90nm Technology

    • Authors: J Manohar, Ch. Janardhan, K.V. Ramanaiah
      Abstract: Now-a-days Power consumption (or) power dissipation has becomes the most important criteria for  implementing  anyone  of  the  digital  circuit.  While  calculating  the  efficient  value  of  the  output  of  that particular digital circuit, we may use the concept of scaling. But, while increasing the scaling process there may be a loss of leakage current. Due to the leakage current the usage of power (power dissipation) is increased. For removing these kinds of leakage currents  we are going to use “power gating techniques”. The  adder  cells mainly  focus on reduction  of power  and increasing  of speed.  For mobile  applications,  designers  work within a limited leakage power specification  in order to meet good battery life. The designers apart from leveling  of leakage  current  to ensure  correct  circuit  operation  also  focuses  on minimization  of power dissipation.  Power  Gating  is one  such  well  known technique  where a sleep transistor is added between actual ground rail and circuit ground. The device is turned off during sleep mode to cut-off the leakage path. This technique results in a substantial reduction in leakage at a minimal impact on performance.  This paper will focus on reducing sub threshold leakage power consumption  and ground bounce noise during the sleep to active mode transition.  In the present paper we will propose low leakage 1 bit CMOS full adder circuit in 90nm technology with supply voltage of 1V. We will perform analysis and simulation  of various parameters  such as standby leakage power, active power, ground bounce noise and propagation  delay using Cadence Spectre 90nm standard CMOS technology
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
  • Abrupt Software Cost Estimation Technique Based on Basic Requirement

    • Authors: Sujan Chandra Sarker, Md.Mijanur Rahman, Md.Nazim Uddin
      Abstract: Software cost estimation is the process to measure the required effort and cost to build system. In the project management still it is one of the most difficult tasks. There is a lack of reliable estimation technique and remains on going challenge to software developer. Trustworthy estimation techniques give proper schedule, budget, effort, risk, resource. Software cost estimation more challenging to IT industry because of continuous changing resources and involvement of different customer. Both software project management and customer are suffering in this issue. In many cases it is necessary to estimate cost urgent for customer without advance requirements. Most of the estimation techniques develop based on details requirement. In reality customer wants to know the cost of the system immediately before giving them full requirement of the system. We are going to propose an Abrupt Software cost estimation technique based on basic requirement. The main focus of this model to calculate primary cost to solve immediate problem of cost needed to develop system. Our model calculates cost by considering parameters like feasibility study, basic requirement, time duration, risk management, project analysis and others. This model is flexible because estimated cost varies with change of requirement.
      PubDate: 2014-09-30
      Issue No: Vol. 3 (2014)
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2014