......

..

IJCTA-Volume 2 Issue 6/ November - December 2011
S.No
Title/Author Name
Page No
1
Survey on Visual backchannel for web events based on cloud computing
-Santhosh.kola,SanjibkumarNayak
Abstract
The cloud computing based Visual Backchannel for web based events as a novel way of following and exploring online conversations about events. Micro blogging communities, such as Twitter, are increasingly used as digital backchannels for timely exchange of brief comments and impressions during political speeches, sport competitions, natural disasters, and other large events. Currently shared updates are typically displayed in the form of a simple list, making it difficult to get an overview of the fast-paced discussions as it happens in the moment and how it evolves over time. In contrast, our Visual Backchannel design provides an evolving, interactive, and multi-faceted visual overview of large-scale ongoing conversations on Twitter. To visualize a continuously updating information stream, we include visual saliency for what is happening now.
1729-1736

  PDF

2
Graphical Simulation of N Queens Problem
-G. Murali, Sadia Naureen, Y.Abhigna Reddy, M.Swetha Reddy
Abstract
Graphical simulation is an attempt of predicting the aspects of behavior of some system by developing an approximate model of it. Simulations have great impact on education and in training. Simulation based learning is a practical way of learning of practices that involves building connections: connections among what is being learned and what is important to the actor and the situations in which it is applied.N-Queens problem refers to the problem in which one has to place N-Queens on an n*n chess board such that no queen is attacking the other, i.e. no two queens occupy the same row, column or diagonal. Here we use graphical simulation to view various solutions to N-Queens problem. The n-queens problem is implemented by using core java. The packages used in these implementations are java.awt, java.lang, java.applet.
The graphical simulation is used because n-queens problem is more complicated. It is easy for any system user or normal user to understand this problem by observing simulations. With the help of simulation the problem is explained very clearly and effectively. This will help in generating interest among perceivers because it has real time applications and will make learning better.
Key words: graphical simulation, n-queens problem,
1737-1741

  PDF

3
Remote Procedures Calls Implementing using Distributed Algorithm
-G.Murali,K.Anusha,A.Shirisha,S.Sravya
Abstract
Remote Procedure Call (RPC) is a powerful primitive used for communication and synchronization between distributed processes. RPC poses a problem that it reduces the amount of parallelism, because of its synchronous nature. This paper shows how simple processes can be used to find a way of avoiding a difficulty in this problem. The combination of blocking RPC calls and light-weight processes provides both simple semantics and efficient exploitation of parallelism.We will describe how two important classes of algorithms, branch and bound can be run in a parallel way using this RPC. The results of some experiments comparing this algorithms on a single processor discussed.
1742-1746

  PDF

4
Generation of new Fractals for SINE Function
-Rajeshri Rana,Yashwant Singh Chauhan, Ashish Negi
Abstract
The generation of fractals and study of the dynamicsof transcendental function is one of emerging and interesting field of research nowadays. We introduce in this paper the complex dynamics of sine function of the type {sin(zn )c}, where n 2and applied Ishikawa iteration to generate new Relative Superior Mandelbrot set and Relative Superior Julia set. Our results are different from those existing in the literature.
Keywords:Complex dynamics, Relative Superior Julia set, Relative Superior Mandelbrot set
1747-1754

  PDF

5
Performance Analysis of DYMO, LANMAR, STAR Routing Protocols
for Grid Placement model with varying Network Size

-Harish Shakywar,Sanjeev Sharma,Santoh Sahu
Abstract
A Mobile Ad hoc networks (MANETs) are self organized wireless networks which are able to connect on a wireless medium without the use of a infrastructure or any centralized administration. Due to the absence of infrastructure, nodes may move frequently and the topology may change dynamically. The mobile nodes perform both as a host and a router forwarding packets to other nodes. Routing in these networks is highly complex. Due to moving nodes, many routing protocols have been developed. Performance of each protocol is depending on their working in different conditions. In this paper a detailed simulation based performance analysis is performed on the mobile ad hoc routing protocols-Dynamic MANET ondemand (DYMO), Landmark Ad hoc routing (LANMAR),Source Tree Adaptive routing (STAR) in Grid placement model with varying network size using QualNet 5.0.1 simulator.
1755-1760


  PDF

6
Non-linear Filter for Digital Image De-Noising
-S. S. Patil
Abstract
This paper presents an outline for removing noise in digital images. We see that the real time images are get more corrupted while acquisition, processing and transmission. As we deal 98% of our daily work on real time application data. So to suppress noise and elimination of noise from real time images is a research area for the developers, that how to predict noise and to remove that one noise from the image. As the real time images deals with spatial domain area. So in this paper we present a non-liner filter that may used to detect and remove the noise from digital images. The proposed filter is implemented in MatLab. There are so many filters available in literature, some are used to remove substitutive noise and some for additive noise but no filter is used to reduce noise from real time images. So we give a spatial filter for digital image de-noising used for real time applications.
Keywords: Digital Noise, digital image, filters, mean filter, spatial-domain filter.
1761-1767

  PDF

7
Study the Micropolar Fluid Flow near the Stagnation on a Vertical Plate with Prescribed Wall Heat Flux
-Gitima Patowary,Dusmanta Kumar Sut
Abstract
This paper investigates the influence of the material parameter, buoyancy parameter and Prandtl number on the skin friction coefficient and the heat transfer rate at the surface on a steady, two dimensional flow of an incompressible micropolar fluid near the stagnation point on a vertical plate with prescribed surface heat flux in presence of a magnetic filed. The free stream velocity and the surface heat flux are assumed to be proportional to the distance from the stagnation point. Similarly transformation is employed to transform the governing partial differential equations to a set of ordinary differential equations. The effects of the material parameter, buoyancy parameter and Prandtl number on the skin friction coefficient and the heat transfer rate at the surface are discussed and the corresponding velocity, temperature and microrotation profiles are shown graphically. Both assisting and opposing flows are considered and it is found that dual solutions exist for both cases.
Key words: micropolar fluid, vertical plate, mixed convection, stagnation point flow, magnetic parameter, boundary layer, fluid mechanics, shooting method.
1768-1778


  PDF

8

 

Effect of Applied Magnetic Field on Pulsatile Flow of Blood in a Porous Channel
-Sarfraz Ahmed,Dusmanta Kumar Sut
Abstract
An approximate solution is presented to the problem of pulsatile flow of blood in porous channel in presence of induced magnetic field. The blood is assumed to be an incompressible Non Newtonian fluid. To reduce the equation of motion to an ordinary differential equation, a dimensionless variable is used. Numerical results were obtained for different values of the magnetic parameter, frequency parameter and Reynolds number. It is observed that when the magnetic parameter, the Hartmann number increases, the velocity as well as
magnitude of mass flux decreases. For non magnetic case the paper reduces to the problem investigated by Wang.
1779-1785


  PDF

9
A New Pattern Recognition Approach Based on Color Structure and Image Euclidean Distances
-Ravendra Singh,Niresh Sharma
Abstract
In this paper, we proposed an approach based on color structure and Euclidean distance method for pattern recognition. Pattern recognition is the task of deciding what is the structure of the image and check that it is similar to database images.In color structure we examine whole image pixel values and will showing the color clusters then after, we find a new distance for images called IMage Euclidean Distance (IMED) that based on Isomap method. After calculate the IMage Euclidean Distance of query image and database image then we can achieve the final result.
Keywords: MPEG-7, Image Processing, Object Analysis, Color Structure
1786-1789


  PDF

10
Dynamic Routing with Security Considerations
-G. Murali, D. Pavan, V.V. Rajesh Reddy,P. Bharath kumar
Abstract
Now-a-days one of the major issues for data communication over wired and wireless networks is the security. the past work is on the designs of cryptography algorithms and system infrastructures. Apart from that we
will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol(RIP) in wired networks and Destination-Sequenced Distance Vector(DSDV) protocol in wireless networks, without introducing extra control messages. A clear study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the results and to show the capability of the proposed algorithm. This algorithm is mainly proposed to improve the security and to overcome the limitations existing with the present cryptographic algorithms and protocols. Although some designs like IP security, Secure Socket Layer provide
essential security, they unavoidably introduce substantial overheads in the Gateway/Host performance and effective network bandwidths.
This routing protocol is compatible with the Routing Information Protocol which uses hop-count as its Routing metric. So there will be a limited number of hops
and data transmissions are done by selecting hops randomly in a network. This improves security as well as controls traffic in the network. So, the procedure also includes using the multipath routing to select the paths to be followed. It uses the randomization process for selecting the number of hops to be selected for transforming the data. The routing table in this algorithm is based on the well-known Bellman-Ford algorithm. So, this overcomes
the problems with security and traffic occurred with increase in the number of networks in these days.
Keywords— Secure socket Layer, Routing information protocol, Distance-Sequenced Distance Vector Routing, Bellman Ford Algorithm
1790-1794

  PDF

11
Cloud Computing and Online Operating System
-Mohit Jain,Mohd. Danish, Hemant Yadav
Abstract
HOW YOU DO FEEL WHEN YOU ARE USING THE SOFTWARE WITHOUT INSTALLING IT IN YOUR COMPUTER? Isn’t it miracle? Yes it is .Cloud computing makes it possible in today’s world. It saves your memory both primary and secondary because your data is on centralized data center located outside your house which is highly secure. It is not in your computer memory so that it can be accessed anywhere by you. It also saves money which you don’t need to buy any expensive hardware to access the particular software in your computer. Cloud computing is a highly scalable pay-per-use IT capabilities. Now a days, software is very much expensive which even MNC’s don’t want to purchase it due to various factors which is:-Not reliable, Highly expensive which is very costly to install it on 1000’s of computers, If any error occurrence it takes 1-2 days to solve which is a big loss for organization. SO, here is the simple solution i.e. cloud computing which makes organization more productive due to low cost of software with high-end features, highly reliable , low maintenance cost, problems solving immediately and Highly secure. KEYWORDS: PAY PER USE IT CAPABILITIES VIRTUALIZED IT RESOURCES SAAS PAAS IAAS MULTI-TENANCY
1795-1799

  PDF

12
Network Security Scanner
-G. Murali, M.Pranavi, Y.Navateja, K.Bhargavi
Abstract
Network Security Scanner (NSS) is a tool that allows auditing and monitoring remote network computers for possible vulnerabilities, checks your network for all potential methods that a hacker might use to attack it. Network Security Scanner is a complete networking utilities package that includes a wide range of tools for network security auditing, vulnerability Auditing, scanning, monitoring and more.Network Security Scanner (NSS) is an easy to use, intuitive network security scanner that can quickly scan and audit your network computers for vulnerabilities, exploits, and information enumerations. Vulnerability management is an on-going process that protects your valuable data and it is a key component of an effective information security strategy, which provides comprehensive, preemptive protection against threats to your enterprise security. N.S.S is built on an architecture that allows for high reliability and scalability that caters for both medium and large sized networks.
NSS consists of six modules. They are Host Scanning, Port Scanning, Pinging, NSLookup, Vulnerability Auditing and Trace route. NSS also performs live host detection, operating system identification, SNMP Auditing. Finds rouge services and open TCP and UDP ports.The ability varies to perform scanning over the network identifying the live hosts and guess the operating system of the remote hosts and installed programs into the remote hosts. Apart identifying the live hosts we could map the ports and list the services which are running in the host.
Keywords— Network Security Scanner, Host Scanning, Port Scanning, Pinging, NSLookup, Vulnerability Auditing, Trace Route.
1800-1805

  PDF

13
Semantic Search Engine: A Survey
-Anusree ramachandran, R.Sujatha
Abstract
The semantic search engines have some advantages on the web search engines from the users view. In this fast life everybody need the answer for their queries very fast .In this scenario semantic searching engines will be helpful. It deals with the actual meaning of the queries. The tremendous growth in the volume of data or the information lead the traditional search engines to get the answers syntactically correct but large in amount. That might be the reason to get into the semantic search engines which gives the selected results which the user searching for. So here in this paper, a survey is done about the semantic search engines to revel the promising features of the semantic search engines(SSE).It deals about the description of some of the best semantic search engines
1806-1811

  PDF

14
Design and Analysis of Software fault-Tolerant techniques for Softcore processors in reliable SRAM based FPGA
-Vatsya Tiwari,Prof.Pratap Singh Patwal
Abstract
This paper discusses high level techniques for designing fault tolerant systems in SRAM-based FPGAs, without modification in the FPGA architecture. Triple Modular Redundancy (TMR) has been successfully applied in FPGAs to mitigate transient faults, which are likely to occur in space applications. However, TMR comes with high area and power dissipation penalties. The new technique proposed in this paper was specifically developed for FPGAs to cope with transient faults in the user combinational and sequential logic, while also reducing pin count, area and power dissipation. The methodology was validated by fault injection experiments in an emulation board. We present some fault coverage results and a comparison with the TMR approach. Keywords- Fault-tolerance, FPGA.
1812-1819


  PDF

15
QOS Enhancement for OFDM System Using Queuing Theory and an Optimized Estimator
-P.V.N. Lakshmi, Prof.K.Ashok kumar
Abstract
To the problem of bit and power allocation in Orthogonal Frequency Division Multiplexing (OFDM) system, a novel framework was proposed which introduced the Game theory and a new algorithm was applied. Firstly, the power allocation problem was described as non-cooperative Game process. Secondly, combined with influences of required quality of service (QoS). In this paper, we propose a novel SNR estimation algorithm with game theory for wireless OFDM systems based on the reuse of the synchronization preamble and efficient channel allocation based on its service and arrival rates. The periodic structure of the preamble is utilized for the computationally efficient SNR estimation algorithm, based on the second-order moments of received preamble samples. The performance of the proposed algorithm is compared with the MMSE algorithm and two preamble-based algorithms found in the literature. It is shown that the proposed algorithm is robust against frequency selectivity and may therefore be used for sub channel SNR estimation. Throughput, route delay are also improved by using the proposed architecture.
Keywords-OFDM, Encoder, Mapper, IFFT, Cyclic Prefix & Multipath Channel, Multi-hop,
1820-1828


  PDF

16
Blind Channel Equalization Based On Constant Power Criterion
-D. Lalitha Kumari,S.Sreekanth, B.Janardhana Rao
Abstract
In present Digital communications, the transmission effects such as multipath propagation and limited bandwidth produces linear distortion in the emitted signal, causing Inter symbol Interferences at the receiver sensor output. To enable the recovery of input symbols, channel equalization is used. Channel equalization is used to compensate the distortion effects happening in the wireless channel.Various approaches were proposed for the equalization of digital communication channel to over come the interference effect. The prior knowledge based estimation algorithms found to be considerably suitable for fixed channel parameters, but with channel having varying effects these algorithms fail to estimate the channel efficiently. For estimation of channel without priori knowledge, blind channel estimation algorithms were proposed. The blind equalization techniques are mostly property restoral techniques, where the equalizer filter is updated to produce an output signal that recovers an a priori known property of the input signal. This project work realizes blind channel equalization for digital communication based on constant power criterion where the signal power is considered to the channel statistics. The proposed channel estimation algorithm is to be evaluated for accuracy factor with their existing counterpart for the performance evaluation. The proposed project work is to be implemented on Matlab tool for it’s functional verification.
1829-1836

  PDF

17
Understanding a Wireless Decentralized Check pointing Arrangement in QOS using MoG
-Thanmayee.T
Abstract
This paper deals with the understanding a wireless decentralized check pointing arrangement in QOS using MOG. Check pointing is more crucial in MOG systems than in their conventional wired counter parts due to host mobility. Dynamically, less reliable wireless links frequent disconnections and variation in mobile systems. The algorithms and protocols than we can take an adaptive protocol to reduce the overhead and leasing mechanism is for storage but have a problem that can overcome by synchronous snapshot algorithm is that we have rollback/recovery algorithm but have low communication, and storage overhead .The mutable checkpoints should be minimized. If we talk about a large scale super computing system with coordinated check pointing and rollback recovery. We have work fraction is relatively low correlated failures must be taken in to account. We can also see an NP-Complete problem, so these all problems can overcome by using an algorithm said to be as Reliability Driven (ReD). With ReD an MH simply sends its check pointed data to one selected neighboring MH, and also serves as a stable point of storage for check pointed data received from a single approved neighboring MH. Here ReD works to maximize the probability of check pointed data recovery during job execution. So we are going to implement one of them as NP-Complete problem can be solved by this we can see in future as Overview of Decentralized Check pointing Using QOS in MOG.
Index Terms- Checkpoint, Mobile Computing System, Recovery, Mobile Grid System.
1837-1842


  PDF

18
Fuzzy logic for Software Effort Estimation Using Polynomial Regression as Firing Interval
-J.N.V.R Swarup Kumar, Aravind Mandala,M. Vishnu Chaitanya,G.V.S.N.R.V Prasad
Abstract
The process of estimating the cost and time required to develop a software system is known as Software effort estimation. In software project decisions like resource allocation and bidding which are major parts of planning, software effort estimation plays a prominent role. The substratal goals of planning are to scout for the future, to diagnose the attributes that are essentially done for the consummation of the project successfully. So, the effective Software cost estimation is one of the most challenging and important activities in Software development. This paper introduces a new model using fuzzy logic to estimate the effort required in software development. MATLAB is used for tuning the parameters of famous various cost estimation models. On published software projects data, the performance of the model is evaluated. Comparison of results from our model with existing ubiquitous models is done.
Index Terms— COCOMO, Effort Estimation, Fuzziness, Fuzzy Logic, KLOC, Membership Function
1843-1847



  PDF

19
Multiple Features Subset Selection using Meta-Heuristic Function
-L. S. Maurya,Susheel Jain
Abstract
This paper is being presented on Multiple Features Subset Selection Using Meta-heuristic Function. Classification problems require selection of a subset of attributes or features from a much larger dataset to represent the patterns to be classified. Many excellent multiple feature selection method such as Hill Climbing (HC), Simulated Annealing (SA), Genetic Algorithms (GAs), Tabu Search (TS) has been prevalent amongst research community. However, these approaches still encounter when the multiple feature of dataset is available and it need to choose those attribute which is best amongst the available features.
So, in this paper basically considering the issue of multiple features are analyzed as well as implemented and tested on different dataset. The experiment is being conducted abalone dataset. It may conclude that the algorithm shows highest accuracy amongst all other method which is being used in this paper, Therefore we are focusing on the classification of multiple features
1848-1853

  PDF

20
Transform Coefficient Histogram and Edge Preserving Image Enhancement Using Contrast Entropy
-K. Sundar Srinivas,K. Naga Lakshmi Kalyani
Abstract
Enhancing an image in such a way that maintains image edges is a difficult problem. Many current methods for image enhancement either smooth edges on a small scale while improving contrast on a global scale or enhance edges on a large scale while amplifying noise on a small scale. Many applications of histograms for the purposes of image processing are well known. However, applying this process to the transform domain by way of a transform coefficient histogram has not yet been fully explored. This paper proposes three methods of image enhancement: a) logarithmic transform histogram matching, b) logarithmic transform histogram shifting, and c) logarithmic transform histogram shaping using Gaussian distributions. They are based on the properties of the logarithmic transform domain histogram and histogram equalization. The presented algorithms use the fact that the relationship between stimulus and perception is logarithmic and afford a marriage between enhancement qualities and computational efficiency. A human visual system based quantitative measurement of image contrast improvement is also defined. This helps choose the best parameters and transform for each enhancement. A number of experimental results are presented to illustrate the performance of the proposed algorithms.
Keywords— Transform Histogram, Contrast Entropy, Image Enhancement, Contrast Measure, Discrete transform (DCT, DFT), human vision system.
1854-1858


  PDF

 
pic
 
     
IJCTA © Copyrights 2010| All Rights Reserved.

This work is licensed under a Creative Commons Attribution 2.5 India License.