| International journal of Information Technology & Knowledge Management Volume-2, Number-2 |
| Home |
| About us |
| Author Instructions |
| Contact |
| Feedback |
1Akhilesh Tiwari, 1Rajendra K. Gupta, 2Dev Prakash Agrawal
1Madhav Institute Of
Technology & Science,
2Union Public Service
Commission, New Delhi, India, Email: amity.tiwari@rediffmail.com
Abstract
Data Mining is the process of extracting interesting and previously unknown patterns and correlations from huge amounts of data. Association rule mining, a descriptive mining technique of data mining is the process of discovering items, which tend to occur together in transactions. As the data to be mined is large, the time taken for accessing data is considerable. In this paper, a new association rule mining algorithm which generates the frequent itemsets in a single pass over the database is presented. The algorithm mainly uses two approaches for association rule mining: The Partition approach, where the data is mined in partitions and merges the result, and the Apriori approach that helps to find the frequent sets within each partition. In order to evaluate the performance of new association algorithm, it is compared with the existing algorithms which require multiple passes to generate the frequent itemsets. Experiments show that time taken for the database scan is more than the time taken for candidate generation when the database size is large, which provides evidence that, focus to decrease the database access time is a viable approach to the association rule mining.
Keywords: Association rule, Apriori, Data mining, Frequent itemset.
2. Modeling and Subtraction of Scenes
Exhibiting Constant Dynamic conduct in Video Sequence
Vivek Sharma [1], D.K. Swami[2], R.C. Jain [3]
[1] Ph.D student, VNS
Institute Of Technology Bhopal, r.g.T.U. bhopal (M.P.),
[2] Principal, VNS Institute Of Technology
[3]Director,
S.A.T.I., Vidisha, R.G.T.U. bhopal (Madhya Pradesh)
sharma.vivek95@yahoo.in [1], dksvns@ymail.com[2], jcr_dr@yahoo.com [3]
Abstract
Identifying moving objects is a critical task for many computer vision applications; it provides a categorization of the pixels into either foreground or background. A common approach used to achieve such categorization is removing background. There are many background removal algorithms in the literature, most of them pass through four major steps, which are pre-processing, background modeling, foreground detection and data validation. An important constituent of vision systems is background modeling. Existing work in background modeling has mostly addressed scenes that consist of stationary structures. But if the scene exhibits constant dynamic behavior in time, such an hypothesis is dishonored and detection performance deteriorates. We propose a method for the modeling and subtraction of scenes exhibiting constant dynamic behavior in time.
3. Performance Evaluation of MAC Protocols WLAN
Seema Nayak[1],
Gurmeet Singh [2], Amrita Rai [3]
[1] Electronics and
communication dept, Echlon Inst of Mgt.&Tech.
[2] Electronics and
communication dept, LIMAT
[3] Electronics and
communication dept, Lingaya’s University
Seema_jessica@rediff.com [1],
g_singh1gill@yahoo.co.in [2], amritaskrai@yahoo.com [3]
Abstract
Ad hoc wireless networks provide infrastructure-free communication, an efficient MAC protocol through which mobile stations can share a common broadcast channel is essential. Present medium access mechanism used are Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA), multiple access with collision avoidance (MACA) and CSMA/CA with RTS/CTS. These protocols are designed to reduce the collision probability between multiple stations accessing a medium. CSMA/CA with RTS/CTS and MACA use RTS/CTS exchange mechanism to reserve the channel. In this paper, First theoretical model of WLAN is developed and the maximum possible throughput is calculated. In later part of the paper, for the verification of theoretical mode, simulation environment is developed and detailed simulation is performed using GloMoSim simulator. Finally theoretical and simulation result are compared, which shows the variation of throughput with the variation of packet arrival rate and variation of average end to end delay with throughput.
Key Words- IEEE 802.11, CSMA, CSMA/CA, MACA, RTS/CTS, Performance Evaluation
4.
Comparison of Performance Analysis of Ad-hoc Routing Protocol
1Sweta
Verma , 2Dr. Vivek Kumar
1Research
Scholar ,
sweta_verma@yahoo.com
2 Prof.
Abstract
A mobile ad hoc network (MANET) is a
collection of wireless mobile nodes communicating with each other using multihop wireless links without any existing network infrastructure or centralized administration .To decide Routing protocols for ad-hoc networks is a great challenge.
Network throughput delay and packet delivery ratio are three important parameters in the design and evaluation of mobile ad hoc networks. In recent years, a variety of routing protocols targeted specifically where Pause time was constant. In this work, we make a comparison of three prominent protocols AODV, DSR and DSDV for mobile ad hoc network by varying pause time and
simulating them on NS2 [1].Various types of scenarios are generated and each of the protocol is simulated on each of these, then their parameters like
throughput, packet delivery ratio and delay will be compared The performance differentials are analyzed using varying pause time, constant nodes and dynamic topology. Based on the observations, we make valuable conclusions about which
protocol performs better in which condition.
Keywords: Destination Sequenced
Distance Vector, Dynamic Source Routing, Ad-hoc On-Demand Distance Vector Routing.
5. Efficient Image Encryption using MRF
and ECC
1Kamlesh
Gupta, 2Sanjay Silakari
1 RJIT,
2 UIT,
RGPV Bhopal, MP, India
kamlesh_rjitbsf@yahoo.co.in , ssilakari@yahoo.co.in
Abstract
In this era, network security has become an issue of importance, on which lot of research is going on. We have proposed a two level image encryption method using elliptic curve cryptography (ECC) which has been made more efficient by Markov random field (MRF). In this method a texture image generated using seed by MRF. This seed is use as secrete key that generated by elliptic curve method.XOR method are used to concealed original image with texture image, the mixed image pixel is encrypted using ECC for transmission. The resulting system gives comparatively small block size, high speed and high security.
Keywords: Elliptic curve cryptography (ECC), Markov random field, (MRF), Gibbs random filed (GRF)
6. Rapid Decision Making for Post Architectural
Changes in Agile Development – A Guide to Reduce Uncertainty
G.I.U.S. PERERA [1], M.S.D. FERNANDO [2]
Department of Computer Science and Engineering,
indikaperera@uom.lk [1], shantha@uom.lk [2]
Abstract
The interest on improving
software paradigms, to meet the rapid changing environments becomes a recent
and prime research area in Software Engineering. Agile software development was
emerged as a result of these studies. Agile practice is a customer oriented,
light-weight software development paradigm, suited best for small size
development teams in projects under vague and changing requirements. Especially
the Agile practice is famous among the open-source communities as it goes easily
along with the communities’ conventions. Having more flexibility is a better
attribute for a process, if it used by a competent experts who can take
productive decisions at right moments. However, depending too much on expert
knowledge to process and product adjustments is a questionable concern to a
growing project with rapid changes to its code base and releases. This research
was identified to prevail over this difficulty and provide a necessary guidance
to formulate reasonable decisions in the Agile process practice.
Keywords—Software
Process Improvement, Agile Process, Decision Uncertainty, Post Architectural
Changes.
7. Replacement of S/W Inspection with Software
Testing
Mitu
Kumari [1], Archana Sharma [2], Vipin
Kamboj [3]
Deptt. of Computer Science, Guru Nanak Khalsa
Institute Of Technology& Mngt. Studies, Yamuna Nagar, Haryana, India
mitu.kajal@gmail.com, asarchusharma@gmail.com, vipsmax@gmail.com
Abstract
The goal of software inspection and software testing is to reduce the expected cost of software failure over the life of the software product. In the case of inspections, the defect trigger is defined as a set of values that associate the skills of the inspector with the discovered defect. Similarly, for test scenarios, the defect trigger values embody the deferring strategies being used in creating these scenarios. Software inspection is the generic name for a set of cost-effective ways of evaluating user interfaces to find usability problems. They are fairly informal methods and easy to use. This paper investigates whether we can replace inspection with testing or not.
Key-Words: - Software Inspection, Software Quality, Verification, Reliability, Software Cost, Validation, Software Testing.
8. Combining the Classifiers and LSI Method for Efficient and Accurate
Text Classification
M.Srinivas, K.P.Supreethi, E.V.Prasad
Lecturer in CSE Dept, JNTUACE,
Assistant professor in
CSE Dept, JNTUHCE,
Professor, JNTUKCE,
sreenu2521@gmail.com, drevprasad@gmail.com,
supreethi.pujari@gmail.com
Abstract
Text classification involves assignment of predetermined categories to
textual resources. Applications of text classification include recommendation
systems. Personalization, help desk automation, content filtering and routing,
selective alerting, and training. This paper describes an experiment for
improving the classification accuracy of a large text corpus by the
use of dimensionality reduction and multiple-classifier combination
techniques. Three different classifiers have been used namely Naive Bayes,
Decision Tree and Association rule mining. The results of these classifiers
are combined using techniques such as Simple Voting, Weighted Voting and
Probability-based Voting. The classification accuracy is further improved by
the use of a dimensionality reduction method called Latent semantic indexing
(LSI). Experiments conducted on the Reuters 21578 dataset indicate that
the combination approach provides an improved and scalable method for text
classification. Also, it is
observed that concept indexing helps with classification accuracy in addition lo efficiency and scalability.
9. A Review of Knowledge Based Systems
in Medical Diagnosis
Mrs. S.S.Gulavani & R.V. Kulkarni
drrvkulkarni@siberindia.co.in, sampadagul@yahoo.in
Abstract
Knowledge based system incorporates the expert knowledge that has been coded into facts, rules, heuristics and procedures. The power of expert system resides in the specific, high-quality knowledge about task domain. Knowledge is stored in a knowledge base where it is possible to add new knowledge or refine the existing knowledge without recompiling the control and inference programs. Sophisticated expert systems can be enhanced with additions to the knowledge base or to the set of rules. Medical diagnosis is one of the first knowledge based area to which Expert System technology was applied. The primary objective of the paper is to survey the research work accomplished in the field of medical sector.
Keywords: Knowledge, Knowledge Based Systems, rule based system, Expert Systems, Inference engine, Knowledge Engineer.
10. Analysis and Design of Core Metrics for Modern
Software Projects
K. P. Yadav, Asstt. Prof. ,
Raghuraj Singh, Prof. & Head,
Deptt. of CSE, H.B.T.I.,
karunesh732@yahoo.co.in, raghurajsingh@rediffmail.com
Abstract
Size
measurement methods have played a key role in helping to solve real-world
problems of estimating, supplier/customer disputes, performance improvement and
the management of outsourced contracts. We would like to say that estimating
and managing a project’s effort, staffing, schedule, cost, risks, quality and
other factors is crucial. Yet all these are measures of input. Process management is enabled by feedback loops. So it
is also necessary to measure the output from the software process. This starts with measurement of the size of the
requirements. To solve a problem, it is necessary to measure its size, in order
to assess the various solution options, calculate the relative costs, compare
the benefits, before finally committing to one preferred approach.
11. Self Checking and Fault Tolerant Digital Design
Y.RAJASREE , Y.VISHNU PRIYA and
Dr.N.R.ALAMELU
Sridevi Women’s
rajasreey@yahoo.com http://www.srideviengg.com
Abstract
During the process of development of any system, system reliability is of utmost importance .Specially when designing a processor, it is desired that a processor function correctly even in the presence of faults .This concept is commonly referred to as fault tolerance. The fault tolerant microprocessor systems used in safety critical applications need to be thoroughly validated during the design stages. As feature size reduces in future, there is an increased probability of transient and intermittent faults. Now these systems on chip integrated circuits contain both digital and analog cores. Test cost for such mixed signal SOC is much higher than the digital SOC that allows the analog and digital cores to be tested. The analog cores are wrapped such that the test can performed using a digital test access mechanism .In our method , an analog test infrastructure is used which consists of test wrappers and test access mechanism. Test wrappers isolate various modules from their surrounding circuitry during test .So the focus is on optimisation of a unified test access architecture that is used for digital and analogue cores. We wrap each analog core by a pair of digital to analog converter and analog to digital converter .They convert analog core to virtual digital core which allow the use of digital testers to test the analog cores. This reduces the need for expensive mixed signal tester so that there is a reduction in the overall cost.
Key-Words: Fault, Multiplier,
Adder, wrapper, carry, ADC.
12.
Pattern Matching with External Hardware for Steganography Algorithm
Bawankar Chetan D.[1], Hande
K.N.[2], Jaiswal A.A.[3], Bute.A.[4]
[1]IV Sem M.Tech.
[2]Assistant Professor, P.G. Dept. of CSE.
[3][4] Dept. of CT,
chetan251@rediffmail.com[1], kapilhande@gmail.com[2], ajayjaiswal@yahoo.com[3], anant_bute@yahoo.com[4]
Abstract
Many steganography
techniques are extremely vulnerable to attacks and even detection of
information in image is quite easy. This paper proposes a new authentication,
verification technique, which prevent from the steganographic attacks. The main
idea is to use a prioritized sub blocks by pattern matching scheme to embed the
code and a microcontroller used for sake of security where it transmits a pre-programmed
key at the beginning of each process. The steganalysis algorithm continued only
if the received key is correct at the destination otherwise retrieving secure
information from cover image is not accomplished.
Keywords–Authentication, Pattern matching, Steganography Attacks.
13. AMNI’09 PROTOCOL
B.Amutha [1], V.Nivedha Devi [2]
[1] Research Scholar, Computer Science,
[2] Ii M.Tech, Computer Science,
bamutha62@gmail.com [1], nivedha.v@gmail.com [2]
Abstract
This protocol is used to maintain security in networks for secure communication by overcoming some of the drawbacks in existing security protocols. Integration of both classical and quantum cryptography techniques takes place. Quantum cryptography is used for secure optical transmission which employs quantum mechanisms to distribute session keys Classical cryptography provides convenient techniques that enable efficient key verification and user authentication. This protocol used both implicit user authentication and explicit mutual authentication. A Trust centre is used to generate a secret key and public key by using RSA algorithm and it will develop the random key for each session of transmitting data these key develop a QUIBIT values which develop Session key. By using these keys user translate the messages between the other users securely. Error rate gets reduced when compared to the existing quantum cryptography protocol. Bayesian filtering method is integrated to reduce the external noise. The merits of this new protocol are (i) Secures against attacks as man-in-the-middle, eavesdropping and replay (ii) Online guessing attacks can be avoided (iii) Efficiency is more since the proposed protocol contain the fewest number of communication rounds (iv) Two parties can share and use a long-term secret key by a trusted center (v) Error due to noise gets reduced.
Key-Words: quantum cryptography, classical cryptography, RSA, session key, Bayesian
Filtering, noise, error rate, eavesdropping.
14. Combined Classifiers in Recognition of
Handwritten Kannada Numerals: A Hybrid Approach
Dinesh Acharya U[1], N V Subbareddy[2] And
Krishnamoorthi[3]
Department of Computer Science and Engineering,
Manipal Institute of Technology,
dinesh.acharya@manipal.edu[1],nvs.reddy@manipal.edu[2].k.moorthi@manipal.edu[3]
Abstract
The recognition of handwritten numeral is an important area of
research for its applications in post office, banks and other organizations.
This paper presents automatic recognition of handwritten Kannada numerals using
both unsupervised and supervised classifiers. Four different types of
structural features, namely, direction frequency code, water reservoir, end
points and average boundary length from the minimal bounding box are used in
the recognition of numeral. The effect of each feature and their combination in
the numeral classification is analyzed. Combining
classifiers has proved to be an effective solution to several classification
problems in pattern recognition. In the image classification, it is often
beneficial to consider each feature type separately, and to integrate the
initial classification results by a final classifier. In this paper, we
developed a robust hybrid approach where
fuzzy k-Nearest Neighbor (fuzzy k-NN) and
fuzzy c-means(FCM) as base classifiers for individual feature sets, the results
of which together forms the feature vector for the final k-Nearest Neighbor (k-NN) classifier. Testing
is done, using different feature sets, individually and in combination, on a
database containing 1600 samples of different numerals and the results are compared with the different existing methods.
Key Words: - Structural features, Numeral Recognition, Fuzzy k Nearest Neighbor, Fuzzy c-means, Multiple Classifiers, Classification Result Vector.
15. An Efficient Technique to Digitize Polygon Segments
of a Map/ Image (ETDPS)
P. Halder1, G. Chatterjee2, J. K. Mandal3,
1,2,3 Department
of Computer Science and Engineering,
4 Department
of Electrical Engineering,
Abstract
A GIS tool has been proposed where the whole border of a closed section of a black and white map is digitized using a single click inside the section (instead of moving the mouse pointer along the border of the section). The boundary point of a segment contains similar RGB values (black, RGB value -16777216). When one inner point of a closed segment is selected by the mouse the program calculates the RGB value (which is not black) and stored in an array say inner array. Fetching elements from the inner array the program calculates the RGB values of the eight connected pixels. If the pixels are black then stored into another array say boundary array. Other points are stored into the inner array. The elements which are fetched must be removed from the inner array. The fetching and comparing RGB values of the eight connected pixels are performed until the inner array becomes vacant. When the inner array becomes empty the boundary array contains the boundary pixels. Thus boundary pixels are identified. The array elements of boundary array are arranged in a cyclic order to generate the proper boundary of the polygon object.
Keywords: GIS, Vector Map, Raster Map, Digitization, Spatial data.
16. Fuzzy Echelon– A Tool for Inventory
Control in Supply Chain
Dharamvir Mangal [1], Kiran Jhamb [2]
[1] Lecturer, Mechanical Engineering Department, The
Technological
[2] Assistant professor, Mechanical Engineering
Department N.C. College Of Engineering And Technology, Israna,
mangaldharamvir1@rediffmail.com [1], kiran_jhamb1@rediffmail.com [2]
Abstract
The inventory management policies in a supply chain can be classified according to the criterion i.e. optimization goal, centralized or decentralized control, inventory control frequency, temporal information requirements and spatial information etc. In many industrial sectors, firms are dealing with a demand which is more and more uncertain often due to the supply chain structure. One of the most critical effects of demand uncertainty is the simultaneous increase of inventories and decrease of customer service. To properly model uncertainty several aspects need to be addressed: the causes of uncertainty, the characteristics of both the available (input) and required information (output), and the scale level of the numerical information. So this paper has addressed two key issues of inventory management in SCs, namely the uncertainty associated with market demand and inventory related costs and the need of a tight integration among the SC stages. In particular, a methodology has been proposed to define global inventory management policies that are both easy to be implemented and near optimal for the whole SC. The methodology addresses uncertainty through fuzzy set theory, which is more appropriate than stochastic techniques to deal with market demand and inventory related costs, especially when the environment (e.g. the market) is complex and turbulent. The need of integration is taken into account by the adoption of the echelon concept to measure inventory and the holding costs. The contribution of fuzzy set theory for dealing with uncertainty has been discussed under a theoretical perspective, pointing out its appropriateness to model market demand and inventory costs.
Keywords: Supply chain management, Inventory management, Echelon stock, Fuzzy set theory.
17. A Refined New Model for Efficient
Explicit Congestion Reduction in High Traffic High Speed Networks Through
Automated Rate Controlling
K. Satyanarayan Reddy [1], Lokanatha C. Reddy [2]
[1] Research Scholar, Dept. of CS, School
of Science & Technology, Dravidian University, Kuppam-517425, A.P., India.
[2] Professor,
Dept. of CS, School of Science & Technology, Dravidian University, Kuppam-517425, A.P., India.
ksatyanreddy@yahoo.com [1], lokanathar@yahoo.com [2]
Abstract
The Transmission Control Protocol (TCP) suffers from poor performance on high bandwidth delay product links meant for supporting data transmission rates of multi Gigabits per seconds (Gbps). During congestion, the TCP’s congestion control algorithm reduces the congestion window cwnd to ½ and enters additive increase mode, which proves to be slow in taking advantage of large amounts of available bandwidth. In this paper a refined new model, to overcome the drawbacks of the TCP protocol, has been presented. We propose to carry out a study of the refined new model based on various parameters viz., Throughput, Fairness, Stability, Performance and Bandwidth Utilization for supporting high data transmission rates across the High Speed Networks.
Keywords: Congestion Control, High Speed Networks.
18.
Performance Improvement of Digital Fir Filter Using Hardware/Software Co-Design
Methodology
Meghana A. Hasamnis, Dr. Rajesh S.
Pande, Dr. S. S. Limaye
Assistant Professor, Department Of Electronics
Engineering, Srknec,
Professor, Department Of Electronics Engineering,
Srknec,
Professor, Department Of Electronics Engineering, Jit,
meghanahasamnis@rediffmail.com,panderaj@yahoo.com,shyam_limaye@hotmail.com
Abstract
Finite Impulse Response (FIR) filter is the key functional block in
Digital Signal Processing. A number of implementations can be found in public
literatures either by Hardware or Software solutions. Our aim is to design
Digital FIR filter and apply the concept of Hardware/Software Co-Design. For
implementing the concept of co-design, we have to partition the system into
hardware and software and then check the result for co-design of Hardware and
Software. Our main focus is to reduce the simulation time required that can be
achieved using Hardware/Software Co-Design. Our Hardware part will be FPGA
implementation of FIR filter using VHDL (VHSIC Hardware Description
Language).We target our devices to Xilinx Virtex V. Our software part will be
implementation of the same filter in C Language. In order to attain high
performance Digital FIR Filter is implemented with Codesign Concept.
Keywords- Hardware/Software Co-Design, Digital FIR
Filter, VHDL Simulation, C Coding.
19. Confidence Analysis for Fuzzy Multi
Criteria Decision Making Using Trapezoidal Fuzzy Numbers
[1] G. UTHRA, [2] R. SATTANATHAN
[1] RESEARCH SCHOLAR,
[2] READER & HEAD, DEPARTMENT OF MATHEMATICS,
Email: uthragopalsamy@yahoo.com[1],
rsattanathan@gmail.com[2]
Abstract
Multi criteria decision making (MCDM) deals with parameters which lack proper measurement scale, and are depicted using some linguistic parameters. In this paper, a general Fuzzy multi- criteria decision making problem (FMCDM) is introduced. Then confidence analysis of FMCDM is performed using trapezoidal fuzzy numbers by linguistic approach to model the decision maker’s attitude. The approach is illustrated by a numerical example.
Key words: Multi criteria decision making, linguistic variable, Trapezoidal Fuzzy Numbers.
20. Investigations of the Phonemes in the Calls of
Little Owls Using Vector Quantization
RANDHIR SINGH [1], PARVEEN
LEHANA [2] AND GURPADAM SINGH [3]
[1] ECE DEPT.,
SRI SAI COLLEGE OF ENGINEERING AND TECHNOLOGY, BADHANI (PATHANKOT),
[2] DEPARTMENT OF PHYSICS AND ELECTRONICS,
[3] ECE DEPT.,
BCET, GURDASPUR,
er_randhir81@rediffmail.com[1], lehana@iitb.ac.in[2], gurpadam@yahoo.com[3]
Abstract
Birds have developed excellent capabilities of using vision and hearing senses. Their temporal resolution is 10 times better than us. This allows more information to be communicated in lesser time. Bird’s sounds can be divided into four categories: chip notes, calls, songs, and composite sounds. The vocal apparatus in birds consists of an oral cavity, larynx, trachea, syrinx, and lung system. The vocal tract above the larynx is very short and effectively terminates at lateral edges of an open beak. The bird larynx consists of muscular folds whose aperture can be regulated to prevent food particles from entering the respiratory system during ingestion. During vocalization the acoustic tube formed by vocal tract above and trachea below can be constricted at larynx by the action of laryngeal muscles. Trachea is terminated below by a special sound producing organ called as syrinx. It is clear that basic structure of sound production mechanism of birds is similar to that of human beings. As the human beings is composed of small units called phonemes, the bird’s calls can also be assumed to be made of small units. The objective of this paper is to investigate the number of phonemes present in the little owl’s calls. Scope of this research is limited to only the sounds of little owl because of their special nature to communicate during noiseless environment. This may modify their adaptation with respect to phonemes.
Key-words: Bird’s sounds, bird’s calls, little owl’s calls, call’s types, chip notes.
21. Role of Testing In Phases of SDLC and Quality
Youddha Beer Singh [1],
Shivani Goel [2]
youdhhabeersingh@gmail.com
[1], Shivani@thapar.edu[2]
CSED,
Abstract
Software testing is an important technique for assessing the quality of a software product. In this paper, various types of testing and various attributes of software quality are explained. Identifying the types of testing that can be applied for checking a particular quality attribute is the aim of this research paper. All types of testing can not be applied in all phases of software development life cycle. Which testing types are applicable in which phases of life cycle of software development is also summarized.
Keywords: Quality attributes, Phases of SDLC, Testing technique, Static attributes, Dynamic
attributes
22.
Comparison of Domain Analysis Methods in Software Reuse
Aman Jatain[1], Shivani Goel[2]
Jatain.aman8184@gmail.com,
shivani@thapar.edu
Computer science and Engineering Department,
Abstract
Domain analysis is recommended by many in the reuse research as a main process for achieving successful reuse. Domain analysis is accomplished by reengineering techniques and domain analysis methods. Domain analysis is the process of identifying, collecting, organizing and representing the relevant information in a domain based upon the study of existing systems and their development histories, knowledge captured from domain experts and emerging technology within a domain. This paper discusses some generally used domain analysis methods. After studying many domain analysis methods some criteria has been found based on which we compared domain analysis methods. Paper discusses the domain analysis methods that share the same objectives: analyzing the domain and developing domain models. However each technique defines a particular way of understanding the domain and capturing domain information as domain models. In general the process, the product and supporting tools, can characterize a domain analysis method. At the end we summarized methods according to their use in various domains
Keywords: Domain, Domain Analysis, FODA, JODA, ODM, DADP, DSSA, Software Reuse, Domain Model, Commonalities, Variability’s.
23. Bioinformatics Toolkit for Cellular
Activities in Biological Systems
Jayanthi
Manicassamy [1] and P. Dhavachelvan[2]
Department of Computer Science,
jmanic2@yahoo.com, dhavachelvan@gmail.com
Abstract – Cells are complex systems which are networked together, residing in biological systems. A number of metabolic reactivity that occurs within the cells, which in turns the cells response. Improper cells signaling are the main causes for disease and disorders in biological systems so, it is necessary to understand the systematic organization of cells and its activities. There is lack of formal guidelines and constructive opposition to cell research which helps researchers for further disease identification and in drug discovery. Since, scientists have not yet been able to fully map cells and its functionalities, which are very sensitive and under research this made systems biology researchers in cells to lack behind. In this perspective, understanding and representing the entire activities of the cells at system level involving, cells networking pathways and its signaling is a novel way that have been incorporated in this paper. Since today there is a necessity for development of high throughput tools for effective and efficient representation of system activities. CABS aims at representing cellular activities in biological systems in graphical manner for various species. Primarily, representing human biological system cellular reactivates for cancer has been made. Network connectivity of the cells by means of pathway and signaling are done mainly taking disease reactivity or symptoms into consideration in the body. Internally certain metabolic behaviors have also been consideration for representing cells connectivity and communications. Cellular activities including pathway construction and cells signaling in reactive to the environment to the immune system have also been represented. Utilization of this tool will help the researchers for carrying out further research in this area of system biology.
Keywords
- Bioinformatics, Cell Biology, Databases, Information retrieval, Molecular
Biology, Performance Evaluation, Systems Biology, Web-Based tool.
24. A Case Study of Fault
Tolerant Routing Mechanism for Torus Embedded Hypercube Interconnection Network
for Parallel Architecture
N. GOPALAKRISHNA
KINI, M. SATHISH KUMAR, MRUTHYUNJAYA H.S.
[1] Dept. of
Computer Science and Engineering, Manipal Institute of Technology, Manipal
University, Manipal, Karnataka, INDIA
[2]
[3] Dept. of
Electronics and Communication, Manipal Institute of Technology (
ng.kini@manipal.edu , mskuin@yahoo.com , mruthyu.hs@manipal.edu
Abstract
This paper describes a fault-tolerant routing mechanism to facilitate data routing in Torus embedded hypercube interconnection network subject to node failures in parallel computing. It is shown that by only using feasible paths routing can be substantially simplified. Though there are algorithms for fault tolerant communication in torus and hypercube networks, there exits no efficient algorithm for the embedded architecture. We present an algorithm to provide an efficient fault tolerant routing mechanism for a (2, 2, 8)-Torus embedded hypercube interconnection network.
Keywords: Hypercube
network, Torus network, Embedded network, Torus embedded hypercube network,
Fault tolerance, fault list, routing.
25. Performance Evaluation Of Memory Mapped Files with Data Mining Algorithms
S.N. Tirumal Rao+ E.V. Prasad* And N.B. Venkateswarlu# +
Dept of C.S.E, Rao & Naidu Engg. College,
Ongole,
Email: naga_tirumalarao@yahoo.com
*J.N.T.U.C.E,
# AITAM, Tekkali, A.P,
ABSTRACT
The concept of memory mapped files is widely
supported by most of the modern operating systems. A study is carried out with
computationally intensive applications such as data mining, to see the benefit
of this concept over the conventional file I/O which calls standard library function fread( ).
Experiments are carried out in memory mapping with both simulated and real
data. The observations indicated that the memory mapping based versions taking
less CPU time compared to fread() based ones.
Key Words: Memory Mapping,
Virtual address space, mmap(), fread(), Data Mining, Clustering.
26. Analysis of Power
Dissipation in Dram Cells Design for Nano-Scale Memories
Balwant Raj1, Anita Suman2 and Gurmohan Singh3
1. M.tech Student,
2. Lecturer,
3. Design Engineer, CDAC
Mohali.
balwant78@yahoo.co.in
Abstract
In this paper
power dissipation analysis for DRAM design have been carried out for the
Nanoscale memories. Many advanced
processors now have on chip instructions and data memory using DRAMs. The major
contribution of power dissipation in DRAM is off-state leakage current. Thus,
improving the power efficiency of a DRAM cell is critical to the overall system
power dissipation. This paper
investigates the effectiveness of combination of different DRAM circuit design
techniques power dissipation analysis. DRAM cells are designed both with the
semantic design technique and layout design technique for the comparison of
power dissipation using TANNER CAD Tool. From the results it found that layout
technique dissipate less power as compare the semantics technique of DRAM
cell.
Keywords: Power
dissipation, Low Power, DRAM, Layout
and SPICE circuit design.
27. Growth of Tax
Revenue in
Dr. Arti Gaur
Lecturer,
Department of Business Administration
Ch.
Devi Lal University, Sirsa-125055
Abstract
Taxation is a major source of revenue to the Govt. It has been an important instrument for
economic transformation and socio-economic cohesion. Indirect taxes constitute a greater proportion
of govt. revenue and the share of direct tax is also increasing over the
years. In the post reform era, the tax
policy has shifted from indirect taxes to direct taxes with more focus on
taxation on income of individuals and corporates than production and service
sector. In 1990-91, less than one fifth
of the center’s gross tax revenue is contributed by direct taxes. The main objective of the research is to
study the growth of tax revenue in
28. Customer
Satisfaction Regarding Home Loans- A Comparative Study of ICICI Bank and SBI
Bank
Dr.
Arti Gaur
Lecturer,
Department of Business Administration
Ch.
Devi Lal University, Sirsa-125055
Abstract
Retail banking in
29. A Modified Algorithm for Codebook
Design using Vector Quantization for Image Compression
Mr.
Avinash B. Lambat, Mrs. Richa R. Khandelwal
Department
of Electronics Engineering,
alambat111@rediffmail.com,
richareema@rediffmail.com
Abstract
Uncompressed multimedia (images, audio, video) data requires
considerable storage capacity and transmission bandwidth despite rapid progress
in mass storage density, processor speeds and digital communication system
performance. The only solution is to compress multimedia data before its
storage and transmission and decompress it at the receiver. This paper presents
an efficient approach for image Compression using modified transform vector
quantization for codebook generation. In this paper, a new codebook
design algorithm is proposed for image coding. The method utilizes mean-squared
error based selection schemes for good
clustering of data vectors in the training space. As the clustering process
terminates only in two steps, it is highly computationally efficient as
compared to other reported methods. Simulation results are presented to show
the superior performance of the proposed method in terms of peak
signal-to-noise ratio as compared to the standard Linde-Buzo-Gray algorithm for
codebook design.
Keywords - Image
Compression, Vector Quantization, Code vector, Codebook generation, Compression
Ratio(CR), Peak Signal-to-Noise Ratio (PSNR).
30. A Fuzzy Based Distributed Node
Movement Algorithm for Maintaining Neighborhood Topology in
Jishan Mehedi [1], M.K.Naskar [2]
[1] Department of Electronics & Communication Engineering, NIT, Silchar,
[2] Department of Electronics & Telecommunication Engineering,
jmehedi2007@yahoo.co.in, mrinalnaskar@yahoo.co.in
Abstract
This paper proposes one scheme for selecting neighborhood and fuzzy
based distributed movement algorithm for maintaining neighborhood topology
during movement of the network. All the nodes are enabled with GPS. All the
nodes will periodically broadcast their position and velocity information
obtained through the GPS. After receiving the information from the other nodes,
a node will first decides its neighboring nodes. Once neighborhood selection is
done, the whole network will start their movement. During movement, each and
every node is responsible to maintain its initial neighborhood intact. The key
concept in this algorithm is that in each and every beacon interval node will
decides its movement, so that it can maintain connectivity with its maximum
distant neighbor. And this decision is fuzzy logic based. We have simulated the
algorithm in a number of synthetically designed situations and the results we
have obtained have been quite encouraging.
Keywords: MANET, Topology Management, Fuzzy Logic, Distributed Algorithm.
31. Assessment of Exported Mango Quantity
by Soft Computing Model
DHARMPAL SINGH, AMRUT RANJAN
1Department of Computer Sc. &
Engineering,
2Department of Computer Sc. &
Engineering,
3Department of Information
Technology,
singh_dharmpal@yahoo.co.in, amrut_ranjan_jena@yahoo.co.in, jnpc193@yahoo.com
Abstract
Assessment plays a major role in the field of prediction. If the Assessment can not be selected properly, the prediction information becomes incorrect and this scope of work of futuristic planning becomes lost. Therefore it is needed to select an appropriate technique for the purpose of forecasting. A lot of soft computing model is being used in various application systems for the purpose of forecasting. The performance of fuzzy logic, in the field of soft computing, is being examined for the purpose of Assessment on the basis of average error. Here an effort is being used to select the proper soft computing technique to predict the futuristic information of quantity of fresh mango to be exported in near future.
Keyword: Fuzzy logic, Artificial Neural Network, Perceptron Network
32. Review of
VOIP Techniques
Parvinder Singh1,
Deepshikha Verma2, Sukhbir Singh3
1Department of Computer Science &
Engineering, DCR, Murthal
2Darsh
3N.C.
parvinder23@rediffmail.com
Abstract
Voice transmission on net has increased significantly in
last three years. Voice quality can be degraded due to number of reason such as
unpredictable short term loads, lack of guarantees on network performance, lack
of control over the end systems. Enormous advances have been made in computer
technology to send packet voice data. This research paper reviews the concerns
and technological advancement in this area.
33. An Application to find Spatial
Distribution of blood donors from blood bank information system
B.G.Premasudha, Dr. Shivakumar Swamy, Dr.
B.Suryanarayana Adiga
1Research
Scholar,
2Principal
, Mallige
3Consultant
Supervisor, TCS,
bgpremasudha@gmail.com, drskswamy@yahoo.co.in
Abstract
The availability of blood is one of the important requirements in treating medical emergencies. The blood banks do not maintain buffer stocks as required during that time. Thus the buffer stock is crucial for disaster management. This application helps people to get the right information about the availability of blood in the current location for the sake of transfusion at their need of the hour without running from pillar to post in getting the required blood during emergency. In this paper we propose a system to find the nearest blood bank with stock details and the display of donor/s in that locality during emergency with an integration of Geographic Information System (GIS) to online requisition of voluntary donors, receptors, data base of blood banks, stocks of blood, blood transfusion and related issue management to address the global blood related problems in coming future.
Keywords: GIS, Blood bank information system, spatial distribution.
34. A Review of Vision Based Hand
Gestures Recognition
G.R.S.Murthy, R.S.Jadon
Department of Computer
Applications, MITS,
murthy.grs@gmail.com, rsj_mits@yahoo.com
Abstract
With
the ever-increasing diffusion of computers into the society, it is widely
believed that present popular mode of interactions with computers (mouse and
keyboard) will become a bottleneck in the effective utilization of information
flow between the computers and the human. Vision based Gesture recognition has
the potential to be a natural and powerful tool supporting efficient and
intuitive interaction between the human and the computer. Visual interpretation
of hand gestures can help in achieving the ease and naturalness desired for
Human Computer Interaction (HCI). This has motivated many researchers in
computer vision-based analysis and interpretation of hand gestures as a very
active research area. We surveyed the literature on visual interpretation of hand
gestures in the context of its role in HCI and various seminal works of
researchers are emphasized. The purpose of this review is to introduce the
field of gesture recognition as a mechanism for interaction with computers.
Keywords: Hand Gesture Recognition, Human Computer Interaction, Computer Vision.
35. Next Generation Wireless Networks
Punam Bajaj [1] Geetanjali Babbar[2] Anu Chawla[3] Monika Malhotra[4]
[1] Sr. Lect,
[2] Lect,
[3] Lect, Govt.
[4] Monika Malhotra, Sr. Lect., Dr. IT Group
of Institute, Banur
bajaj_punam@yahoo.com, ergeetanjalibabbar@yahoo.co.in, annu_khurana@yahoo.com, chadha.monika@gmail.com
Abstract
Next generation mobile networks, commonly referred to as
4G, and are envisaged as a multitude of heterogeneous systems interacting
through a horizontal IP-centric architecture. Researchers and industry leaders
are trying to contribute their ideas to the deployment of the yet-undefined 4G
wireless world that is estimated to be operational around 2010. Although 4G is
currently undefined there are many current opinions that outline the vision of
the new wireless technologies. 4G must be dynamic and adaptable with built-in
intelligence. Key challenges will be personalization, seamless access, quality
of service, intelligent billing. Future wireless
networks will need to support diverse IP multimedia applications to allow
sharing of resources among multiple users. There must be a low complexity of
implementation and an efficient means of negotiation between the end users and
the wireless infrastructure. In this paper we have discussed challenges,
Service & applications in next generation mobile network.
36.
Identifying Suitability of any Formal Language for Particular Application Area
Monika Dhariwal, Shivani
Goel
M.E. ( Software Engineering
)
Lecturer, Department of Computer Science and
Engineering,
dhariwal.monika@gmail.com, shivani@thapar.edu
Abstract
Formal specification of a system has been an active area of research since past few decades. There are a number of formal specification languages, Z, VDM, OCL, SDL[1, 2, 3, 4, ] etc. Comparing the different specification methods is not an easy task but it is meaningful in many aspects. This article focus which formal specification language is suitable for particular type of problem e.g. communication type problems, real time application, and problems involving concurrency etc.
Keywords- Formal specification language, reusability, concurrency.
37. A Novel
Session Based Text Encryption & Hiding Technique Using Bit Level Cross Fold
Transposition & Genetic Algorithm
TANMAY BHATTACHARYA
[1], MANAS PAUL [2], ARINDAM DASGUPTA [3]
[1] Sr. Lecturer, Information Technology Dept., JIS
West
[2] Sr. Lecturer, Computer Application Dept., JIS
West
[3] M. Tech. (Information Technology) Student, JIS
West
Abstract
This paper provides a novel approach towards document
hiding technique within a color bitmap image using cross fold transposition and
genetic algorithm. The document can be a text, word or any other text file. The
secret text is firstly represented in its equivalent binary form, upon which
cross fold transposition is applied. Next this binary form is perturbed by
genetically generated session-key. In the next step this perturbed information
is embedded within the Host-image. During extraction the stego-image and the
original image along with the session key is used. At first the extraction of
the secrete text is done, and then reverse engineering with the session-key is
done to obtain the hidden information.
Keywords – Bit Level, Cross Fold, Transposition, Session key, Genetic algorithm, Steganography,
38.
Performance Analysis Of Anti Collision Algorithms for Tracking Objects
Containing Passive RFID Tags
INDRAJIT BHATTACHARYA[1],
UTTAM KUMAR
[1]
[2]
Abstract
Radio frequency identification (RFID) systems have emerged as an efficient and cost effective solution for tracking objects containing passive RFID tags. The choice of passive RFID tag is due to its low cost and simplicity of implementation. The problem is to identify objects containing passive RFID tags. If there are multiple objects in the range of a tag reader, they all send their ID to the reader simultaneously in response to the readers query. This leads to collision at the reader end and no tag is identified leading to the wastage of bandwidth and increase in total delay in identifying all objects. This paper presents some popular and efficient collision resolution protocols and one variation of that for the tag identification problem where a tag reader attempts to obtain the unique identity of the tags in its read range within finite time and significant delay. This paper also concentrates on different performance parameters regarding the singulation process and analyzes the performance of different anti collision algorithms on the basis of different performance parameters like total number of messages sent between tags and readers during the singulation process and the total amount of time for singulation.
Keywords: RFID, Anti-collision, Singulation
39. Direction
of Indian Trade: An analysis of the changes in the context of global economic
crisis
Dr. Shuchi Gupta, Neetu Mehndiratta
Department of Business Administration, Maharaja
Agrasen Institute of Management and Technology,Jagadhri, Distt. Yamunanagar,
Haryana,
gupta.shuchi5@gmail.com
Abstract
The world economy is grappling with a severe financial
crisis.
40. Effort Estimation in
Component Based Software Engineering
Puneet goswami[1], P.K. Bhatia[2] ,
Vijender Hooda[3]
[1][3]Asst. Professor Dronacharya
[2] Reader,
Deptt. Of Comuter Sc. & Engg, GJUS&T, Hisar,
[1]Asst. Professor Dronacharya
Abstract
Component-based software engineering (CBSE) represents an exciting and promising paradigm for software development. Software components are one of the key issues in CBSE. The software development community is continuously seeking new methods for improving software quality and enhancing development productivity. There is an increasing need for component-based metrics to help manage and foster quality in component-based software development. The traditional software product and process metrics are neither suitable nor sufficient in measuring the complexity of software components, which ultimately is necessary for quality and productivity improvement within organizations adopting CBSE. In the software development process, scheduling and predictability are important components to delivering a product on time and within budget. Effort estimation artifacts offer a rich data set for improving scheduling accuracy and understanding the development process. In this paper, we survey few existing component-based reusability metrics. These metrics give a border view of component’s understandability, adaptability, and portability. This paper is split into four sections. First section of this paper emphasizes on need of effort estimation in component based software engineering. Second section of this paper elaborates concept of deriving a metrics using this concept of COCOMO Model. Third section emphasize on how to calculate adjustment factor for the software might be partly developed from software already existing. Fourth section elaborates conclusion and future work. Paper proposes metrics to evaluate effort and development time by conventional and component based software engineering approach and shows the result comparison.
41. Simulation and Analysis
of DSDV Protocol in MANETs
JYOTSNA RATHEE[1], ANIL KUMAR VERMA[2]
[1]M.E. (Computer Science), [2]Assistant Professor
Department of Computer Science and Engineering,
jyotsna.rathee@gmail.com,akverma@thapar.edu
Abstract
With the
advancements in computers and wireless communication technologies, mobile ad
hoc networks (MANET) is expected to see increasingly
widespread use and application. A MANET is an autonomous collection of mobile
users that communicate over wireless links. Proactive protocols in MANETS like
DSDV, OLSR, TBRPF are table driven and actively determine the layout of the
network. A complete image of the network is maintained at every single node by a
regular exchange of network topology packets between the nodes of the network.
In this paper, we simulate and analyse the Destination-Sequenced
Distance-Vector (DSDV) protocol for various parameters like throughput, average
end-to-end delay by varying the number of nodes in MANET. The results indicate
that the throughput decrease as the numbers of node increase.
Keywords: MANETS, DSDV.
42. Identification of
Microcalcification in Mammographic Images Using Wavelet and Artificial Neural Networks
[1]K.PRABHUSHETTY and [2]Dr. V R. UDUPI
[1]Asst.Professor Department of E&C,
[2]Principal,
Abstract
This paper takes digital mammograph
for scrutiny with the angle of finding the microcalcification in the
mammographic images through the help of artificial neural networks (ANN) and
wavelet-based sub band image decomposition. When the mammographs are digitized
the micro calcification present in it will be in the form of high frequency
component of the image matrix. In order to detect it we filter the image using
Hessian filter and apply DWT and finding the Skewness and Kurtosis of the
resulting image, before applying the BPN algorithm for diagnosing the cancer. The neural network contains one
input, two hidden and one output layers. The described method has been tested
on many mammographic images taken from the Digital Database for Screening
Mammography (DDSM).
Keywords: Kurtosis, Wavelet transform, breast, cancer, malignant,
Skewness
43. Dynamic Metrics at
Design Level
Payal Khurana[1], Puneet Jai Kaur[2]
[1] Department of Information Technology,
[2] Department Of Information Technology,
payal_f12@yahoo.co.in, puneetkaur79@yahoo.co.in
Abstract
As object oriented analysis and design techniques become
widely used, the demand on assessing the quality of object-oriented designs
substantially increases. Recently, there has been much research effort to develop
and empirically validate metrics for OO design quality. Complexity, Coupling
and Cohesion have received a considerable interest in the field. Despite the
rich body of research and practice in developing design quality metrics, there
has been less emphasis on dynamic metrics for object-oriented designs. The
complex dynamic behavior of many real-time applications motivates a shift in
interest from traditional static metric to dynamic metrics. In this research,
Improved Dynamic cohesion metric is proposed. Existing cohesion measures only
consider the pattern of interactions but do not differentiate write interaction
from read interaction. Thus, do not reflect properties of class. This research
measures improved version of cohesion measures considering read and write
interaction as well as dynamic environment. This cohesion measures will be
evaluated against some open source code of Java and to prove that write
interaction are so commonly used in classes that they have much influence on
cohesion measures and also cohesion
measured dynamically is better than
measured statically.
Keywords: Dynamic measurement, Cohesion, Interaction
patterns, Read/Write Interactions, AOP.
44. Reputation based trust
model with elimination of unreliable feedbacks
P. Srivaramangai, MCA Dept, BSA University ,
Chennai, Tamilnadu , India
Dr. R. Srinivasan, CSE Dept,
sri_padma_2000@yahoo.com,drrsrs@yahoo.com
Abstract
Grid computing system is the one where individual entities share their
resources with others in their own domain as well as with other domain. The
resources should be shared with out loosing individual’s confidentiality and
control over their resources. To achieve this and ensure grid security various
models have been proposed and one of them is the trust model. Reputation based trust models are coming up
to address the problems in behavior conformity. The reputation values in these
models are evaluated in a democratic manner based upon the feedback from other
entities. This paper investigates such reputation based trust models in the
presence of malicious entities which
give deliberately wrong feedbacks. We propose an enhancement by which the
malicious feed backs are eliminated by rank correlation method. Thus the work
enhances the behavioral conformity in the presence of malicious entities.
45. PRODUCTION OF GOAT
ANTI-RABBIT ANTIBODIES.
Manish Kalra, Abhinav Goyal, Saaraj Gupta, Ketan
and Shweta Nikumb
Abstract
Antibodies are a group of glycoproteins present in the serum as a part
of our defence system. Specific antibodies are formed when an animal is
immunized with an antigen. Antibodies can be produced experimentally by
injecting any compound that contains at least one antigenic determinant and are
termed as Primary Antibodies. Secondary antibody is an antibody which binds at
Fc fragment of the primary antibody. The
present work aims at purifying immunoglobulins from Rabbit serum and then using
these as immunogens in Goats to develop Goat Anti-Mouse antibodies. These can
be labelled as a probe that makes them useful for the detection, purification
or cell sorting application. This being a highly specific reaction, antibodies
has become an invaluable tool in the immunological research and clinical
immunodiagnostics. Isolation of Goat Anti-Rabbit Antibodies has been
successfully completed. Work is being done on production of Horse Radish
Peroxidase enzyme. Further, conjugation of isolated Goat Anti-Rabbit Antibodies
with Horse Radish Peroxidase is proposed to be done, so that these labeled
antibodies can be used in indirect ELISA, indirect sandwich ELISA, indirect
competitive ELISA, Immunostaining, and
Immunocytometry.
Keywords - Antibody,
affinity chromatography, ion-exchange chromatography, dialysis, immunization,
double immunodiffusion, lyophilization.
46. Establishing association
between the ordered piece and a piece selection basis for rectangle packing
heuristic
KAWALJEET SINGH [1], LEENA JAIN [2]
1. University computer centre, Punjabi university,
2. Regional institute of management and technology, Mandi Gobindgarh, 147301 (
singhkawaljeet@pbi.ac.in, singhkawaljeet@rediffmail.com, jain_lina@yahoo.co.in
Abstract
In this paper reworked rectangle-packing algorithm suggested by
Cheok-AYC Nee is used to generate different 120 feasible patterns. Simulated
tests were conducted for classification of items and sheets into three
different categories (and so are objects) as regular when length/ width ratio
is uniformly distributed (1.25±0.25), standard (length/ width ratio is uniformly
distributed (3±0.3)
and tapered (length/ width ratio is uniformly distributed (6±1). Different nature of items was placed on different
nature of sheets. Heuristics which gives maximum utilization/minimum trim loss
is selected and find out direct relation with the sequencing patterns i.e.,
area, perimeter, length, width and length/width ratio and the nature of items/
object. Recommendation developed for the best heuristic under different
condition. It is observed that as the L/B ratio of sheet increases, the average
utilization factor of sheet will decrease.
Keywords: Rectangle
Packing, Heuristics algorithm, Greedy Approach, NP-complete problems, Sheet
Layout, industrial applications.
47. Comparing the
Effectiveness of Machine learning algorithms for Defect Prediction
Pradeep Singh
Department of Computer Sc & Engineering,
National Institute of Technology,
Abstract
Software repositories with defect logs are main
resource for defect prediction. In recent
years, researchers have used the vast amount of data that is contained by
software repositories to predict the location of defect in the code that caused problem. In this paper machine learning
approach is used for predicting the modules with defect for embedded data set.
Public datasets from the promise repository have been explored for identifying software defects using machine learning
methods. The repository contains software metric data and error data at the
function/method level. The aim of the
paper is to classify embedded data set using J48, OneR and Naïve Bayes machine
learning algorithms to construct a model that predicts potentially defected
modules within a given set of software modules with respect to their metric
data and study the performance of these machine learning algorithms. The result
is compared on the basis of confusion matrices. The study showed that J48 and
OneR performed better than Naive Bayes.
Keywords:
Machine learning, Software metrics, Defect prediction.
48. Edge Magicness of N
Copies of Generalized Petersen Graphs
[1]J.Joy Priscilla, [2]R. Sattanathan
[1]Research Scholar,
[2]Assistant Professor, Department Of Mathematics,
joypriscilla_77@Yahoo.com, rsattanathan@Gmail.com
Abstract
Let
G = (V,E) be a simple graph with v vertices and e edges. An edge-magic total labeling is a bijection f: VÈE ® { 1,2,…v+e} with the property that for each edge xy, f(x) + f(y) + f(xy) = k, a constant called the magic sum or magic constant of the graph
G. The graph G which admits any edge magic total labeling is called edge magic total . A generalized Petersen graph P(n,m), n ≥ 3, 1 ≤ m < is a 3-regular graph with 2n vertices u1, u2,…un, v1, v2,…vn and edges (ui,vi), (ui,ui+1),
(vi,vi+m) for all i Î {1,2,…n}, where the subscripts are taken modulo n. P(5,2) is the standard
Petersen graph. In this paper we study the edge magicness of N copies of
generalized Petersen graphs where N is a finite positive integer.
Key words: Edge-magic total labeling, Copywise edge magic, Generalized Petersen
graphs.
50. Customer
Relationship Management in Indian Retail Market
Manoj Kumar
Jain [1], A. K. Dalela [2] and Sandeep Kumar Tiwari [3]
[1] School of Studies in Mathematics, Vikram University, Ujjain.
[2] Department of Mathematics,
[3] School of Studies in Mathematics,
Manoj.kumarjain@gmail.com, dalela@ymail.com and skt_tiwari75@yahoo.co.in
Abstract:
Retail is most important industry of
In this paper describe the role of Customer Relationship Management (CRM) in
Indian retail market and how to enhancing the Customer Lifetime Value (CLV). A
successful and effective CRM programmed results in increase of Customers
Lifetime Value for the store. The importance of the tangible and the intangible
offerings are also discussed. A good CRM Strategy should focus on: Building
dynamic relationship with the customer, CRM is the key element to building
customer loyalty to a store brand and to build a significant competitive
advantage [8].
51. Inventory
Control through Lateral Transshipment in Multi Retailer Supply Chain
DHARAMVIR MANGAL [1], TARUN
GUPTA [2]
[1] Lecturer, Mechanical
Engineering Department, The Technological
[2] Assistant professor,
Mechanical Engineering Department, N.G.F. College Of Engineering And
Technology, Palwal, Haryana, INDIA
mangaldharamvir1@rediffmail.com [1], tarungupta1976@yahoo.com [2]
Abstract
Lateral Transhipment is very an effective means of reducing total cost of the system, as well as improving the service level. The objective of this paper is, to explore the implication of pooling on multi-retailer supply chain inventory system, with one central ware house, with varying demand and varying lead time at each retail outlet. The product is either sold out or remains as a surplus. This surplus is transshipped to the other retailer having shortage. This way, both the holding costs and shortage costs of the total system are reduced and improvement in the service level. This work demonstrates the benefits of lateral transshipment in terms of reduced total system cost and improves in customer service level or overcoming the uncertainty of demand and lead-time.
Keywords: Supply chain management; Inventory management; Lateral transshipment.
52. Web 2.0 Mapping Mashup Applications for Academic Universities–Comparative Case Study (Secure Google Maps API versus Microsoft Virtual Earth API)
Ms. B.Padmaja Rani1 M.Upendra Kumar2
1Associate Professor CSE JNTUCEH Hyderabad A.P India
2Associate Professor CSE MGIT Hyderabad A.P India
padmaja_jntuh@yahoo.co.in,uppi_shravani@rediffmail.com
Abstract
Web Mapping is the process of designing, implementing, generating and delivering maps on the World Wide Web. A common challenge for many web developers is the creation of web applications that capture and describe geographical information. As a result of Web 2.0 technologies such as Asynchronous JavaScript and XML (Ajax) web-based mapping applications with rich contents can be developed with better interactivity, functionality, accuracy and usability. These applications (for example Academic Universities Web Mapping) provide users with maps to search and browse geographic information. The integration of information on maps as a layer is known as Mashups. The Value of a mashup lies in better user interface for that data or in combining data from a number of sources in an interesting way. In this paper we want to propose Web mapping strategies for Academic Universities, using robust Secure Google Maps API version 2, and Microsoft Virtual Earth API with a comparative study of API’s involving tests on browser compatibility, performance, accuracy, functionality, usability, geocoding and development support etc. We explain how web-mapping works, Google Maps API motivation for such academic application, with our Microsoft Virtual Earth implementation of our Web mapping application of MGIT. We conclude with Map Abstraction Layer which improves interoperability of API’s integrating development methodology. Finally issues pertaining to securing Google Maps API will be discussed.
Keywords – Web mapping, Web GIS (Geographic Information System), Google Maps API version 2, Microsoft Virtual Earth, Map Abstraction Layer, Web 2.0 Mashups.