018549   Singh Y;Soni M K;Swarup A (Technical Education Dep, , Sirsa, Haryana) : Performance comparison of single path and multi-path adaptive routing algorithm in core networks. J Instn Engrs-Pt CP 2010, 91(May), 24-8.

This research paper highlights the importance and need of multi-path adaptive routing algorithm in the core networks. The simulation results in ns-2 helps in making the performance comparison between a single shortest path and equal cost multi-paths available between source and destination nodes. A mathematical model is also proposed. The paper concludes how multi-path adaptive routing algorithm is helpful in avoiding congestion and balancing load as compared to single shortest path routing algorithm. It also gives performance comparison of multi-path link state and distance vector routing algorithm in core network of high speed and having large volume of data transactions.

5 illus, 5 tables, 13 ref

018548   Sharma K;Kamal T S;Kaler R S (Electronics and Communication Engineering Dep, National Institute of Technical Teachers' Training and Research, Chandigarh) : Energy efficient layering and clustering scheme for wireless sensor networks. J Instn Engrs-Pt ET 2011, 91(Jan), 13-17.

In order to investigate the hot spot problem in multi-hop sensor networks, clusters of unequal sizes provides an effective scheme. In this scheme, a network is divided into n layers and each layer is assigned different probabilities to form clusters. Clusters closer to the sink node that is in first layer have no intra-data traffic and hence all are cluster heads as they have direct transmission to sink node with small amount of energy and fully devote to heavy data relaying. In addition, distribution of sensor nodes is done according to energy balancing layers algorithm and therefore energy consumption in all the layers is equal. Finally, optimum value of network layers and total clusters has been found in order to keep the energy consumption of a layer to minimum.

9 illus, 3 tables, 5 ref

018547   Sharma K;Kamal T S;Kaler R S (Electronics and Communication Engineering Dep, National Institute of Technical Teachers' Training and Research, Chandigarh) : Comparative analysis of multi-hop wireless sensor networks. J Instn Engrs-Pt ET 2011, 91(Jan), 7-12.

An analytical model has been developed to investigate the performance of wireless sensor network in a collision free and collision affected environment. In this model, a network is divided into n layers and each layer is assigned different probabilities to form clusters. Clusters closer to the sink node have no data traffic, and with very small amount of energy, they devote to heavy data relaying. In addition, distribution of sensor nodes is done according to energy balancing layers algorithm and therefore energy consumption in all the layers is equal, in this paper, analytical results are compared for both collision free and collision affected environment. The collision affected model provides insight into the MAC layer collision impacts on the energy balancing routing algorithm.

8 illus, 2 tables, 5 ref

018546   Rashmi K V;Shah N B;Vijay Kumar P (Electrical Communication Engineering Dep, Indian Institute of Science, Bangalore-560 012, Email: rashmikv@ece.iisc.ernet.in) : Network coding. Resonance 2010, 15(7), 604-21.

Network coding is a technique to increase the amount of information flow in a network by making the key observation that information flow is fundamentally different from commodity flow. Whereas, under traditional methods of operation of data networks, intermediate nodes are restricted to simply forwarding their incoming message symbols downstream, network coding achieves vast performance gains by permitting intermediate nodes to carry out algebraic operations on the incoming data. In this article we present a tutorial introduction to network coding as well as an application to the efficient operation of distributed data-storage networks.

12 illus

018545   Raosaheb L;Bajaj V H (Statistics and Centre for Advanced Studies Dep, Pune Univ, Pune-411 007, Email: rvl@stats.unipune.ac.in) : Fuzzy programming for multi-objective transportation and inventory management problem with retailer storage. Int J agric statist Sci 2011, 7(1), 317-26.

Considers a supply chain in which customers place an order to retailers for fulfilling his demand. Then retailers place the order to supplier and receive the material at retailer's store. Customers pick up the material from retailers store. In each stage, there is uncertainty at demand from customers, transportation cost and inventory holding cost; hence we propose possibility programming approach. In a real decision problems usually several objectives are considered that have parameters which are often given by the decision maker in an imprecise way. It is possible to handle these kinds of problems through multiple criteria models in terms of possibility theory. This concept is based on soft preference and indifference relationships and on canonical representation of fuzzy numbers by means of their α-cuts We formulate Fuzzy Multi-objective Transportation and Inventory Linear Programming model (FMOTILP). Also, we use global criteria method for solution.

5 tables, 10 ref

018544   Prathibha B N;Sadasivam V (Computer Science and Engineering Dep, Manonmaniam Sundaranar Univ, Tirunelveli-627 012) : Breast tissue characterization using variants of nearest neighbour classifier in multi texture domain. J Instn Engrs-Pt CP 2010, 91(Nov), 7-13.

Mammpgrams are the most reliable and cost effective method for showing tissue abnormalities of breast. The proposed method classifies the breast tissues by extracting multi texture properties with multi scale wavelet transformations on regions of interest (ROI). The ability of each texture property in discriminating normal and abnormal ROI is analyzed individually and collectively. The method is tested on 217 mammogram images from the MIAS database. Results indicate that multi-resolution image transformation becomes inevitable when improvement of classification accuracy in textural domains is required. Further, the current work finds the classification accuracy of nearest neighbour (NN) classification techniques like kNN, prototype A/A/, class based NN and density based NN, which exploits the underlying density structure ofdataset. The study reveals that the variants of nearest neighbour classifier perform we/I individually and they significantly enhance the classification accuracy when combined. Also, experiments show that the level of contrast enhancement used and type of the wavelet used have considerable impact on the classifiers performance. Finally, the performance of the proposed statistical classifier is compared with radial basis classifier Support Vector Machines (SVM). The receiver operating characteristic (ROC) curve analysis which upholds the classifier performance is used as the performance measure to justify the result It yields an area under ROC curve (AZ) of 0.946 for proposed scheme, against 0.924 of SVM.

6 illus, 4 tables, 19 ref

018543   Kumar S;Bhalla P;Singh A (Computational Inelligence Laboratory, Institute of Science and Technology Klawad, Haryana) : Fuzzy rulebase generation from numerical data using big bang-big crunch optimization. J Instn Engrs-Pt ET 2011, 91(Jan), 18-26.

Fuzzy rule based systems are one of the very important class of knowledge based systems. The knowledge in a fuzzy system is embedded in the form of a rulebase. The main contribution of this study is that it proposes a novel optimization method to rulebase extraction from numerical data that relies on one of the theories of the evolution of the universe, namely, the Big Bang and Big Crunch Theory. Inspired by this theory, an optimization algorithm is constructed, which will be called the Big Bang-Big Crunch (BB-BC) method that generates random points in the Big Bang phase and shrinks those points to a single representative point via a center of mass or minimal cost approach in the Big Crunch phase. The rule base extraction problem is formulated as the minimization problem. BB-BC was used to enumerate rules corresponding to each data set. The paper discusses rule extraction for type zero TSK fuzzy systems for battery charger and iris data set. However, the approach is very powerful computation tool to deal with NP hard problems. The results indicate that the BB-BC is a very promising optimizing algorithm for evolving fuzzy logic based systems.

4 illus, 2 tables, 56 ref

018542   Kanmani S;Devi P L;Phriya V R V;Jaya N (Computer Science and Engineering Dep, Pondicherry Engineering College, Pondicherry-605 014) : Design and implementation of a simulation tool for analyzing RWA algorithms. J Instn Engrs-Pt CP 2010, 91(May), 10-6.

Optical Wavelength Division Multiplexing (WDM), a networking technology that has been identified as a suitable candidate for future wide area network (WAN) environments, due to its potential ability to meet rising demand of high bandwidth anfflow latency communication. Various routing and configuring algorithms of network topology and wavelength assignment are being developed to meet the changing operational requirements in Wavelength Routed Optical Networks. In this paper, the design and implementation of a simulation tool to study the various optical network topologies is presented to compare the various routing and wavelength assignment algorithms. This tool is implemented in Java with modularized, platform-independent and extensible architecture.

6 illus, 2 tables, 13 ref

018541   Juliet S E;Florinabel D J;Sadasivam V (Computer Science and Engineering Dep, Manonmaniam Sundaranar Univ, Tirunelveli-627 012) : Efficient coding of computer screen images with precise block classification using wavelet transform. J Instn Engrs-Pt CP 2010, 91(May), 17-23.

This paper presents a precise, one-pass block classification algorithm for efficient coding of computer screen images for desktop sharing. The objective is to minimize the loss of visual quality of text during compression by separating text information which needs high spatial resolution than the pictures and background. It segments computer screen images into text/graphics, picture/background blocks by computing the statistical feature based on DWT coefficients in the detail sub-bands of each 8 x 8 block, and then compresses the text/graphics pixels with Huffman algorithm and the background pixels with the lossy JPEG algorithm. The proposed algorithm performs accurate block classification of text information with different fonts, sizes and ways of arrangement from the background image, so that text/graphics blocks are compressed at higher quality than background image blocks. Experimental results show that the proposed method minimizes block classification error and improves the value ofPSNR significantly than standard JPEG, JPEG-2000 and DjVu while keeping competitive compression ratio and visually lossless quality of text information.

5 illus, 2 tables, 14 ref

018540   Jiji G W;Kalaiselvi M;Mutharasi T;Vijitha T; Ganesh S S (Computer Science and Engineering Dep, Sivanthi Aditanar College of Engineering, Tiruchendur-628 215) : Segmentation of heart blood vessels for identification of diseases. J Instn Engrs-Pt CP 2010, 91(Nov), 17-24.

This paper presents an automated method for segmentation of the heart blood vessels in MRI heart images. The algorithm starts with the extraction of vessel centrelines, which are used as guidelines for the subsequent vessel filling phase. For this purpose, outputs of four directional differential operators are processed, in order to select connected sets of candidate points, to be further classified as centreline pixels using vessel derived features. Final segmentation is obtained using an iterative region growing method that integrates the contents of several binary images resulting from vessel width dependent morphological filters. The approach was tested on heart MRI images and its results are compared with recently published methods. The results demonstrate that the algorithm outperforms other solutions and approximates the average accuracy of a human observer without a significant degradation of sensitivity and specificity.

8 illus, 1 table, 33 ref

017403   Wiselin Jiji G;Radhakrishnan S (Computer Science and Engineering Dep, Dr Sivanthi Aditanar College of Engineering, Tiruchendur-628 215) : Classification of tumour and non-tumour tissues. J Instn Engrs-Pt ID 2010, 91(May), 9-14.

The research presented in this paper is automatic imaging system for classification of tissues in medical images. The focus is on the use of a colour fuzzy texture spectrum feature for representing distribution of feature vectors of texture class to generate a feature-label interaction constraint. In order to increase the classification accuracy of tissue classification, two more features have been added in doppler along with texture features. The proposed algorithm process works in two steps. The first step is the learning process. Here, colour fuzzy texture spectrum and doppler features are extracted and stored in library. In the second step, training the feature of unknown sample is extracted and compared with features that are stored in the library by Euclidean distance. Experimental results show that the classification accuracy is increased by using proposed features, when compared with other works. For human tissue images, it yields classification accuracy of 99. 9%, as presented in this paper. The advantage of this approach is that all classes in an image are determined, simultaneously, similar to human perception of textures in an image.

13 illus, 16 ref

017402   Vermani S (NO, , Apeejay School of Management, Sector-8, Institutional Area, Dwarka, New Delhi, Email: s_vermani_s@yahoo.com) : Secure key exchange (SKE) : password based protocol secure against dictionary attack. Panjab Univ Res J Sci 2009, 59(1-4), 237-48.

SKE is an efficient password authenticated key exchange protocol with human memorable passwords. It is a verifier based protocol secure against dictionary-attack and other active attacks. In SKE not only the client has to authenticate itself to the server but also the server has to authenticate itself to the client. It also resists denial-of-service attack.

25 ref

017401   Kang A S;Sharma V (Electronics & Communication Engineering Dep, SSG Panjab Univ Regional Centre, Bajwara, Hoshiarpur, Punjab, Email: askang_85@yahoo.co.in) : Effect of delay and performance tradeoff of square root raised cosine digital filter for WCDMA at 5MHZ. Panjab Univ Res J Sci 2009, 59(1-4), 169-73.

Signal processing techniques, such as equalization, detection, and fast Fourier transform, have been successfully used in communication systems to improve the quality of communications. With the recent exploding research interest in wireless communications, the application of signal processing to this area is becoming increasingly important. Indeed, it is the advances in signal processing technology that make most of today's wireless communications possible and hold the key to future services. The present paper deals with simulation model and analysis of square root raised cosine filter for WCDMA with different parameters at variable group delay of the filter at 5 MHz.

1 table, 3 illus, 19 ref

017400   Hyder Ali S;Sukanesh R (School of Electrical Sciences, VIT University, Veliore) : Edge preserving denoising technique for MR images using curvelet transform. J Instn Engrs-Pt ID 2010, 91(May), 3-8.

This paper presents a curvelet based approach for the denoising of magnetic resonance (MR) images. Curvelet transform is a new multi-scale representation suited for objects which are smoothened away from discontinuities across curves. It was developed by Candes and Donoho. These digital transforms are applied to the denoising of standard MR images embedded in Gaussian noise, random noise and Poisson noise. In the tests reported here, simple thresholding of the Curvelet coefficients is very competitive with state-of-the-art techniques based on wavelet transform methods. Moreover, the curvelet reconstructions exhibit higher perceptual quality than wavelet-based reconstructions, offering visually sharper images and, in particular, higher quality recovery of edges and of faint linear and curvilinear features. Since medical images have several objects and curved shapes, it is expected that curvelet transform would be better in their denoising. The simulation results show that the proposed curvelet method outperforms the wavelet method in the denoising of both MR images in visual quality and the peak signal to noise ratio (PSNR) points of view.

5 illus, 10 ref

017399   Harmanpreet Kaur H;Naresh Kumar;Bhatnagar R (NO, Rayat and Bahra College of Engineering and Biotechnology for Women, Sahauran, Kharar, Punjab, Email: naresh_uiet@yahoo.com) : Design of electronic circuitry for temperature monitoring system using FBG sensors. Panjab Univ Res J Sci 2009, 59(1-4), 175-81.

Transformers are the vital part of power industry among power generators, transmission cables, and gas insulator switchgears. The unexpected failure of such systems leads to enormous loss in service quality. Direct measurement of transformer winding temperature is increasing with growing needs to accurately monitor the hot-spots of transformer, predict load levels, and improve capacity utilization. Conventional temperature sensors (e.g. thermocouples, RTD, and hermistor) limit the speed, accuracy and resolution of monitoring in many applications. Fiber Bragg grating sensing, a echnology that relies on analysis of light pulses reflected down optical fibers, offer well and more efficient way to monitor changes in temperature. FBG sensors have proved one of the most efficient tools for their considerable advantages, over conventional sensors, such as, (1) immunity to electromagnetic interference, (2) potential to work in harsh environmental conditions - in the presence of high voltages and magnetic noise levels, (3) multiplexing capability, and (4) high sensitivity. It is possible to take real-time data of temperature along the fiber with several kilometers in length. In this paper, an electronic circuitry for the proposed temperature monitoring system is designed and simulated for accurately measuring the shifts in the reflected Bragg wavelength. These shifts are due to the temperature induced on the FBG sensors and need to be accurately measured for efficient working of electric power networks.

15 illus, 9 ref

017398   Garg R K;Singh V (ECE Seth Jai Prakash Polytechnic, , Damla, Haryana) : Simulator for performance evaluation of process scheduling policies for embedded real-time operating systems (ERTOS). Arya Bhatta J Math Inf 2010, 2(2), 281-90.

The embedded systems work on real time operating systems (ERTOS). There are many CPU scheduling. policies in general operating systems out of which ERTOS most commonly follow the priority and round robin scheduling. The aim of this research work is to evaluate performance of these scheduling policies. Simulation is adopted as tool to find the best policy that can be implemented to boost the performance of the ERTOS This model is in the form of a set of assumptions concerning operation of a system. The simulator designed accesses the performances of Round Robin, Priority preemptive and non preemptive scheduling policies in terms of average waiting time and average turnaround time for a number of processes.

5 illus, 10 tables, 8 ref

017397   Bansal P;Dev A;Jain S B (Computer Science and Engineering Dep, Amity School of Engineering and Technology, New Delhi, Email: pbansal89@yahoo.co.in) : Automatic speaker identification using Mel-frequency cepstral coefficients. Panjab Univ Res J Sci 2009, 59(1-4), 165-8.

An automatic speaker identification scheme is proposed and developed, to identify or verify a person, by identifying his/her voice, using a novel method. All speaker identification system contains two main phases, training phase and the testing phase. In the training phase the features of the words spoken by different speakers are extracted and during the testing phase feature matching takes place. Feature extractor transforms the raw speech signal into a compact but effective representation that is more stable and discriminative than the original signal: During the recognition phase the extracted features are compared with the template in the database. In the proposed work features used are Mel-frequency cepstral coefficients (MFCC), delta MFCC (DMFCC) and delta-delta MFCC (DDMFCC). In this research Vector Quantization (VQ) is used for speaker modeling process.

3 illus, 7 ref

017396   Arunjay Kumar;Kaushal V (Computer Science Dep, MIET, Mohri, Kurukshetra, Email: arunjay_83egdd@yahoo.co.in) : Economics and information security affects cyber crime. Arya Bhatta J Math Inf 2010, 2(2), 211-16.

It is widely accepted that malware and botnets are established predominately to conduct cyber crime. The purpose of this paper is to paint a broad overview of the linkbetween information security and economics and 10 discuss some research on the link of the CAN SPAM Act of 2003 and the exponential rise of malware, botnets, and cyber crime. Using economic theory, hope to spark an interest in economics as a discipline and to show how perverse economics incentives can give rise to unintended informationsecurity consequences.

8 ref

016353   Janvale G B;Gawali B W;Deore R S;Mehrotra S C;Deshmukh S N;Marwale A V (Computer Science and IT Dep, Dr. B.A.M. Univ, Aurangabad, Maharashtra) : Songs induced mood recognition system using EEG signals. Ann Neurosci 2010, 17(2), 80-4.

Brain computer interfacing is a system that acquires and analyzes neural signals to create a communication channel directly between the brain and the computer. The EEG records the electrical fields generated by the nerve cells. With the help of Fourier Transformation the EEG signals are classified into four different frequency bands. The main purpose of the present paper is to report results related to classification of EEG signals of different people subjected to different conditions. The experiment has been done on 10 subjects having activities related to hearing music chosen from categories of patriotic, happy, romantic and sad songs along with relaxation activity. 19 electrodes have been used under (10-20) International Standard. The δ, θ, α and β components of EEG signals to these activities have been determined. Different statistical methods including linear discriminate analysis have been tested for classification. Result of the Linear Discriminant Analysis (LDA) made four groups of all modes (Relaxation, Happy, Sad, Patriotic and Romantic Song) labeled groupl, Group2, Groups and Group4 of all ten electrodes for Delta, Theta, alpha and Beta frequencies. The study may be used for the development of activities induced mood recognition (AIMR) system from the EEG signal.

5 illus, 5 tables, 10 ref

016352   Gorakshakar A C;Ghosh K (National Institute of Immunohaematology, 13th Floor, New Multistoried Bldg, KEM Hospital Campus, Parel, Mumbai-400 012) : National and ethnic human mutation database: a need of the day. Indian J Hum Genet 2008, 14(3), 75-6.

7 ref

016351   Gadgil N J (NO, Practice School Intern, Tensilica Technologies (India) Pvt. Ltd, Pune) : Processor-optimized design and implementation of sampling rate converter (SRC) blocks. J Coop Univ Res Ind Enterpr 2010, 3(2), 23-34.

Different audio compatible devices work at different sampling rates. There are audio data formats which are standardized for specific applications. In this scenario, sampling rate conversion (SRC) becomes an integral part of a core processing unit. Also, to improve computational efficiency, it is always advisable to process the data at lower sampling rates. Hence, rate alternation unit plays a key role in optimized implementation of any digital signal processing unit. This paper presents an efficient method to design sampling rate converter blocks. Tensilica's HiFi2 Audio Engine instruction set architecture is specifically designed to perform the typical audio processing tasks in an optimized fashion. Exploiting the resources and capabilities of Tensilica's Xtensa^T processor, the core processing loop is optimized with tightly fit instructions. The crux of this design is to exercise a finite impulse response (FIR) filter with the concepts of polyphase decomposition and circular buffering.

7 illus, 5 tables, 11 ref

016350   Bamrara A;Singh G (NO, National Institute of Technology, Uttarakhand-246 174, Email: atulbamrara@gmail.com) : Impact of phishing on financial institutions. J Coop Univ Res Ind Enterpr 2010, 3(2), 35-43.

Modern businesses heavily rely on corporate IT networks and their access with the global Internet as the backbone of their sales, advertising, operation, production and financial systems. Public can hop outside their states and national boundaries to explore vast stores of information and access international opportunities. Computer networks have made the information highly distributed among their divisions, business partners, suppliers, and customers with great efficiency of exchanging information speedily and flawlessly. The E- services have roofed the world economy and are producing amazing results. But, too often IT professionals fail to understand the level of potential risk and liability for dealing with cyber attacks. Cyber attacks on the Organization's MIS are getting higher in the form of Phishing, Pharming, Vishing and so on. It has become a profession and with comparatively low technical skills, a cyber criminal can hack the information and penetrate into the information system. Cyber criminal gangs are increasingly motivated by the potential gains from extortion, theft of credit card details, and abuse of private information. Attackers are now creating global networks that support coordinated criminal activity. All this sophisticated criminal activity has driven up the costs of defense and recovery. The paper finally attempts to focus the impacts of Phishing, a blazing cyber crime for financial institutions and customers as well.

5 illus, 10 ref

015310   Walia E (NO, , NITTR, Sector-26, Chandigarh-160 017, Email: wekta@yahoo.co.in) : New hybrid approach to non-refractive transparency in 3-D graphics. Adv Computnl Sci Tech 2010, 3(2), 97-109.

Transparency is a useful feature in scientific visualization. Transparency can be implemented in either non-refractive or refractive form. Non-refractive transparency rendering is a fundamental issue for interactive visualization. Non-refractive transparency gives more insight of the interior structure of geometric models without the distortion from refraction. This paper firstly presents two major approaches for non-refractive transparency rendering i.e. Alpha-Blending and Screen-Door transparency. Both are widely used transparency techniques. Secondly, a new algorithm is proposed as Hybrid transparency technique to overcome limitations of Alpha-Blending and Screen- Door transparency. As one of the major goals in real-time computer graphics is to achieve sufficient realism of rendered images without compromising rendering speed too much, Hybrid transparency technique gives better visual quality than Screen-Door transparency and less time complexity than Alpha-Blending. The above said algorithms are implemented using widely available VC++ and OpenGL graphics library.

5 illus, 1 table, 13 ref

015309   Visumathi J;Shunmuganathan K L (NO, Sathyabama Univ, Chennai, Email: jsvisu@gmail.com) : Detecting security threats in the router using computational intelligence. Adv Computnl Sci Tech 2010, 3(2), 191-200.

Information security is an issue of global concern. As the Internet is delivering great convenience and benefits to the modern society, the rapidly increasing connectivity and accessibility to the Internet is also posing a serious threat to security and privacy, to individuals, organizations, and nations alike. Finding effective ways to detect, prevent, and respond to intrusions and hacker attacks of networked computers and information systems. This paper presents a knowledge discovery frame work to detect DoS attacks at the boundary controllers (routers). The idea is to use machine learning approach to discover network features that can depict the state of the network connection. Using important network data (DoS relevant features), we have developed kernel machine based and soft computing detection mechanisms that achieve high detection accuracies. We also present our work of identifying DoS pertinent features and evaluating the applicability of these features in detecting novel DoS attacks. Architecture for detecting DoS attacks at the router is presented. We demonstrate that highly efficient and accurate signature based classifiers can be constructed by using important network features and machine learning techniques to detect DoS attacks at the boundary controllers.

2 illus, 5 tables, 11 ref

015308   Venkata Rama Prasad V;Kurupati R (NO, Sree Vidyanikethan Engineering College, Tirupati, Email: vvramaprasaf@rediffmail.com) : Secure image watermarking in frequency domain using Arnold scrambling and filtering. Adv Computnl Sci Tech 2010, 3(2), 237-45.

Digital watermarking has gained importance in recent years in copyright protection and multimedia authentications. In this work an attempt is made to study the effect of using Arnold scrambling and filtering on recovery of binary watermarks in frequency domain using DWT-DCT transforms on satellite and bio-medical images. The method produces improved imperceptibility, robustness and security to the cover image. In the first step, the cover image is decomposed into two levels by DWT transform. Then DCT of the HL (or HH) sub band of the DWT coefficients is computed. The watermark is scrambled using Arnold's scrambling algorithm and embedded in the form of a PN (pseudo random) sequence into the DWT sub-band after computing DCT. The technique is tested on cover images HEAD-MRI and WEATHER-MAP (512x512, 8-bit gray scale) with two binary watermarks of size 50x20 and 32x32. The watermarked images are tested for robustness against JPEG compression and noise attacks.

5 illus, 16 ref

015307   Suresh Babu M;Ashok Babu K;Kesavan Pillai G (NO, Sri Indu College of Engineering, Hyderabad, Andhra Pradesh, Email: natural.suri@gmail.com) : Efficient VLSI architecture for in-place computer discrete wavelet packet transform. Adv Computnl Sci Tech 2010, 3(2), 137-46.

This brief presents a novel very large-scale integration (VLSI) architecture for discrete wavelet packet transform (DWPT). By exploiting the in-place nature of the DWPT algorithm, this architecture has an efficient pipeline structure to implement high-throughput processing without any on-chip memory/first-in first out access. A folded architecture for lifting-based wavelet filters is proposed to compute the wavelet butterflies in different groups simultaneously at each decomposition level. According to the comparison results, the proposed VLSI architecture is more efficient than the previous proposed architectures in terms of memory access, hardware regularity and simplicity, and throughput. The folded architecture not only achieves a significant reduction in hardware cost but also maintains both the hardware utilization and high-throughput processing with comparison to the direct mapped tree-structured architecture.

4 illus, 3 tables, 11 ref

015306   Sasikala S;Prema S (Computer Science & Applications, KSR College of Arts & Science, Tiruchengode, Email: sasi_sss123@rediffmail.com) : Massive centralized cloud computing (MCCC) exploration in higher education. Adv Computnl Sci Tech 2010, 3(2), 111-18.

The world has changed and we have to change with it. Researchers are no longer limited by ideas or knowledge but rather by access to the computing resources required to execute the experiments and analyze the results. If there is a centralized cloud which is organized by government it'll be useful. Such resource could stabilize the academic playing field. Smaller institutions have a limited access to the resources. We could not foresee that from where innovative ideas could stimulate. But this centralized cloud could improve the collaboration between the researchers which would result in a foster R&D. And of course, education is one of the factor to determine the wealth of the nations and mobility of the citizens, we|have to upgrade ourselves to compete | with others. Here in this paper, I have discussed cloud computing, its aspects, some ongoing clouds, future scenarios and a sculpt of centralized cloud for higher education.

1 illus, 3 ref

015305   Sainath N;Muralikrishna S;Srinivas P V S (CSE Dep, Jaya Prakash Narayan College of Engineering, Mahabubnagar-509 001, Email: natukulasainath@gmail.com) : Framework of cloud computing in the real world. Adv Computnl Sci Tech 2010, 3(2), 175-90.

Cloud computing is a paradigm shift in which computing is moved away from personal computers and even the individual enterprise application server to a 'cloud' of computers. A cloud is a virtualized server pool which can provide the different computing resources of their clients. Users of this system need only be concerned with the computing service being asked for. The underlying details of how it is achieved are hidden from the user. The data and the services provided reside in massively scalable data centers and can be ubiquitously accessed from any connected device all over the world. Cloud computing is the style of computing where massively scaled IT related capabilities are provided as a service across the internet to multiple external customers and are billed by consumption. Many cloud computing providers have popped up and there is a considerable growth in the usage of this service. Google, Microsoft, Yahoo, IBM and Amazon have started providing cloud computing services. Amazon is the pioneer in this field. Smaller companies like SmugMug, which is an online photo hosting site, has used cloud services for the storing all the data and doing some of its services. Cloud Computing is finding use in various areas like web hosting, parallel batch processing, graphics rendering, financial modeling, web crawling, genomics analysis, etc.

3 ref

015304   Rewatkar L R;Lanjewar U A (NO, Zulekha College of Commerce, Science and Technology, RTMNU Nagpur, Nagpur, Maharashtra, Email: leela_rewatkar@rediffmail.com) : Data management in market-oriented cloud computing. Adv Computnl Sci Tech 2010, 3(2), 217-22.

Cloud computing infrastructure enables companies to cut costs by outsourcing computations on-demand. However, clients of market-oriented cloud computing services currently have no means of verifying the confidentiality and integrity of their data and computations. This paper discuss the data management issues in marketOoriented cloud computing like Amazon web services founded in 1994 and SalesForce.Com founded in 1999. This paper attempts to narrow the scope of potential database application to consider for market-oriented cloud deployment. It decides which data management applications are best suited for deployment on top of cloud computing infrastructure. In order to do this, we discuss three characteristics of a cloud computing environment that are most relevant to the discussion.

16 ref

015303   Ramaswamy V;Poornima (Information Science and Engineering Dep, B I E T, Davangere-577 004, Email: poornima_teju@rediffmail.com) : Edge colouring of a fuzzy graph. Adv Fuzzy Math 2009, 4(1), 49-58.

In this paper we,consider edge coloring of a fuzzy graph. Analogous to vertex coloring given in [4], we introduce the concepts of (d, f) extended k-coloring and (d, f) edge chromatic number. With examples, we show that some of the results of edge coloring of a crisp graph do not carry over to our set up. We also develop an algorithm for determining the (d, f) edge chromatic number of a fuzzy graph.

4 illus, 7 tables, 4 ref

015302   Praveen Kumar;Chhokar S (Computer Science Dep, U.P. Technical Univ, Raj Kumar Goel Institute of Technology, Ghaziabad, Uttar Pradesh, Email: praveenrama_cs@yahoo.co.in) : Approach from knowledge dust to gems (Knowledge management). Adv Computnl Sci Tech 2010, 3(2), 165-74.

Most businesses rely on the fact that their employees possess relevant knowledge and that they can apply it to the task at hand. The problem is that this knowledge is not owned by the organization. It is owned and controlled by its employees. Maintaining an appropriate level of knowledge in the organization is a very important issue. It is, however, not an easy task for most organizations and it is particularly problematic for software organizations, which are human and knowledge intensive. Knowledge management is a relatively new area that has attempted to address these problems. This paper introduces an approach called the Knowledge Dust to Gems approach. This approach addresses some of the issues with knowledge management by providing low-barrier mechanisms to "jump start" the experience base. This approach allows the experience base to become more useful more quickly than traditional approaches.

3 illus, 7 ref

015301   Prasad B D C N;Krishna Prasad P E S N;Yeruva S;Nageswara Rao S (Computer Applications Dep, V.R. Siddhartia College of Eng. Vijayawada, Andhra Pradesh, Email: bdcnprasad@gmail.com) : Testing sedimentary basins using adaptive resonance theory. Adv Computnl Sci Tech 2010, 3(2), 201-7.

The objective of this paper is to present identification and recognition of Magneto-telluric data for sedimentary basins using Adaptive Resonance Theory (ART2). The ART is an unsupervised learning algorithm where the network is provided with inputs but not with desired outputs. The system itself must then decide what features it will use to group the input data. Several sets of data consisting of 17 phases and 17 apparent resistivity values and their respective tag values are given. These sets of data are used for training the network, and other sets of data are used to test the network. The testing will result in the approximate identification of the data patterns with tag value of 1 where there is sediment of hydrocarbon and a tag value of 0 where there is no sediment of hydrocarbon in the given data set. Various techniques used in this experiment are creating the pattern files, normalizing the files, training the neural network, adjustment of weights and parameters, network file creation and finally testing of the field data for the pattern identification. The recognition rate in the proposed system lies between 95% and 100%.

5 ref

015300   Kekre H B;Athawale A;Sarode T K;Sagvekar K (MPSTME, NMIMS Univ, Vile-parle (W), Mumbai-56, Email: hbkekre@yahoo.com) : Increased capacity of information hiding using mixed codebooks of vector quantization algorithms: LBG, KPE and KMCG. Adv Computnl Sci Tech 2010, 3(2), 247-58.

Data hiding involves embedding secret data into various forms of digital media such as text, image, audio, and video. With the rapid growth of network communication, data-hiding techniques are widely used in protecting copyright, embedding captions and communicating secretly. In this paper, we propose a data hiding method based on VQ compressed images. Codebooks of secret message & cover images are combined using shuffle algorithm. Experimental results indicate that our proposed scheme provides 100% hiding capacity or more that means secret message can be of same or more size than cover image and better image quality compared with existing schemes based on VQ compressed images.

3 illus, 2 tables, 33 ref

015299   Kath S;Manoj Kumar;Sharma A (NO, DAV Institute of Engineering & Technology, Jalandhar, Email: sankath@gmail.com ) : CDN DNS - an effieicnt DNS request routing technique in content delivery networks. Adv Computnl Sci Tech 2010, 3(2), 147-54.

Presents a new DNS based request routing technique in CDNs to decrease delay - Round Trip Time (RTT), throughput, and packet loss. The existing DNS Request Routing only emphasizes the domain name resolution with the web server IP address. It does not consider location of the client, type of the content to select the server. To solve the above problem, this paper puts forward a modified DNS requet routing technique for CDNs based upon client location and type of the content to select the appropriate CDN server or surrogate. Further this technique reduce one cycle of request routing by forwarding client request directly to CDN server instead of sending back resolved IP address to the client.

6 illus, 2 tables, 8 ref

015298   Kamath R S;Kamat R K (Computer Studies Dep, Shahu Institute of Business Education and Research, Kolhapur, Email: raj_kamat@yahoo.com) : Low cost 3D CAD model visulization interface for manufacturing industries. Adv Computnl Sci Tech 2010, 3(2), 155-64.

In the mechanical industries the virtual prototyping has become an important process during manufacturing of components. Immersive visualization changes the dynamic of manufacturing by virtual prototyping instead of physical prototyping. Various softwares have been developed for design, viewing and etc. High performance visualization tool for viewing of 3D CAD on general-purpose computer is a basic requirement of rapid prototyping. This paper has documented the development of an efficient, easy to use, cost effective visualization system for manufacturing industries. This provides computer-generated realism to decision makers and development team for their collaborative work.

10 illus, 16 ref

015297   Jamwal S S;Devanand (PG Dep of Computer Science and IT, Jammu Univ, Jammu, Jammu and Kashmir, Email: jamwalsnj@gmail.com) : Incremental and serial garbage collector in small footprints. Adv Computnl Sci Tech 2010, 3(2), 209-15.

The Java virtual machine's heap stores all objects created by a running Java application. Objects are created during the scope of the program with different methods and instructions, but never freed explicitly by the code. Garbage collection is the process of automatically freeing objects that are no longer referenced by the program. Garbage collection techniques lead to long and unpredictable delays and are therefore unsatisfactory in a number of settings, such as interactive systems, where non-disruptive behavior is of paramount importance. In this paper we analyzed how memory allocation and garbage collection is affected in multithreaded environments with respect to the incremental and serial garbage collector of JDK5. Our work in this paper is focused on the behavior of incremental garbage collector (INC) and Serial garbage collector (SR) in small footprints. It is observed that the memory reclamation by the incremental garbage collector is 58.83% more than the serial collector. The average time spend for the collection in case of serial garbage collector is 61.05% more than its counterpart. The memory collection in IInd cycle of incremental garbage collector 346.59% more than the serial garbage collector. JVM is not initialized below 5mb of stack for INC but initialized at 1mb for SR GC.

2 tables, 11 ref

015296   Bhupinder Kaur;Mittal U (NO, HCTM, Kaithal, Email: bhupinderkaur@mail.ru) : Optimization of TSP using genetic algorithm. Adv Computnl Sci Tech 2010, 3(2), 119-25.

Genetic algorithms are an optimization technique based on natural evolution. They include the survival of the fittest idea into a search algorithm which provides a method of searching which does not need to explore every possible solution in the feasible region to obtain a good result. Genetic algorithms are based on the natural process of evolution. We have solved TSP problem using Matlab 7.0.4. The TSP is defined as a task of finding of the shortest Hamiltonian cycle or path in complete graph of N nodes.

1 illus, 9 ref

015295   Amudha T K (CSE Dep, SRM Univ, Chennai-89, Email: amudhatk@gmail.com) : Agile-software development methodology. Adv Computnl Sci Tech 2010, 3(2), 127-35.

AGILE is one of the software development methodology used in the current scenario of information technology. This methodology is mainly concentrated with how the cost and the time of the industrial people are utilized effectively. How this methodology evolved from the previous methodology.

6 illus, 8 ref

024755   Bansal A;Vinod Kumari;Ashok Kumar;Mohinder Singh (NO, Defence Scientific Inf and Documn Cent (DESIDOC), Metcalfe House, Delhi-110 054) : Securing the future of information: Digitisation and preservation of documents in e-Format. DESIDOC Bull Inf Technol 2005, 25(1), 19-26.

Computers waved a (magic) wand and the whole process creation, access, delivery and preservation of information changed for the literary, scholarly, artistic, scientific and domestic community. Computers transformed the analogue world into the digital world of 0 and 1. Digitisation came as a most wonderful and welcome tool in hands of libraries, museums, archives, societies, publishers, and others for preserving billions of paper/analogue documents in digital format for retaining their original look as well as with a point of view of therir future relevance and potential. Preservation is the activity of protecting something from loss or danger. Digital preservation incldues the preservation of print and non print material in digitised form for effective, efficient and purposeful use. Any library can't digitise all its resources. What should it do? What should it preserve? Why should and for whom should it preserve? How this ever changing digitisation scenario is putting pressure on librarians/archivists, etc. Attempts to seek answers to these questions. Explores the concept of preservation by digitisation, the need of digital preservation, and the problems of digital preservation.

7 illus, 6 ref

024754   Ashwani Kush;Ram Kumar (Computer Sci Dep, Univ Coll, Kurukshetra, Kurukshetra-132 119, Email: akush20@rediffmail.com ) : Wireless network security issues. DESIDOC Bull Inf Technol 2005, 25(1), 13-8.

In the time span of just a few years, wireless networking has emerged from a novelty to revolution. The speed with which wireless networking has caught on is not surprising owing to large bandwith and range of several hundred feet. Moreover multiple wirelss access points can be easily installed on same network to cover more areas. Main challenge in design of these network is their exposure to security attacks. Routing protocols for wireless networks are still an active research area. There is no single standard routing protocol. Considered common security threats into account to provide guidelines to secure routing protocols. Studies the threats on wireless networks and security goals to be achieved.

31 ref

023744   Geethalakshmi S N;Ramani A V (Computer Sci Dep, Avinashilingam Deemed Univ, Coimbatore-641 043) : Improving the predictive ability of COCOMO II estimation model. Res Highlight 2005, 15(3), 142-46.

The objective was to enhance COCOMO II effort estimation model with these task assignment factors. The results of the studied model indicate that task assignment factors can be used to improve the predictive ability of effort estimation model. Use of the task assignment factors provided an improvement in COCOMO II effort estimation model. Development efforts was found to decrease with compressing the development schedule of modules, breaking work assignments down into tasks that can be accomplished individually and allowing teams to focus on a small number of tasks.

2 tables, 6 ref

022705   Suman Y;Kharbanda V P (Natn Inst of Sci Technol and Dev Stud, , New Delhi-110 012, Email: geetyogesh@yahoo.com) : Internet diffusion in India and China - who holds the edge. J scient ind Res 2005, 64(5), 339-46.

Study highlights the importance of the Internet access in the context of India and China, which together are home to approx 40% of world's population. It compares the recent trends in the growth of Internet users and Internet connections in the two countries. It explores the problems encountered in its proliferation and examines the factors, which might play crucial role in its future growth. China holds the clear edge over India in terms of number of Internet users and Internet hosts; India is better rated when it comes to e-readiness. Internet is still out of reach of rural population in both the countries and both need to have low cost local language based computing devices for the use of rural population to access Internet.

2 illus, 12 tables, 23 ref

022704   Shin J;Park Y (Dep of Industrial Engng, Seoul Natn Univ, San 56-1, Shilim-Dong, Kwanak-Gu, Seoul, 151-742, Korea, Email: parkyt@cybernet.snu.ac.kr) : Generation and application of patent claim map: Text mining and network analysis. J Intellect Prop Right 2005, 10(3), 198-205.

Despite the fact that patents are under intensive scrutiny for years, patent claim, the most ample source of information has been relatively unexplored. Patent claims mean the right over a patent. Their overlaps by subsequently granted patents indicate the erosion of patent rights. In that regard, the issue of patent valuation and competitor strategy is very closely related with it. In addition, claims could be used to recognize technology relatedness. Therefore, in this research, an exploratory method to deal with patent claims using text-mining and network analysis has been proposed. First, a claim overlap profile is constructed to identify whether a specific claim overlaps another by applying text mining and domain expert knowledge. Secondly, network analysis is used to generate three kinds of patent claim map. This could help researchers, R&D managers and policy makers to evaluate patents and analyse competitors more accurately, and develop patent strategy more efficiently. In the long run, the patent claim profile and map could contribute to the overall technology management including new technology development, strategic positioning of technology and technology alliance.

4 illus, 4 tables, 38 ref

022703   Priti Shankar (Computer Sci and Automn Dept, IISC, Bangalore-560 012, Email: priti@csa.iisc.ernet.in) : Expander codes: The sipser Spielman construction. Resonance 2005, 10(1), 25-40.

Expander graphs are graphs in which every set of vertices has an unusually large number of neighbours. It is a remarkable fact that graphs of this kind exist. Even more remarkable is the spectrum of applications of these graphs, ranging from providing new insights in the field of computational complexity theory to the solution of problems in communication. In the article author has show how expander graphs can be used for designing efficient error correcting codes which have fast decoding algorithms.

5 illus

022702   Nanavati S P;Panigrahi P K (Natn PARAM Supercomputing Facility, Cent for Dev of Advd Computing (C-DAC), Pure University Campus, Ganesh Khind, Pune-411 007, Email: sachinn@cadacindia.com) : Wavelets: applications to image compression-I. Resonance 2005, 10(2), 52-61.

Digital imaging has had an enormous impact on scientific and industrial applications. Uncompressed images require considerable storage capacity and transmission bandwidth. The solution to this problem is to compress an image for desired application. Wavelet transform has recently emerged as the tool of choice for image compression. In the article authors discuss the basic princeples underlying compression on images and point out the advantages of wavelet transform over the previously used discrete cosine transform.

3 illus

022701   Nanavati S P;Panigrahi P K (Natn PARAM Supercomputing Facility, Cent for Dev of Advd Computing (C-DAC) Pune Univ Campus, Ganesh Khind, Pune 411 007, Email: sachinn@cdacindia.com) : Wavelets: Applications to Image Compression-II. Resonance 2005, 10(3), 19-27.

Author explain here, the wavelet based thresholding procedure, one of the key factors behind the successful application of wavelets in image compression. It then elaborate on quantization and go on to outline the basic ideas underlying Huffman coding, the other important tool for data compression.

5 illus

022700   Ganley P (IP/IT Dep, , Baker & McKenzie, 100 New Bridge Stree, London EC4V 6JA) : The internet, creativity and copyright incentives. J Intellect Prop Right 2005, 10(3), 188-97.

The copyright industries savour their role as critical intermediaries in the copyright supply chain. To this end, they are continually seeking to strengthen their legal entitlements by arguing that stronger copyright incentives fuel future creative action. But the reality of creativity is different from the linear economic reward/action relationship that these industries promote. This reality has been brought into sharp focus by the seemingly limitless creativity that the Internet has unleashed. Much of this creativity occurs without reference to the incentive structure provided by copyright law and demonstrates the potential redundancy of several existing industry functions. The result has been a seemingly intractable tension between established industries and emergent modes of production and dissemination. The clearest examples of this tension are the current debates over the utility of peer-to-peer technology and the competition between proprietary and open source software development models. The tension, and the realities of creativity that underpin it are the subject of the paper. A diverse range of creative experiments facilitated by digital networked technology is considered and used as a backdrop to a general discussion on some of the areas where reforms to copyright's existing incentive structure are most needed.

46 ref

022699   Bharadwaj P (NO, , 273, 10th Cross, NR Colony, Bangalore-560 019, Email: prashant.bharaduraj@wipro.com) : Quality of Service in the Internet. Resonance 2005, 10(3), 57-70.

Internet is currently the most popular technology for global communication and information retrieval. Hence, networking technologists involved in Internet research have the responsibility of developing technologies that support multimedia networking applications such as audio and video streaming, video emails, real-time interactive audio and video conferencing and virtual reality. The article discusses the underlying mechanisms that have been developed which augment packet switching in supporting the smooth functioning of these real-time applications.

021651   Meenakshi B (Honeywell Technol Solutions Lab, , 151/1, Doraisanipalya Bannerghatta Road, Bangalore-560 076, Email: meenakshi.balasubramanian@honeywell.com) : Formal verification. Resonance 2005, 10(5), 26-38.

Formal methods which are techniques for specifying and verifying complex software and hardware systems are discussed. A few examples of successful industrial use of these are also presented.

3 illus, 2 tables

021650   Goswami D (Quantum Computing, Femtosecond Lab, Indian Inst of Technol, Kanpur-208 016, Email: dgoswami@iitk.ac.in) : Quantum computation with ultrafast laser pulse shaping. Resonance 2005, 10(6), 8-14.

Quantum computing exploits the quantum mechanical nature of matter to exist in multiple possible states simultaneously. Building up on the digital binary logic of bits, quantum computing is built on the basis of interacting two-level quantum systems or `qubits' that follow the laws of quantum mechanics. Addressability of the quantum system and its fragility to fidelity are the major issues of concern, which if addressed appropriately, will enable this new approach to revolutionize the present form of computing

1 illus