000005   Patel M D;Ratheesh M P;Prakasha M S;Salunkhe S S;Vinod Kumar A;Puranik V D;Nair C K G (Environmental Assessment Div, BARC, Trombay, Mumbai-400 085) : Multi-detector environmental radiation monitor with multichannel data communication for Indian environmental radiation monitoring network (IERMON). BARC Newsl 2011, 320, 31-4.

A solar powered system for online monitoring of environmental radiation with multiple detectors has been designed, developed and produced. Multiple GM tube detectors have been used to extend the range of measurement from 50 nano Gy/hr to 20 Gy/hr and to enhance the reliability of the system. Online data communication using GSM based and direct LAN based communication has been incorporated. Options for use of power supply from mains powered and battery powered have been enabled. Care has been taken to make it weather-proof, compact, elegant and reliable. The development is a part of the ongoing program of country-wide deployment of radiation monitors under "Indian Environmental Radiation MOnitoring Network (IERMON).

3 illus, ref

000004   Arya V S;Raj Kumar;Hooda R S (NO, Haryana Space Applications Centre (HARSAC), Hisar-125 004, Email: aryaharsac@gmail.com) : Evaluation and geo-database creation of watersheds in Siwaliks, Haryana. Curr Sci 2010, 98(9), 1219-23.

An evaluation for the development work done in the two watersheds, viz. Bunga and Dabkauri in Panchkula District, Haryana was carried out for 2004 and 2007. Satellite digital data of LISS-IV sensor for 2004 and merge product of LISS-III - 1 - and PAN for 2007 was used. The data was interpreted for their land use/land cover classes for both the years. The data shows that there is an increase of 33.93% in crop land area. There is a substantial decrease of 97.84% in agricultural fallow land, i.e. land without scrub and sparse vegetation on hills also decreased during the period. Dense vegetation area, i.e. forest plantations on the hills and in the Piedmont area was increased. It was observed that a total of 33 water harvesting structures were constructed between 2004 and 2007.

5 tables, 7 ref

024801   Panda S P;Gupta S;Kaushik U (Information Technology Dep, Dronacharya College of Engineering, Gurgaon-123 506, Email: s.panda@dronacharya.info) : Decision making under uncertainty: a dynamic perspective with temporal reasoning. Dronacharya Res J 2011, 3(1), 127-32.

Making decision is not easy for an immortal agent. Decision theory describes how a rational agent should act. Even today, human (ir) rationality is the subject of intensive investigation. Decision theory allows us to build rational agents for uncertain worlds. In this paper we examine the performance of theories of decision making under uncertainty fron the perspective of time slice. Main goal of this paper is to examine the issues such as the environmental systems, the spatial relationships between the environmental goal area and the nearby environmental areas and the temporal relationships between the current state and the past states of the environmental system, and study new trends for future research within the varied fields.

2 illus, 1 table, 17 ref

024800   Mattoo R;Bagga S K;Rupal A (Mechanical Engineering Dep, Dronacharya College of Engineering, Gurgaon-123 506, Email: rajesh_sakshi2003@yahoo.co) : Effect of wear at joints in four bar mechanism using ANN. Dronacharya Res J 2011, 3(1), 68-71.

Analyzing the wear phenomenon by considering the combined and Interactive effect of several identified parameters, particularly when the variation of parameters is simultaneous, forms the main theme for present investigation In this paper, the objective was to estimate the growth of clearance in the joints of a four bar chain with specific condition of the static and inertial load. The objective is also to develop neural network based on the readings obtained through experiments and to ascertain the clearance growth due to wear at the joints under the variable load. In the investigation, the attempt has been made to develop trained neural network using back propagation method. Experimental findings are synthesized in neural network.

1 table, 6 ref

024799   Manoj Kumar;Patel R B;Parvinder Singh (Computer Science and Engineering Dep, Deenbandhu Chhotu Ram Science and Technology Murthal Univ, Sonipat-131 039, Email: manojsarasyiya@gmail.com) : Quality of service evaluation of IPTV using split flow based approach. Dronacharya Res J 2011, 3(1), 16-22.

Internet protocol TV (IPTV) is predicted to be the key technology winner in the future. It has, however, stringent quality of service (QoS) requirements. WhenlPTV traffic shares the network resources with other traffic like data and voice, how to ensure their QoS and efficiently utilize the network resources is a key and challenging issue. In this paper, Split Flow Based Approach is suggested to evaluate Quality of Service in OPNET Modeler 11.5 simulator. The MPEG video compression technology standard is used on which the different frame of video is splited and each flow is send to network on its demand. This approach quantifies the performance of IPTVsystems and derives the admission regions to ensure the QoS of IPTV traffic.

8 illus, 1 table, 13 ref

024798   Gupta M;Yadav R (Computer Science & Engineering Dep, Dronacharya College of Engineering, Gurgaon, Email: gupta.meenu5@gmail.com) : Alternate path approach for transferring data safely. Dronacharya Res J 2011, 3(1), 137-141.

A mobile ad hoc network (MANET) is a collection of autonomous nodes or terminals which communicate with each other by forming a multi-hop radio network without the aid of any established infrastructure or centralized administration such as a base station. The ad-hoc networks provide lack of secure boundaries. The Central point of intruder attack is the algorithmic way of implementation by the user to transfer data over the network. In a simple ad-hoc network, we generally use the shortest Path algorithm to transfer data between nodes. But this transmission gives the no. of problems: (1) Intruder attack (2) Centralized Load. The consequences are less security and less efficiency. We are working to search an Intruder Safe path that is not shortest but closer to the shortest.

3 illus, 1 table, 12 ref

024797   Garg P;Anand Rohit (Electronics and Communication Engineering Dep, N.C College of Engineering, Israna Panipat, Email: priyanka27@gmail.com) : Energy efficient data collection in wireless sensor network. Dronacharya Res J 2011, 3(1), 41-45.

Wireless sensor networks are the networks that can sense, calculate and then communicate the data. To collect the data at sensor nodes consumes a lot of energy but sensor nodes are energy constraint. In this paper we will discuss an algorithm, which is energy efficient by transmission of minimum number of reference data, (i.e. minimum number of reference data transmission) number of bits required to transmit that data will also reduced and by placement of nodes in the network in such a position that the distribution of energy will balance. It will provide efficient energy consumption in case of node failure also.

1 illus, 11 ref

024796   Dua H S;Singla C R;Chopra Y P (Electronics and Communication Engineering Dep, Dronacharaya College of Engineering, Gurgaon-123 506, Email: hodece@dronacharya.info) : Electronic warfare. Dronacharya Res J 2011, 3(1), 46-52.

Electronic warfare or EW is the use or control of electromagnetic energy either in defense, or for the purpose of a military attack, on an enemy. Electronic Attack, 'Electronic Protection' and 'Electronic warfare support' are the three principle components of EW. The purpose of EW is to deny the opponent the advantage of, and ensure friendly unimpeded access to the EM spectrum. Stealth technology is being used to reduce the Radar cross section of a target such as aircraft to avoid detection. Other techniques include new passive jamming systems namely multi-wave dipole reflectors (chaff) and the use of Radar absorbent materials for reducing combat equipment visibility. In EW, Jammers are being used to jam analog communication, digital communication as well as cell phone communication. Infact, in today's high-tech environment, the electronic warfare is something that cannot be ignored since in the final analysis electronic warfare will decide the outcome of future military conflicts.

2 illus, 12 ref

024795   Dharminder Kumar;Surender Singh (Computer Science & Engineering Dep, Guru Jambheshwar Science & Technology Univ, Hisar, Email: dr_dk_kumar_02@yahoo.com) : Performance evaluation study of wi-fi using GloMoSim. Dronacharya Res J 2011, 3(1), 12-15.

Wi-Fi stands for wireless fidelity. It is also knows as 802.11 standard of IEEE, wireless LAN and wireless Ethernet. A Wi-Fi network can be built around limited coverage area like as college campus, hostel campus etc. It provides high bandwidth connectivity in a LAN environment that is suitable for most data applications. However it does not meet QoS requirements for real-time data traffic applications such as voice and video transmissions. Frequency Hopping Spread Spectrum or Direct Sequence Spread Spectrum or Diffuse Infrared is used by this technology for transmission of data. In this paper we have designed various scenarios using the GloMoSim simulator to study the performance of Wi-Fi in delivering traffic under different operational conditions. The results showed how different factors such as load and mobility might affect the performance of Wi-Fi. The simulation input parameter is mobility and output parameter are end to end delay, packet delay ratio, delay jitter and throughput were considered as the performance measures.

5 tables, 19 ref

024794   Bharti V;Soni Y (Computer Science & Engineering Dep, Dronacharya College of Engineering, Gurgaon-123 506, Email: mevishalbharti@yahoo.com) : Logical aspects towards implementation of test care prioritization. Dronacharya Res J 2011, 3(1), 133-6.

Test case prioritization techniques schedule test cases for execution in an order that attempts to maximize some objective function. This paper will aim at devising a naive algorithm to assign the priority to a test case. Algorithm will be based on the end to end control flow graph of the software. Generated paths will be arranged in descending order of weights assigned to them. Weight assignment will be carried out on basis of the probability of a path to be taken during the course of the software run.

11 ref

012638   Jones N (Univ of Liverpool, , Liverpool L69 3 GH, UK) : On the mass impact loading of ductile plates. Def Sci J 2003, 53(1), 15-24.

Examines the response of circular and square plates struck by a rigid mass at the plate centre with a sufficient initial kinetic energy of produce large inelastic deformations. A simplified analysis, which retains finite-deflection effects and assumes that the plates are made of a rigid, perfectly plastic material, provides a relatively simple theoretical solution for the miximum permanent transverse displacement and the response duration. It transpires that the theoretical predictions give reasonable agreement with the maximum permanent transverse displacement recorded in several experimental studies on fully clamped, circular and square ductile metal plates. The final theoretical expressions for the behaviour are easy to use and ideal for preliminary design purposes and would be sufficiently accurate for final designs in some applications.

7 illus, 28 ref

023786   Su H;Sing L C;Mustapha Nheng ; (NO, Facuty of Information Technology, Multimedia Univ, Cyberjaya, Maysia) : Bridging XML and relational database: mapping choices and performance evaluation. IETE Tech Rev 2010, 27(4), 308-17.

XML has emerged as the standard for information representation over the Internet. It is critical to store and query XML data to exploit the full power of the new technology. However, most enterprises today have long secured the use of relational databases. Thus, simply replacing relational databases with a pure XML database is not a good choice. It is thus crucial to map XML data into relational data. This paper studies the performance evaluation of storing XML documents into relational databases and identifies which mapping approach is best suited for which business environment. The performance results for all approaches are presented and a number of interesting results obtained from these evaluations are highlighted.

5 illus, 12 tables, 17 ref

023785   Singla R K;Harish Kumar (DCSA, Panjab Univ, Chandigarh-160 014, Email: rksingla@pu.ac.in) : Characteristics and complexity comparison of best effort address auto-configuration protocols for mobile AD-HOC networks. Panjab Univ Res J Sci 2008, 58(1-4), 231-7.

Mobile Ad-hoc Network (MANET) is an infrastructure less, multi-hop wireless network of mobile nodes. One of the active research areas in MANET is address auto-configuration for participating nodes. Due to mobility of nodes, topology of network can change unpredictably which results in certain issues like partitioning, merging, duplicate address detection, security/authenticity etc., related to address allocation. Many protocols, based on different concepts like best effort, decentralized, name/map based, have been proposed to solve these problems. Author of each proposed solution argues that their strategy gives an improvement over a number of different other techniques proposed in the literature. In this paper, we discuss characteristics and complexity comparison of best effort address auto-configuration protocols for MANET.

3 tables, 10 ref

023784   Parminder Kaur;Kuljit Kaur;Hardeep Singh (Computer Science and Engineering Dep, Guru Nanak Dev Univ, Amritsar-143 005, Email: parminderkaur@yahoo.com) : Component-based software development process state-of-the-art. Panjab Univ Res J Sci 2008, 58(1-4), 239-48.

The evolution from object-oriented systems to component-oriented systems verifies the fact that a new system can be developed with the use of existing components instead of developing it from scratch. However, developing software components that can be adapted to diverse reuse situations is challenging. Component-Based Software Engineering (CBSE) not only focuses on system specification and development but also focuses on component acquisition and integration process. Component-Based Development Life Cycle consists of a set of phases like identification and selection of components based upon requirements, integration and assembling of selected components and updating of system as components evolve over time with newer versions. This paper illustrates the requirement and importance of component-based development environments (CBDE). The objective of this paper is to provide a better understanding of various techniques related with component-based development.

3 illus, 1 table, 48 ref

023783   Mangai U G;Samanta S;Das S;Chowdhury P R (VP Lab, Computer Science and Engineering Dep, Indian Institute of Technology Madras, Chennai-600 036) : Survey of decision fusion and feature fusion strategies for pattern classification. IETE Tech Rev 2010, 27(4), 293-307.

For any pattern classification task, an increase in data size, number of classes, dimension of the feature space, and interclass separability affect the performance of any classifier. A single classifier is generally unable to handle the wide variability and scalability of the data in any problem domain. Most modern techniques of pattern classification use a combination of classifiers and fuse the decisions provided by the same, often using only a selected set of appropriate features for the task. The problem of selection of a useful set of features and discarding the ones which do not provide class separability are addressed in feature selection and fusion tasks. This paper presents a review of the different techniques and algorithms used in decision fusion and feature fusion strategies, for the task of pattern classification. A survey of the prominent techniques used for decision fusion, feature selection, and fusion techniques has been discussed separately. The different techniques used for fusion have been categorized based on the applicability and methodology adopted for classification. A novel framework has been proposed by us, combining both the concepts of decision fusion and feature fusion to increase the performance of classification. Experiments have been done on three benchmark datasets to prove the robustness of combining feature fusion and decision fusion techniques.

5 illus, 4 tables, 66 ref

023782   Mahajan J;Sharma V;Devanand;Mansotra V (Computer Engineering Dep, Govt. College of Engg. & Technology, Jammu) : Effect of team composition in development effort estimation having reusable components. Panjab Univ Res J Sci 2008, 58(1-4), 213-16.

In software engineering there is a need for developing and using paradigms that will significantly promote decrease in efforts for developing software products, increase in quality of software products and reduce time-to-market the software product. Decreased efforts and increased quality will help in decreasing the overall cost of software and also decrease the time-to-market of the software. All the work in the field of software reuse has concentrated mainly upon the amount of reuse and the libraries involved. The objective of this work is to implement a model for analysis and assessment of software reuse based on the values of reused code, amount of glue code and composition of team developing the application. It justifies the effect of the team composition, interconnection standards and the component scale of the libraries on the productivity and quality of the developed application.

10 ref

023781   Lin Z;Wang H (NO, School of Information Science and Technology, Southwest Jiaotong Univ, Chengdu-610 031, People's Republic of China) : Efficient image encryption using a chaos-based PWL memristor. IETE Tech Rev 2010, 27(4), 318-25.

An image encryption algorithm based on the chaotic system has been increasingly used, but the disadvantages of small key space, weak security in low dimensional chaotic cryptosystems, simple chaotic system, and inconvenient for hardware implementation, are obvious. This paper presents a new image encryption algorithm based on chaos with the PWL memristor in Chua's circuit. This encryption algorithm includes two main operations of image scrambling and pixel replacement. Simulations show that the key space is large, and the attacker cannot decrypt an encrypted image without the correct key. The encryption algorithm has high-level security.

11 illus, 3 tables, 18 ref

023780   Hamid M A (Information and Communications Engineering Dep, Hankuk Univ of Foreign Studies, Yongin, Gyeonggi-499 791, Korea) : Provisioning fairness for data collection in wireless sensor networks. IETE Tech Rev 2010, 27(4), 326-35.

The well-known many-to-one data routing paradigm in wireless sensor networks (WSNs) demands non-uniform medium access and forwarding strategy to achieve the ultimate node level fairness. Since nodes closer to the sink have more traffic than that of far-away nodes, close-by nodes need to employ different frequencies of medium access and forwarding probability such that the sink receives almost equal number of packets from all the nodes in the network. In this paper, we design a distributed fair data collection protocol where the nodes can decide their medium access and packet forwarding strategies within the WSN such that a fair throughput can be enjoyed by each node irrespective of the node's distance from the sink. We demonstrate the effectiveness of our solution through simulations and results show that the proposed protocol ensures the fair delivery of packets, improves throughput, and reduces the end-to-end delay for the different WSN scenarios under study.

8 illus, 1 table, 25 ref

023779   Gedam V K;Khamborkar A K;Khot P G (Statistics Dep, Pune Univ, Pune) : On queueing network: a heterogeneous markovian queueing model (M/M/C₁)(∞/FIFO):(M/M/1)/∞/FI FO). Vidarbha J Sci 2011, 6(1-2), 53-5.

The concept of Queueing network is vital. Many authors emphasis the importance of queueing network in various directions. In the present paper we propose a heterogeneous Queueing model wherein the tagging of (M/M/C]):(M/M/1). Obtained the steady state solution; Average no. of customers in the system: Average Queue length; Average time spent in Queue; Average time spent in system.

7 ref

023778   Fang W;Sun J;Ding Y;Wu X;Xu W (NO, School of Information Technology, Jiangnan Univ, No 1800, Lihu Avenue, Wuxi-214 122, People's Republic of China) : Review of quantum-behaved particle swarm optimization. IETE Tech Rev 2010, 27(4), 336-47.

Particle swarm optimization (PSO) is a population-based swarm intelligence algorithm and it has attracted a large number of widespread researchers. As a branch of PSO, a probabilistic PSO algorithm, which is quantum-behaved PSO (QPSO), was proposed on the quantum mechanics and trajectory analysis of PSO. QPSO shines for its simplicity, easy implementation, and fine search ability. QPSO has also gained many researchers on its improvements and has been shown to offer good performance in a variety of applications. This paper attempts to give a compendious and timely review on QPSO by categorizing the publications on the improvements and applications.

3 tables, 123 ref

023777   Deng Y;Su X;Wang D;Li Q (College of Computer and Information Sciences, Southwest Univ, ChongQing, China-400 715, Email: doctordengyong@yahoo.com.cn) : Target recognition based on fuzzy dempster data fusion method. Def Sci J 2010, 60(5), 525-30.

Data fusion technology is widely used in automatic target recognition system. Problems in data fusion system are complex by nature and can often be characterised by not only randomness but also by fuzziness. To accommodate complex natural problems with both types of uncertainties, it is profitable to construct a data fusion structure based on fuzzy set theory and Dempster Shafer evidence theory. In this paper, after representing both, the individual attribute of target in the model database and the sensor observation or report as fuzzy membership function, a likelihood function was constructed to deal with fuzzy data collected by each sensor. The method to determine basic probability assignments of each sensor report is proposed. Sensor reports are fused through classical Dempster combination rale. A numerical example is illustrated to show the target recognition application of the fuzzy-Dempster approach.

4 illus, 3 tables, 14 ref

022772   Ramanarayanan V (Electrical Engineering Dep, Indian Institute of Science, Bangalore-560 012, Email: vram@ee.iisc.ernet.in) : Computers and education. Curr Sci 2010, 98(3), 297-8.

022771   Pal S K;Sen Sharma S (Computer Science and Applications Dep, NSHM College of Management and Technology, 124, BL Saha Road, Kolkata-700 053, Email: sarbojay@gmail.com) : Generation of second best MST based on analytical perspective fo degree sequence. Invertis J Sci Technol 2011, 4(3), 140-5.

This paper considers generation of second best Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. In this paper, we generate minimum spanning tree of the graph G based on the degree sequence factor of nodes and also generate second best MST based. The time complexity of the algorithm is O (|V|²). The goal is to design an algorithm that is simple, elegant, efficient, easy to implement and applicable in the field of networking design, mobile computing and others field of science and engineering.

1 table, 13 ref

022770   Das T;Kumar U;Bapi R S;Padakannaya P;Singh N C (NO, National Brain Research Centre, NH-8, Nainwal Mode, Manesar-122 050, Email: nandini@nbrc.ac.in) : Neural representation of an alphasyllabary- the story of Devanagari. Curr Sci 2009, 97(7), 1033-8.

Used functional brain imaging to study brain activation patterns when 16 native speakers read phrases in Devanagari, a writing system with alphabetic and syllabic properties. We found activation in the left insula, fusiform gyrus and inferior frontal gyrus, as seen for reading alphabetic scripts and in the right superior parietal lobule as associated with reading syllabic scripts. Additionally, we found bilateral activation in the middle frontal gyrus (Lt. BA 46, Rt. BA 6/44) which we attribute to complex visuo-spatial processing required for reading Devanagari, wherein consonants are placed linearly from left to right and vowels positioned non-linearly around them.

2 illus, 1 table, 43 ref

021801   Zhou F;Li H;Xu J;Yu B (NO, College of Information Science and Engineering, Northeastern Univ, 11, Lane 3, Wenhua Road, Heping Shenyang Liaoning, China-110 004, Shenyang China) : Provably secure cluster-based group key agreement for ad hoc networks. IETE Tech Rev 2010, 27(3), 228-34.

The cluster-based group key agreement protocol for ad hoc networks was first presented by Elisavet, in which every cluster executes Joux's tripartite key agreement protocol to agree on a cluster key. These keys will be used afterward for the final group key generation. But the protocol cannot seem to secure against active attacks; hence a novel group key agreement protocol with a cluster structure is proposed by us in this paper. We use the signature scheme instead of certification authority to verify the user's identity in the cluster. Compared with the previously known protocols, it not only reduces the communication cost, but also enhances the communication efficiency. The security of our protocol is also analyzed and proved in the end.

3 illus, 2 tables, 27 ref

021800   Zhao K;Nurbol;Shi G K;Hu L (Computer Science and Technology Dep, Jilin Univ, Changchun-130 012, People's Republic of China) : HSTCP: A high-speed traffic collection platform for intrusion detection/prevention based on sampling on FPGAs. IETE Tech Rev 2010, 27(3), 235-43.

With the ever-increasing deployment and usage of gigabit networks, traditional networks' intrusion detection/prevention systems (IDSs/IPSs) have not scaled accordingly. More recently, researchers have been looking at hardware-based solutions that use field programmable gate arrays (FPGAs) to assist network IDSs/IPSs, and some proposed systems have been developed that can be scaled to achieve a high speed over 10 Gbps. However, these solutions have certain drawbacks. In this paper, we present a uniform high-speed traffic collection platform for intrusion detection/prevention based on sampling on FPGAs, called HSTCP. The methodology is when the proposed platform is unable to capture the whole network traffic, it will initiate elephant flow sampling rather than simple packets' drop. Meanwhile, the sampling rate is adaptive to the traffic load changes in the elephant flow. The noteworthy features of HSTCP include the following: (a) it takes the self-similarity of network traffic into account with complete mice flows' capture and elephant flow sampling; (b) it employs adaptive elephant flow sampling to retain inherent characteristics of network traffic; and (c) it provides a flexible and scalable platform for network IDSs/IPSs faced to the challenge of the future high-speed network.

6 illus, 28 ref

021799   Yoon E J;Shin Y N;Jeon I S;Yoo K Y (NO, School of Electrical Engineering and Computer Science, Kyungpook Nati, 1370 Sankyuk-Dong, Buk-GU, Daegu 702-701) : Robust mutual authentication with a key agreement scheme for the session initiation protocol. IETE Tech Rev 2010, 27(3), 203-13.

The session initiation protocol (SIP) is a powerful signaling protocol that controls communication on the Internet, establishing, maintaining, and terminating the sessions. The services that are enabled by SIP are equally applicable in the world of mobile and ubiquitous computing. In 2009, Tsai proposed an efficient nonce-based authentication scheme for SIP The current paper, however, demonstrates that Tsai's authentication scheme is still vulnerable to offline password guessing attacks, Denning-Sacco attacks, and stolen-verifier attacks, and does not provide perfect forward secrecy. We also propose a new secure and efficient authentication scheme based on the elliptic curve discrete logarithm problem for SIP in order to overcome such security problems.

6 illus, 3 tables, 23 ref

021798   Yi P;Wu Y;Zou F;Liu Ning (Network Information Security Research Center of the Ministry of Educat, Shanghai Jiao Tong Univ, 800 Dongchuan Road, Shanghai-200 240, People's Republic of China) : Survey on security in wireless mesh networks. IETE Tech Rev 2010, 27(1), 6-14.

Wireless mesh networks is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. However, it is particularly vulnerable due to its features of open medium, dynamic changing topology, and cooperative routing algorithms. The article surveys the state of the art in security for wireless mesh networks. First, we analyze various possible threats to security in wireless mesh networks. Second, we introduce some representative solutions to these threats, including solutions to the problems of key management, secure network routing, and intrusion detection. We also provide a comparison and discussion of their respective merits and drawbacks, and propose some improvements for these drawbacks. Finally, we also discuss the remaining challenges in the area.

5 illus, 3 tables, 35 ref

021797   Xiong H;Qin Z;Li F (NO, School of Computer Science and Engineering, Electronic Science and Tec, Chengdu-610 054) : Secure vehicle-to-roadside communication protocol using certificate-based cryptosystem. IETE Tech Rev 2010, 27(3), 214-19.

As various applications of vehicular ad hoc networks (VANETs) have been proposed, security has become one of the big research challenges and is receiving increasing attention. In this paper, we propose a secure and an efficient vehicle-to-roadside communication protocol by using the recently developed concepts of a certificate-based cryptosystem. The proposed approach combines the best aspects of identity-based public key cryptography approaches (implicit certification) and traditional public key infrastructure approaches (no key escrow). As compared with the previous works, which were implemented with the traditional public key infrastructure and identity-based public key cryptography, the proposed approach is more secure and efficient.

4 tables, 24 ref

021796   Wang H;Liao C (NO, School of Information Science and Technology, Southwest Jiaotong Univ, Chengdu-610 031, People's Republic of China) : JPEG images authentication with discrimination of tampers on the image content or watermark. IETE Tech Rev 2010, 27(3), 244-51.

The existing compressed-domain fragile watermarking scheme cannot effectively discriminate tampers on the image contents or the embedded watermark or both tampered by attackers; hence, a novel compressed-domain fragile watermarking scheme with the discrimination of tampers on the image content or watermark based on a chaotic system is proposed in this paper. The quantized discrete cosine transform (DCT) coefficients of seven most significant bits (MSBs) after decoding are mapped to the initial values of the chaotic system, and then a content-based fragile watermark is generated by chaotic motion. After watermark permutation by the chaotic sequence, the operations of embedding and extracting the improved security watermark are all in the compressed domain. During authentication, the proposed method is able to detect the tampered location and discriminates tampers on the image content or watermark from the distribution density of nonzero elements in the tamper detection matrix. The quantized DCT coefficients after decoding are used directly for watermark embedding, which avoids the quantization effect on the detection of watermarks. Therefore, the proposed algorithm is very suitable for the JPEG image authentication. Furthermore, thanks to the high sensitivity to initial values and the good randomness of the chaotic system, the very accurate localization is not only realized for the malicious tampers to JPEG images, but also indicates whether the modification made to the watermarked image is on the image contents or the embedded watermark or both. Simulation results show the abilities of tamper discrimination and tamper localization of this technique.

4 illus, 1 table, 16 ref

021795   Vanisree K;Reddy V S K;Prasad M J C (ECE Dep, Krishnamurthy Institute of Technology, Hyderabad, Andhra Pradesh, Email: vaishnav_56@yahoo.co.in) : Transmission rate of non-cooperative routing in AD HOC network. Int J Engng Sci Mgmt 2011, 1(2), 69-77.

This paper analyzes routing in lossy networks under the assumption of non-cooperative aspect of existing routing protocols. Wei study the three existing non-cooperative routing protocols namely AODV, DSDV, and DSR under different topologies and under different communication traffic pattern to analyze its performance under each of the scenario and traffic. We [ also analyze them based on various number communications i.e. number of flows. We try to find among the non-cooperative protocols which one performs better under given scenario and traffic.

10 illus, 1 table, 14 ref

021794   Srinivasa Rao R;Subbaiah P V (ECE Dep, Sree Vidyanikethan Engineering College, Sree Sainatha Nagar, Tirupathi, Andhra Pradesh, Email: rsrao55@hotmail.com) : Computation of RCS with TLM method using second order higdons boundary operators. Int J Engng Sci Mgmt 2011, 1(2), 78-82.

Presented in this paper, is the computation of RCS of dielectric cubes of high relative permittivity by using time domain Transmission Line Matrix (TLM) method comparison of the results published measurements [1]. Since the high permittivity cubes reradiate a very long time, high quality absorbing boundary conditions having long term stability are required. To achieve these, second order boundary conditions derived from first order Higdon's boundary operators are used. Long term stability has been obtained by using proper discretization of the boundary operators (derivatives), and very low reflections have been obtained by concatenating two first order boundary operators. The RCS data computed with the TLM method agree very well with the measurements published in [ 1 ]. The frequency shift between the TLM results and the measurements is negligible, while a considerable frequency shift has been reported between results obtained with FDTD and measurement.

3 illus, 14 ref

021793   Soni D (Computer Science and Engineering Dep, Dronacharya College of Engineering, Greater Noida, Email: devpriyasoni@gmail.com) : Metrics for measuring the understandability of object - oriented design quality. Int J Engng Sci Mgmt 2011, 1(2), 113-19.

Software design quality directly affects the understandability of the software developed. The increase in size and complexity of software drastically affects quality attributes, especially understandability. The direct measurement of quality is difficult because there is no single model that can be applied in all situations. Researchers have developed quality models that attempt to measure quality in terms of attributes, characteristics and metrics. However these models are not comprehensive. Quantitative measurement of an operational system's understandability is desirable both as an instantaneous measure and as a predictor of understandability over time. This work proposes the method of measuring understandability using Logical Scoring of Preferences (LSP) method. I have also evaluated one design through this model.

4 illus, 1 table, 21 ref

021792   Rajesh Kumar;Ruhil N (NO, , Global Logic India Pvt. Ltd., B 34/1, Sec 59, Noida-201 301, Email: rajeshruhil@gmail.com) : Secure security access: an approach to counter hacking. Int J Engng Sci Mgmt 2011, 1(2), 99-102.

An important aspect of information security is recognizing the value of data and information and defining appropriate procedures and protection requirements for the information. This paper defines a way to track unauthorized access on different shared folders in network. It identifies all the users and group who either are allowed or denied access on selected shared paths. This paper also defines a way to create security access utility; it will track access on shared physical paths. End result of the utility will be an excel report. This report is very well formatted and clearly displays the security details for the selected paths. The technologies used in this paper are VBA, EXCEL and VBS. It uses XCACLS.VBS to track access for all the physical paths defined in EXCEL Sheet. XCACLS.VBS is provided by Microsoft. It can also be used as command line using DOS prompt, XCACLS.VBS accepts several parameters and return access information. To identify and fetch details of all the domain users we used Active DS Type Library. It also fetches details of nested windows users group. We have used windows form to show details of user who belongs to any particular group or sub-group of the parent group.

4 illus, 1 table, 6 ref

021791   Mohammad Z;Chen Y C;Hsu C L;Lo C C (NO, Institute of Information Management, National Chiao Tung Univ, Hsinch, ) : Cryptanalysis and enhancement of two-pass authenticated key agreement with key confirmation protocols. IETE Tech Rev 2010, 27(3), 252-65.

In NRSC24, Elkamchouchi et al. proposed a new approach for key controlled agreement to provide key control in the Pour public key distribution system. In NRSC25, they further proposed an efficient and confirmed protocol for authenticated key agreement to provide forward secrecy in their previously proposed protocol. This paper, however, will show that Pour's protocol and Elkamchouchi et al.'s two protocols cannot withstand key compromise impersonation resilience, and man-in-the-middle attacks, and do not have perfect forward secrecy resilience. To eliminate the pointed out security leaks, we further propose a new two-pass authenticated key agreement with a key confirmation protocol. The proposed protocol has the following properties: (i) it is proved to be secure against above attacks and stronger adversary attacks, and provides the desirable security properties as a three-pass authenticated key agreement protocol. (ii) It can provide entity authentication and assurance for key reception in an indirect way. (iii) It can withstand denial of service attacks. In addition, we also propose a derivation one-pass protocol from the proposed two-pass protocol to fit a one-way communication channel, which is suitable for mobile stations and electronic business transactions. The security and the computational complexities of the proposed two protocols outperform those of previously proposed protocols.

6 illus, 2 tables, 24 ref

021790   Maruthi Prasad V;Raghavendra Prasad V (MCA Dep, Madanapalle Institute of Technology and Science, Madanappale, Email: maruthi_vv@yahoo.co.in) : S-mesh based protocol for peer-to-peer streaming to serve dynamic groups. Int J Engng Sci Mgmt 2011, 1(2), 103-12.

Peer-to-peer (P2P) streaming has been widely deployed over the Internet. A streaming system usually has multiple channels and peers may form multiple groups for content distribution. In this paper,we propose a distributed overlay framework (called SMesh) for dynamic groups where users may frequently hop from one group to another while the total pool of users remain stable. SMesh first builds a relatively stable mesh consisting of all hosts for control messaging. The mesh supports dynamic host joining and leaving, and will guide the construction of delivery trees. Using the Delaunay Triangulation (DT) protocol as an example we show how to construct an efficient mesh with low maintenance cost. We further study various tree construction mechanisms feed on the mesh, including embedded, bypass, and intermediate trees. Through simulations on Internet-like topologies, we show that SMesh achieves low delay and low link stress.

9 illus, 10 ref

021789   Li F;Qin Z (NO, School of Computer Science and Engineering, Electronic Science and Tec, China, Chengdu-610 054) : Cryptanalysis of a convertible authenticated encryption scheme based on the ElGamal cryptosystem. IETE Tech Rev 2010, 27(3), 266-9.

A convertible authenticated encryption scheme allows a designated recipient to retrieve an authenticated ciphertext and convert the authenticated ciphertext into an ordinary signature. Recently, Lee, Hwang, and Tzeng proposed a new convertible authenticated encryption scheme based on the EIGamal cryptosystem. In this paper, we show that the Lee-Hwang-Tzeng scheme is not secure against chosen plaintext attacks. In addition, we give a solution to repair it.

15 ref

021788   Kohar J;Malik A;Vijeta (NO, Gurgaon College of Engineering, Bilaspur Tauru Road, Gurgaon Haryana, Email: jyotikohar@gmail.com) : High performance low power flip-flop by using conditional discharge technique. Int J Engng Sci Mgmt 2011, 1(2), 37-41.

The principle goal of Conditional Discharge Technique for high performance flip-flops is reviewed in terms of power and delay. In this paper high performance flip-flops are categorized in two types namely Conditional Precharge and Conditional Capture flip-flops for reducing the internal switching activity. Application of the Conditional techniques results in improvement of Energy-Delay product and saving of power consumption for quiet input. Conditional Discharge flip flop results in generating less glitch at the output with small D-to-Q delay. Power consumption is reduced by avoiding unnecessary internal node transition, In this paper a comparison summary of recent results of flip-flop characteristics is also reviewed. Conditional Discharge technique is most suitable for VLSI system design.

3 illus, 10 ref

021787   Hu L;Nurbol;Liu Z;He J;Zhao K (Computer Science and Technology Dep, Jilin Univ, Changchun-130 012, People's Republic of China) : Time-stamp frequent pattern-based clustering method for anomaly detection. IETE Tech Rev 2010, 27(3), 220-7.

Anomaly detection, as an important complement to misuse detection, has the capability of finding and foiling both known and "zero day" attacks. Performing anomaly detection in real time places hard requirement on the algorithms used. It makes many detection techniques based on proposed data mining algorithms less suitable to be used under real-time network circumstances. To address the problem, a novel anomaly detection algorithm using time-stamped clustering is proposed. In this paper, the normality model used for detection is the clustering result of BIRCH. Once a cluster is generated or modified in the tree index of BIRCH, it will be marked by a lasted modified time-stamp and frequent item. Using each cluster's time-stamp and frequent item, the algorithm can dynamically remove some expired clusters from the model, and can also produce some new clusters that makes our clustering method more suitable for the real network environment. Experiments with the KDDCUP 1999 dataset show that our algorithm is less sensitive to noise data objects than ADWICE and has lower computer resource consumption.

2 illus, 4 tables, 16 ref

021786   Goutam A;Raj Kamal;Ingle M (NO, Fr. Conceicao Rodrigues College of Engineering, Mumbai-400 050, Email: aradhana.pande@gmail.com) : Analytical study of auto run worm killer: a strategic approach. Int J Engng Sci Mgmt 2011, 1(2), 120-5.

The focus of the current paper lies on the AutoRun Worm killer. This is a buzz word in present era of Information technology and its related areas. The failures of the system and the hard drives destruction have led us to study the buzzword in the detail and atleast make a approach to protect the valuable data and information lying in our systems and laptops. This specific area become more important for research due to the underlying fact that the files lying in the registry in our systems never gets manipulated due to the antivirus software. The above statement holds true for the fact because of collection of the files being stored in the registries and on manipulation of the same the system may crash. The presence of AutoRun worms in the registry files may crash the system. The registry files contain several useful information and data. The safety of registry files is of utmost concern for the seamless working of the system.

2 illus, 9 ref

021785   Alaybeyoglu A;Erciyes K;Kantarci A; Dagdeviren O (Computer Engineering Dep, Ege Univ, Izmir-Bornova, Izmir, Turkey) : Tracking fast moving targets in wireless sensor networks. IETE Tech Rev 2010, 27(1), 46-53.

Proposes a dynamic distributed algorithm for tracking objects that move fast in a sensor network. In the earlier efforts in tracking moving targets, the current leader node at time t predicts the location only for time t + 1 and if the target moves in high speed, it can pass by a group of nodes very fast without being detected. Therefore, as the target increases its speed, the probability of missing that target also increases. In this study, we propose a target tracking system that predicts future k locations of the target and awakens the corresponding leader nodes so that the nodes along the trajectory self organize to form the clusters to collect data related to the target in advance and thus reduce the target misses. The algorithm first provides detection of the target and forms a cluster with the neighboring nodes around it. After the selection of the cluster leader, the coordinates of the target is estimated using localization methods and cooperation between the cluster nodes under the control of the leader node. The coordinates and the speed of the target are then used to estimate its trajectory. This information in turn provides the location of the nodes along the estimated trajectory which can be awaken, hence providing tracking of the moving object. We describe the algorithm, analyze its efficiency and show by simulations that it performs well to track very fast moving objects with speeds much higher than reported in literature.

8 illus, 1 table, 16 ref

020779   Xie S (Computer and Software Institute, Nanjing University of Information Science and Technology, No. 219, Ningliu Road, Nanjing, Jiangsu, China) : Vertical handoff decision algorithm based on optimal grade of service. IETE J Res 2010, 56(1), 44-59.

A new vertical handoff decision algorithm is proposed to minimize the cost of the grade of service (GoS) in heterogeneous wireless networks, which comprise cellular networks and wireless local area networks (WLANs). We first calculate the block probability and the drop probability, which are factors of the GoS and function of new call arrival rate, handoff call arrival rate and radius of WLANs, cellular network and WLANs under the channel-guard call admission strategy. Then we propose a cost function of the GoS, and obtain the optimal radius of WLANs by using simulated annealing (SA) method to minimize the cost. All the nodes should handoff from cellular network to WLAN if they enter WLAN's scope and handoff from WLAN to cellular network if they leave the scope. Finally, we analyze our handoff algorithm and compare it with other algorithm, and the results show that our algorithm could achieve good effects.

9 illus, 16 ref

020778   Gadgil N J (Practise School Intern, Tensilica Technolgies (India) Pvt. Ltd, Pune) : Procesor-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.