002034   Patil M H B;Patil Y S (CSE Dep, Shri Sant Gadge Baba College of Engineering & Technology, Bhusawal, North Maharashtra Univ) : Privacy preserving batch auditing for multiuser and multicloud. Int J latest Technol Engng Mgmt appl Sci 2015, 4(6), 41.

Cloud offers various services that not only stored but can also be shared among multiple users. But the major problem is about data integrity due to existence of hardware/software failure and human errors. To check the integrity of cloud data, third party auditor(public verifier) is introduced to perform public auditing. A privacy preserving mechanism in which the identity of the user on each shared block is protected from public verifier, who is responsible to efficiently verify shared data integrity instead of retrieving the entire file. Ring signature is being exploited to audit the correctness of shared data by verifying the metadata available to the auditor.We introduce a new mechanism that perform batch auditing to handle multiple requests concurrently by improving the efficiency of the auditing using multi cloud.

6 illus, 1 table, 18 ref

002033   Pal S;Vinita (NO, Computer Science S(SOET), Main Campus, JNU, Jaipur, Rajasthan, Email: sonam.pal@gmail.com) : Cloud computing research issues, challenges, architecture, platforms and applications. INROADS 2014, 3(2), 444-8.

Cloud computing come from the development of parallel computing, distributed computing, grid computing and virtualization technologies. Cloud computing is an. emerging model of business computing. In this paper, we explore the concept of cloud architecture and address the characteristics and applications of several popular cloud computing platforms. In this paper, we aim to pinpoint the challenges and issues of cloud computing and we also highlighted the cloud interoperability issue that deserves substantial further research and development. Once migrated to cloud, you do not know where your data is physically stored, what laws and regulations govern the same and most important of all, who has access to it. However, security and privacy issues present a strong barrier for users to adapt into cloud computing systems. In this paper, we investigate several cloud computing system providers about their concerns on security and privacy issues.

^iia4 ref

002032   Mathur S;Soni A K;Sharma G (Amity Institute of Information Technology, Amity Univ, Noida, Uttar Pradesh, Email: sandeep2809@gmail.com) : Deriving object-oriented taxonomy from the requirement engineering model for a non-fading data warehouse. Int J appl Res Inf Technol Comput 2014, 5(2), 101-18.

Building a data warehouse (DWH) is a very challenging task. Most of the DWH projects fail to meet the business requirements and business goals because of the improper requirement engineering phase. The gap in between the development of requirements evolves due to disparity between the users and the developers, resulting in project devastation and terminations. DWH quality depends on the quality of its requirement engineering models. Agent orientation is emerging as a unique paradigm in requirement engineering for constructing DWH and maintaining the non-fading DWH property. Agent-oriented systems are expected to be more powerful, more flexible and more robust than conventional requirement elicitation models. The CAGDI stands for clustered agent-oriented decision information model, which has benefits over the agent goal decision information (AGDI) model and overcomes the short comings of the AGDI model. The model can be used in the early as well as in the late requirement elicitation. Object-oriented modelling is an important technique for database design because it organises system as a collection of interacting objects that combine data and behaviour. In this paper, the CAGDI model has been illustrated though the application of a banking system and at the end of the paper, the CAGDI model is given in the object-oriented paradigm in which the Unified Modelling Language UML diagrams, such as activity diagrams and sequential diagrams, have been discussed to prove the concept.

17 illus, 39 ref

002031   Koli M;Balaji S (Computer Science Dep, Karnataka Univ, Dharwad-580 003, Email: makresearch2012@gmail.com) : Histogram-based gaussian noise removal. Int J appl Res Inf Technol Comput 2014, 5(2), 119-25.

In modern science and technology, as the digital image processing gets more and more importance, the process of image quality enhancement and image restoration becomes a matter of concern for the researchers. In an image, denoising complexity increases from salt and pepper impulse noise to random-valued impulse noise, through to Gaussian noise. As salt and pepper noise occupies either high (255) or low (0) values and also as it is not distributed uniformly, hence, with the help of correct neighbouring pixels and known value of noise, the corrupted pixels can be easily restored. In random-valued noise, the value of noise is unknown, but we can take advantage of the non-uniform noise distribution, and using non-corrupted neighbouring pixels values, we can restore the corrupted pixels. However, as Gaussian noise is a uniform noise, hence, not only the value of noise is unknown, but also it is not possible to get non-corrupted neighbouring pixels. In Gaussian noise, restoring pixels using the corrupted neighbouring pixels is a highly tedious job. In this paper, an efficient algorithm for the removal of Gaussian noise is proposed. Experimental results show that proposed algorithm produces good results up to 50% of noise level, the value normally real-time images were corrupted.

7 illus, 5 ref

002030   Kesa H;Yenduri S (School of Computing, Univ of Southern Mississippi, 730 East Beach Boulevard, Long Beach, Mississippi 39560, USA, Email: sumanth.yenduri@usm.edu) : Rerouting transit traffic for effective monitoring. Int J appl Res Inf Technol Comput 2014, 5(2), 126-30.

Traditionally, transit traffic monitoring is performed by placing monitors throughout a network. Over time, there can be changes in the traffic, rendering these monitors useless. Raza et al. developed a framework called 'MeasuRouting' where they rerouted traffic over fixed monitors to ensure effective monitoring. In this paper, we attempt to build software that uses the methodology presented by Raza et al.

15 illus, 4 ref

002029   Irrgang B (Philosophy of Technology Dep, Dresden Univ of Technology, Germany, Email: bernhard.irrgang@tu-dresden.de ) : On the consciousness of robots. Int J appl Res Inf Technol Comput 2014, 5(2), 142-53.

Many essays on the consciousness of robots do not thematise specifically the qualifying conditions of human consciousness. For this reason, this paper focuses on the basic traditional epistemological questions about the nature of natural, human and possibly technically produced consciousness, to prepare the ground on which the questions about consciousness of robots can be asked at all. It requires, in the first place, deliberations on what natural and human consciousness is, as without such clarification about the phenomenon of consciousness, we do not know what we have to look for with technical or experimental means, to be able to determine the consciousness of robots. On a second level, to be able to clarify the topic of 'other minds' and questions of inter-subjectivity, i.e. the possibilities of relations of two embodied forms of consciousness among themselves, the so-called hetero-phenomenology or the behavioural research are discussed.

37 ref

002028   Ghadle K P;Pawar T S (Mathematics Dep, Dr. Babasaheb Ambedkar Marathwada Univ, Aurangabad, Maharashtra) : Quadratic programming problems-special case-alternative method. Int J latest Technol Engng Mgmt appl Sci 2015, 4(6), 49-51.

Paper provides a good alternative method for quadratic programming problem (QPP) concern with non-linear programming problem (NLPP) because the technique is useful to apply on numerical problems, reduces the labour work and save valuable time.

11 ref

002027   Abdessadek A;Mohammed M (Computer Science Dep, Faculty of Sciences, Chouaib Doukkali Univ, El Jadida, Morocco, Email: a.aaroud@yahoo.fr) : Optimising LDPC codes using modified log SPA algorithm. Int J appl Res Inf Technol Comput 2014, 5(2), 91-100.

Presents in this paper a new method for improving the decoding of the LDPC (low-density parity check) codes by optimising the log-SPA (sum-product algorithm). Currently, the LDPC codes give very good results with iterative decoding algorithm, log-SPA, based on the propagation confidence BP (belief propagation). To improve the existing log-SPA, we propose a decoding algorithm (log-SPA modified), which minimises the error decoding of words that could not be previously decoded. This algorithm is based on the dependency between the weight of the syndrome and the weight of the error sequence generated during iterations of decoding. Simulations illustrate the performance of our approach compared with classical LDPC code based on log-SPA.

10 illus, 13 ref

001028   Swapna C S;Kumar V K;Murthy J V R (Computer Science and Engg Dep, JNTU Kakinada, Andhra Pradesh, Email: swetha_swapna@yahoo.com) : New approach to cluster datasets without prior knowledge of number of clusters. J scient ind Res 2015, 74(5), 261-4.

Paper discusses yet another approach of clustering datasets whose cluster numbers are not known beforehand. The suggested approach effectively determines the number of clusters or partitions while running the algorithm. The proposed method is only limited to partitional clustering inspired from the K-means algorithm. In this work a Modified Teaching-Learning-Based Optimization (MTLBO) is used to form the clusters and determine the number of clusters on the run. The comparison of the results obtained by MTLBO is done with the classical TLBO and Classical Differential Evolution (DE) technique. The results show that MTLBO gives better accuracy than the other two with respect to the number of function evaluations and cluster validity measures. Several benchmark datasets are simulated from the UCI machine repository and results are tabulated in the paper.

1 table, 4 ref

001027   Parveen S;Ahmad S M S;Hanafi M;Adnan W A W (Computer and Communication Systems Engineering Dep, Quaid-e-Awam Univ of Engineering, Science and Technology, Nawabshah, Pakistan, Email: engr_sajida@hotmail.com) : Face anti-spoofing methods. Curr Sci 2015, 108(8), 1491-500.

In recent years, facial biometric systems have received increased deployment in various applications such as surveillance, access control and forensic investigations. However, one of the limitations of face recognition system is the high possibility of the system being deceived or spoofed by non-real faces such as photograph, video clips or dummy faces. In order to identify the spoofing attacks on such biometric systems, face liveness detection approaches have been developed. Thus, the current approach is to integrate liveness detection within facial biometrics by using life sign indicators of individual features. This article presents a review of state-of-the-art techniques in face liveness detection, which are classified into two groups, namely intrusive and non-intrusive approaches. Here, each technique is discussed in terms of its implementation, strengths and limitations, as well as indications on possible future research directions that can be studied.

^iia5 illus, 11 tables, 46 ref

001026   Kim G J;Park S S;Jang D S (Industrial Management Engineering Div, Korea Univ, Seoul 136-701, Korea, Email: jang@korea.ac.kr) : Technology forecasting using topic-based patent analysis. J scient ind Res 2015, 74(5), 265-70.

The number of patents with critical information related to various technologies is increasing by the day. This trend has led corporations and countries to consider patent analysis as an important element in their analysis methodology for research and development. The present study seeks to determine and forecast vacant technology with considerable development potential through an analysis of patents. In order to identify a vacant technology cluster, the unstructured patent documents need to be structured into groups of similar technologies by using k-means clustering. Furthermore, silhouette width, Davies-Bouldin Index (DBI), and Pseudo F are used for enhancing reliability of determining the optimal number of clusters. From each technology cluster, a generative topic model, latent Dirichlet allocation (LDA), is adopted to extract latent topics specifically for examination of technologies. Renewable energy patents from the United States Patent and Trademark Office (USPTO) are analyzed for the case study, which verifies the proposed methodology.

2 illus, 3 tables, 21 ref

001025   Guha S (Geography Dep, Dinabandhu Andrews College, Kolkata, West Bengal) : Computation of storage of carbon using landsat TM5 data. Indian J Landsc Syst ecol Stud 2014, 37(1), 126-31.

Quantifying the carbon storage, distribution, and change of trees is vital to understanding the role of vegetation in the environment. At present, this is mostly achieved through ground truth survey. This present study applies a method based on the satellite image time series, which can save time and money and greatly speed the process of forest carbon storage mapping, and possibly of regional forest mapping. Satellite imagery collected in different decades was used to develop a regression equation to predict the forest carbon storage from the Normalized Difference Vegetation Index (NDVI) computed from 1989 to 2010 of Landsat TM5 data. It was developed from the 2010 field-based model estimates of carbon storage in Hugli estuary region, India. The total carbon storage estimates based on the NDVI data agree closely with the field-based model estimates. Changes in total carbon storage by trees in the estuary were estimated using the image data from 1989 and 2010. Radiometric correction was accomplished by normalizing the imagery to the 1989 data. After the radiometric correction, the carbon storage by trees in Hugli estuary was estimated to be 19.35 million tons and 19.64 million tons of carbon for 1989 and 2010 respectively. The results demonstrate the rapid and cost-effective capability of remote sensing-based quantitative change detection in monitoring the carbon storage change and the impact of forest management over wide areas.

1 illus, 3 tables, 11 ref

000017   Varsani S (NO, , ) : Review on tree formation technique in wireless sensor network. J Netwk Secur 2015, 3(2), 1-7.

Typical task in wireless sensor network is to collect a data from sensor nodes towards sink. This paper shows various tree formation techniques used in the data gathering. In wireless sensor network, various data gathering techniques used that are hierarchical data gathering, chain based data gathering, tree based data gathering etc. This paper shows study on various tree formation techniques that can assist in data gathering. The data are collected from different sensors and is forwarded towards the sink node; for this purpose various tree formation techniques are used. The purpose of these techniques is to improve factors like a network lifetime, reduce an energy consumption and delay etc.

000016   Santhi S;Sadasivam G S (Information Technology Dep, Dr. NGP Institute of Technology, Coimbatore, Tamil Nadu, Email: shanthimathan@yahoo.co.in) : Design and development of compact monitoring system for disaster remote health centres. Indian J med Microbiol 2015, 33(Supp 1), 11-14.

To enhance speedy communication between the patient and the doctor through newly proposed routing protocol at the mobile node. The proposed model is applied for a telemedicine application during disaster recovery management. In this paper, Energy Efficient Link Stability Routing Protocol (EELSRP) has been developed by simulation and real time. This framework is designed for the immediate healing of affected persons in remote areas, especially at the time of the disaster where there is no hospital proximity. In case of disasters, there might be an outbreak of infectious diseases. In such cases, the patient's medical record is also transferred by the field operator from disaster place to the hospital to facilitate the identification of the disease-causing agent and to prescribe the necessary medication. The heterogeneous networking framework provides reliable, energy efficientand speedy communication between the patient and the doctor using the proposed routing protocol at the mobile node. The performance of the simulation and real time versions of the Energy Efficient Link Stability Routing Protocol (EELSRP) protocol has been analyzed. Experimental results prove the efficiency of the real-time version of EESLRP protocol. The packet delivery ratio and throughput of the real time version of EELSRP protocol is increased by 3% and 10%, respectively, when compared to the simulated version of EELSRP. The end-to-end delay and energy consumption are reduced by 10% and 2% in the real time version of EELSRP.

5 illus, 10 ref

000015   Lata S (NO, , ) : Reputation based scheme to detect a black hole attack in MANET. J Netwk Secur 2015, 3(2), 27-31.

MANET is wireless network in which an end to end path is present between Network Security to MANET is wide problem. A black hole attack is an attack which drops the packets or provides wrong routing information to disturb routing process. In this paper we propose a new reputation based scheme to detect a black hole attack in MANET. In this scheme with the help of reputation of node we can detect the black hole nodes. For simulation ONE simulator is used.

000014   Kothadia H H;Vasavada T M (NO, , ) : Flooding techniques in wireless sensor network. J Netwk Secur 2015, 3(2), 8-11.

Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has yet been done on low-duty-cycle wireless sensor networks in which nodes stay asleep most of time and wake up asynchronously. In this type of network, a broadcasting packet is rarely received by multiple nodes simultaneously, a unique constraining feature that makes existing solutions unsuitable. Combined with unreliable links, flooding in low-duty-cycle networks is a new challenging issue. Therefore, flooding tree construction is an important and fundamental problem in WSNs, and has been extensively investigated in the literature. However, we note that the flooding tree construction problem in asynchronous low-duty-cycle WSNs has not been sufficiently investigated in existing work. So, in this paper we study about various flooding techniques like Minimum-Delay and Energy-Efficient Flooding Tree in Asynchronous Low-Duty-Cycle and Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links, after we get the performance result of every flooding technique.

000013   Islam M R;Rahman M F (NO, , ) : Speaker identification using hopfield neural network based classifier. J Netwk Secur 2015, 3(2), 32-5.

Aim of this work is to enhance the performance of speaker identification using Hopfield neural network algorithm. Speech signals are collected from VALID Audio-Visual dataset and some speech signal preprocessing techniques are applied to process the speech to feed the Hopfield neural network algorithm. Filtering technique is applied to remove the noises from the speech signals. MFCC based standard speech feature extraction technique is used to extract the speech features. These speech features are used for the learning and recognition model of Hopfield neural network. VALID audio-visual database has been used to measure the performance of the proposed system.

000012   Dhanalakshmi R;Vadivel A;Chandrasekaran R M; Parthiban P (NO, HCL Technologies, Chennai, Tamil Nadu-600 119, Email: r_dhanalakshmi@yahoo.com) : Nature inspired heuristic approach to balance the resource in the multiple distribution centers. J scient ind Res 2015, 74(2), 77-81.

This paper deals with the balanced allocation of customers to multiple distribution centers. Allocation problem generally deals with clustering of customers so as to achieve minimum total resource viz. cost or time. But the real challenge arises when it is required to strike a balance between the allocation while also minimizing the total cost or time. Since the problem develops to be NP-hard, the paper uses heuristic method to solve. This paper deals with the balanced allocation of customers to multiple distribution centers and also the paper challenges the requirement of Genetic algorithm against the usage of a relatively simple improvement heuristic developed based on the existing 2-opt heuristic. The balanced solution is achieved by using the min-max function. The two heuristics are compared using both existing and simulated data-sets.

3 illus, 2 tables, 12 ref

000011   Bhutani H;Garg V (NO, , ) : Threshold based scheme to detect black hole attack in DTN. J Netwk Secur 2015, 3(2), 12-9.

Security in DTN is a challenging task. Numbers of misbehaving attacks are present in the network. In this paper we focus on Black Hole attack with the problem of misbehaving and propose a solution based on the concept of threshold and validation. Each node maintains a local value called status of node. A node "status" is the delivery probability of nodes so doing, a misbehaving node is not chosen even though it distributes its increased value of delivery probability. We propose a validation based theory to contrast black hole attack. In validation based theory, acknowledgement of messages is verified to detect normal nodes. On the basis of their acknowledgement we validate that nodes are normal. Normal node is a node which can effectively forward the packets from one place to another. To simulate proposed scheme ONE simulator is used.

000010   Bansal D;Jangra A;Sharma A (NO, , ) : Simulation of different routing protocols using ONE simulator in delay tolerant network. J Netwk Secur 2015, 3(2), 20-6.

DTN (Delay Tolerance Network) is a network which is specially designed to handle long partitions and frequent delays occurring in previous wireless network. In DTN data is transmitted in store carry and forward manner. In this paper an attempt has been made to simulate different existing DTN routing protocols. For simulation ONE (Opportunistic Network Environment) simulator is used. ONE is free and easy to use simulator. Simulation is performed on the basis of varying the buffer space and TTL value with matrices, throughput, number of delivered packets and number of dropped packets. The simulation can be implemented in a fully distributed manner to thwart various attacks without relying on any tamperproof hardware and software platforms.

000009   Aneja M;Garg V (NO, , ) : Contact-based routing to improve delivery ratio in DTN. J Netwk Secur 2015, 3(2), 36-43.

Delay tolerant networks (DTNs) are a new development in network research field, DTNs are the networks where no end-to-end paths are present between nodes for a long period of time. DTNs are wireless networks where disconnections and delays are high. DTN works on the principle of store, carry, forward mechanism. A store, carry, forward mechanism is a mechanism in which when a node receives a packet then it stores in its buffers, and when next intermediate node come in range of network then it forward the packet to that node. To forward packets from one hop to another DTN provides routing scheme. Each scheme has its own pros and cons. We propose a scheme in which we compute duration of contact, most recent contact and most frequent contact. After calculating these parameters we can create a contact graph. A contact graph can define the contact between nodes, and also provides nodes having highest chances of packet delivery. Proposed scheme can improve delivery ratio, and also reduce overhead ratio. Simulation of proposed scheme can be done on ONE simulator.

023332   Kondala Rao M;Avadhani P S;Lalitha Bhaskari D (Computer Science and Systems Engineering Dep, Andhra Univ, India) : Public key cryptosystem based on pell's equation with jacobi symbol. Int J appl Sci Engng Res 2015, 4(1), 68-76.

Protection of data is the utmost thing for any company related to digital information. There are several malicious methods adapted, based on the priority of demand of that piece of information. There are several cryptosystems implementing various algorithms. In this paper a cryptosystem based on Pell's Equations proposed with Jacobi Symbol. And an efficient implementation of RSA algorithm and Pell's Equation with Jacobi Symbol using GMP library from GNU is done. An analysis based on the changes in the performance of the algorithm by changing the number of bits of message and keys is done.

2 illus, 2 tables, 29 ref

023331   Eken S;Sayar A (Computer Engineering Dep, Kocaeli Univ, 41380 Kocaeli, Turkey, Email: suleyman.eken@kocaeli.edu.tr) : Automated technique to determine spatio-temporal changes in satellite island images with vectorization and spatial queries. Sadhana 2015, 40(1), 121-37.

For spatio-temporal and topologic analyses, vectorial information (carrying coordinate values defined as point sets) gives better information than its raster (grid of pixels) counterpart. The study presented in this paper is based on (i) recognition and extraction of an island object in a set of digital images captured by LandSat-7 satellite and (ii) modelling it as a polygon (vectorial) and making it easy to process and easy to understand for computers and information science applications. Polygon representations of island images then can be stored and manipulated through object-relational spatial databases. Spatial databases have built-in functions and services for spatial objects defined with geometry types such as points, lines, and polygons. By this way we will be utilizing the rapidly changing and developing object-relational database communities' studies and discoveries in spatio-temporal and topological analysis for the investigation of digital satellite images. This approach also enables service qualities as well as a better performance. The efficiency and feasibility of the proposed system will be examined by various scenarios such as earthquake, erosion and accretion. Scenarios are based on measuring the effects of the natural phenomena on a selected island on satellite images.

6 illus, 3 tables, 32 ref

022354   Vijesh K;Santhadevi P (NO, School of Computer Science and Information Technology DMI-St. John the, Mangochi, Malawi, Email: vijesh.krishnamurthy@gmail.com) : Internet spam threats and email exploitation-a scuffle with inbox attack. Int J appl Sci Engng Res 2014, 3(4), 907-12.

Today's Internet technology presents us with new opportunities as well as challenges to our online experiences. While the opportunities are endless, the challenges assume significance since they involve issues relating to information privacy, personal identity and safe Internet usage. The exponential growth of the Internet has brought in its wake the darker side of cyber space that is said to be cyber crimes. A cyber crime is any illegal behavior committed by means of, or in relation to, a computer system or network, including such crimes as illegal possession and offering or distributing information by means of computer systems or networks over the Internet. Cyber crimes - Internet threats and email abuses are constantly evolving and they are dynamic in nature and it doesn't allow any breathing space to stop the crime permanently due to the sophisticated technologies applied by the cyber criminals to clasp victims. It is now emerging as a major threat across every internet users both direct and indirectly, this can result in hampering the privacy of emailing facility. This paper narrates what are all the ways unknowingly we are becoming victim day by day and how should we protect our email account from the internet vulnerabilities.

4 ref

022353   Thiyagarajan M;Manikandan R (School of Computing, SASTRA Univ, Thanjavur) : Data mining and wavelet tools for VLSI cell placement. Int J Comp Applic 2014, 9(2), 131-5.

In this paper we attempt a new approach for the computation of area occupied by cells in a VLSI Design. This is possible through a Data mining tool and the expression for the functional values at dyadic points on the mother Wavelet.

2 illus, 6 ref

022352   Thiyagarajan M;Anand V (School of Computing, SASTRA Univ, Thanjavur) : Randomized routing algorithms. Int J Comp Applic 2014, 9(2), 143-8.

Given a network topology, a routing algorithm specifies for each pair of nodes, a route or a sequence of edges connecting a pair in the network. The gaps in the earlier descriptions by [Michael Mitzenmacher and Eli Upfal] have been bridged to give a complete description of the solution techniques. We have considered the hypercube and butterfly networks in this paper.

6 ref

022351   Teerakanok S;Pattaranantakul M;Vorakulpipat C;Kamolphiwong S;Siwamogsatham S (NO, Prince of Songkla Univ, Hatyai 90112, Thailand) : Privacy-preserving framework for location-based service: a review of structural design and analysis. IETE Tech Rev 2014, 31(6), 422-39.

Traditional location tracking and positioning systems rely on the implicit assumption that users are willing to reveal their credentials or private location to an untrustworthy service provider; if a situation suddenly deteriorates, personal information can be intercepted and abused by adversary attacks. Addressing the need for location privacy is essential to preserve users' credentials when they need to access location information from their service providers. Therefore, this review paper will address the phases of authentication and the querying process in location-based services (LBS). The first contribution is to rigorously investigate the mechanisms of location-based authentication and location-based personal identification in order to determine the level of trust for deciding whether traditional methods have provided a strong enough security structure to preserve privacy. The second contribution is to resolve the above privacy problems in the existing LBS systems. The idea of early intervention has brought a conceptual and practical framework into the field of preserving location-privacy-based anonymizer solutions. The framework has been designed based on a simple, centralized architecture, and integrated with two important techniques: location anonymity and encryption technology. In this paper, one-way hash function is applied as a means to create a fingerprint of a message that can be used for subscription or authentication services, and thus data integrity can be preserved. Location blurring (also known as the k-anonymity model) has also been proposed as an important factor in disguising user location when users need to interact with untrusted service providers. In the querying process, time-fuzzy logic is used to examine the degree of confidence whether the user is requesting the service under the right privileges. Finally, performance analysis regarding the derived framework of preserving location privacy is presented.

13 illus, 3 tables, 13 ref

022350   Taneja K (NO, , ) : Web page categorization based on characteristics of web page. Int J Adv Comput Inf Technol 2014, 3(1), 12-6.

Internet is the only source of huge amount of information accessed by large number of people every day. Now a day's web is comprised of trillions of pages and everyday tremendous amount of requests are made to put more web pages on the World Wide Web (WWW). The ability to create information has exceeded to the ability to manage information This paper proposes an approach to categorize web pages automatically on the basis of characteristics of web pages using neural network based single discrete perceptron training algorithm which is easy to implement, use and also categorize web pages with high accuracy. Here two major categories of web pages have been considered for categorization, these are newspaper and education. The whole approach can be defined in three steps. In the first step, features are extracted automatically after analyzing the source web pages. The second step includes the implementation and training of the algorithm. The third step will categorize the source web pages into one of the two categories.

022349   Singh S;Kakkar P;Bhambri P (Computer Sci and Engg Dep, DAVIET, Jalandhar, Email: sohaj.deep@gmail.com) : Impact of random waypoint and vector mobility models on various routing protocols in manet. Int J Adv Comput Inf Technol 2013, 2(3), 41-51.

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre-existing network infrastructure. As these nodes need connection to each other to form a dynamic network and to transfer data, link instability needs to be addressed. Due to link instability, node mobility and frequently changing topologies, routing becomes one of the core issues in MANETs. Research in this area is mostly simulation based. MANET performance is sensitive to mobility, scalability and traffic load, so to examine the different protocol performance while the amount of traffic and speed of nodes varies even plays a crucial role in efficient traffic routing. Now the important aspect is whether varying the topology, network size, node speed and traffic load will improve the performance of the protocols. So far research on performance of MANET routing protocols have shown distinctive results, based on the different network conditions such as traffic type, parameters, network size and by using different simulators. This study focuses on the impact of mobility models on the performance of routing protocols. Many routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. Here, the examination of the impact of Random Waypoint Mobility model and Vector Mobility model on AODV, OLSR and GRP routing protocols is conducted with Throughput, End-to-End Delay and Network Load as performance metrics. We have assumed that the mobility model used in MANET effect the performance of the MANET routing protocols. This unique assumption needs to be verified by conducting simulations over the selected MANET routing protocols OLSR, AODV and GRP in context to meet our research challenge. The simulation has been done using OPNET 14.5 with an aim to find the best combination of a protocol and mobility model and to observe the effect of network size on the efficiency. MANET routing protocols are generally classified in three categories namely proactive, reactive and hybrid Ad hoc routing protocols exhibiting both reactive and proactive features are called hybrid routing protocols. This paper is focused on all the three types: reactive protocol AODV, proactive protocol OLSR and hybrid GRP. This study observes ' the effect of these protocols on MANET performance while using HTTP traffic. We conclude that high efficiency of a network can be achieved by choosing the best suited protocol based on the mobility model.

7 illus, 1 table, 29 ref

022348   Singaraju J;Sandhya Rani K;Usha Rani K (Computer Science Dep, Sri Padmavathi Mahila Visvsvidyalayam, Tirupati-517 502) : Two phase encryption using artificial neural network techniques. Int J Comp Applic 2014, 9(2), 177-85.

With the introduction of the computer, the need for automated tools for protecting files and other information stored on the computer became evident. This is especially the case for a shared system, such as a time-sharing system, and the need is even more acute for systems that can be accessed over a public telephone network, data network, or the Internet. Cryptography is probably the most important aspect of communications security and is becoming increasing important as a basic building block for computer security. Using the enciphering technique to improve the easiness of encryption and security of a cryptosystem is the major purpose of this paper. We propose a two phase artificial neural network encryption model as an enhanced cipher.

4 illus, 13 ref

022347   Saidi W;Bouzid A;Ellouze N (NO, , LSTS, ENIT - Tunis Le Belvedere B.P. 37, 1002 Tunis, Email: saidiwafa@yahoo.com) : MPM method and DYPSA algorithm evaluation for GCI detection in a noisy speech signal. Int J Comp Applic 2014, 9(2), 187-200.

This paper deals with the evaluation and the comparison of two methods for determining glottal closure instants (GCIs) from the speech signal. These methods are the Multi-scale Product Method (MPM) and the Dynamic Programming Phase Slope Algorithm (DYPSA). The MPM consists of determining abscissa of peaks appeared on the product of wavelet transform coefficients at three adjacent dyadic scales. The wavelet used to compute the product is the quadratic spline function. However, the DYPSA algorithm is based on the group delay function to generate the GCI candidates and the dynamic programming technique to select the true GCIs. The comparison of the two algorithms is operated without noise and with additive Gaussian noise at various SNR levels. The evaluation is operated on the Keele University database. Results show that the MPM is more robust to noise than the DYPSA with a good detection rate nearby 90% at an SNR level of 0 dB and a small false alarm rate. Besides, the DYPSA is more sensitive to noise with a good detection rate of 20% at 0 dB and a high false alarm rate surpassing 70%.

12 illus, 21 ref

022346   Rajavarman V N;Rajagopalan S P (Information Technology Dep, Dr. M.G.R. Univ, Chennai-95) : Optimisation of significant GA factors using statistical tools. Int J Comp Applic 2014, 9(2), 134-42.

An approach to GA efficiency improvement has been developed in this paper. This approach is based on using statistical methods of inference in order to: (1) identify GA factors significantly affecting the efficiency of Genetic Algorithms, and (2) to find the optimal values for such factors. It will be shown that after substitution of the optimal values obtained using the developed approach, the search speed of Genetic Algorithms substantially improves.

7 ref

022345   Radhakrishnan T;Swaminathan S (SRC, SASTRA Univ, Tamil Nadu) : Hologram communication. Int J Comp Applic 2014, 9(2), 207-13.

Holography is a technique that allows the light scattered from an object to be recorded and later reconstructed so that it appears as if the object is in the same position relative to the recording medium as it was when recorded. The image changes as the position and orientation of the viewing system changes in exactly the same way as if the object were still present, thus making the recorded image (hologram) appears three dimensional. Holograms can also be made using other types of waves. The technique of holography can also be used to optically store, retrieve, and process information. This article provides insight into the communication with the help of the hologram using the optical links and other wireless communication techniques.

3 illus, 10 ref

022344   Naresh Kumar;Singh M (AIIT, Amity Univ, Noida, Email: mstomer2000@yahoo.com) : Domain independent named entity recognition system based on finite state automata. Int J Adv Comput Inf Technol 2014, 3(1), 1-11.

Designing Named Entity Recognition (NER) system becomes difficult because identifying the right entities in a group of entities with the same name is extremely difficult. Another problem is that NER system built for one domain does not perform well for another domain. The major problems in front of today's named entity systems are question of portability and system performance. In this Proposed Work, Named Entity Recognition System attempts to address these issues through the use of Finite State Automata modeling. To make this system free from grammar rules, we employ highly flexible Finite State Automata -based architecture. This architecture allows it to make use of a broad range of knowledge sources in making its tagging decisions. To achieve the objective we use the dictionary for the identification of named entities and the Finite State Automata to make this system free from grammar rules. In this proposed work, we mainly focus on Name, Time, Location, Organization, and Institute NE. We design a Finite State Automata for above mentioned named entities and a dictionary is also used by this FSA to recognize all NE. We have implemented this system using new FSA-NER algorithm in Microsoft net framework 4.0. The implemented system shows a significant improvement in recognizing almost all NE mentioned above from the text taken as a test corpus.

12 illus, 11 ref

022343   Jangra A;Saini T (Univ Institute of Engineering and Technology, Kurukshetra Univ, Kurukshetra, Email: er_jangra@yahoo.co.in) : Profit based task scheduling in cloud computing. Int J Adv Comput Inf Technol 2013, 2(3), 61-6.

Objective of this paper is to apply Profit Based task scheduling in cloud computing platform, to make it more efficient where resources have different costs and computation performance, an algorithm based on both costs and profit with task scheduling is proposed, which deploys a scheduling algorithm for making efficient mapping of tasks to available resources in cloud. The proposed scheduling algorithm measures both resource cost and computation performance and improves the computation and communication ratio by the user tasks according to a particular cloud resource's processing capability and sends the tasks jobs to the resources.

1 illus, 2 tables, 15 ref

022342   Hamarsheh A;Goossens M (Computer Information Technology Dep, Faculty of Engineering and Information Technology, The Arab American U, Jenin, Palestine) : Breaking the deadlocks for transition to IPv6. IETE Tech Rev 2014, 31(6), 405-21.

Paper analyses the technical and non-technical obstacles that block the widespread deployment of IPv6 on the Internet (at both sides: end-users and Internet Service Providers (ISPs)). It reviews the current basic and standard IPv6 transition mechanisms that have been proposed by the Internet Engineering Task Force (IETF). The paper also suggests transparent, auto-configured, and cost-effective solutions for both end-users and ISPs parties, and compares them with the current techniques to allow a smooth and successful widespread deployment of IPv6.

^iia17 illus, 3 tables, 35 ref

022341   Dewan K;Johri A;Mishra R K (NO, Faculty of Natural Science Jamia Millia Islamia, University, New Delhi) : Development of secured cyber applications: issues, challenges and methodlogies. Int J Comp Applic 2014, 9(2), 149-54.

Cyber security, once an issue of interest for Intelligence Agencies of the various countries, has gained importance in almost all sectors of life wherever the new technology based advancements have taken place around the globe. Governments, Universities, Business houses all have become vulnerable in one way or the other in today's cyber era where terrorism (w.r.t. violence as well as economic terrorism) has also become a prime issue of concern. The gravity of the threat has been well realized by all and a great effort is being put in developing methodologies and framework so that the newly developed cyber application provide good security while ensuring the authorized access to appropriate valid users. This paper presents the ongoing efforts and development of Framework for the Development of Secured Cyber Application.

2 illus, 9 ref

022340   Deepika;Yadav M;Bhatia K;Madaan R (NO, , ) : Frame work for presence factor-oriented blog summarization. Int J Adv Comput Inf Technol 2014, 3(1), 25-36.

Earlier researches that had been carried out to find the summary of the blog pages was limited to the content of blog post. The first thing 1 noticed was omisson of the title of the blog post in the summarization through online summarizer tools, we find that Only a set of representative sentences could be drawn out. Title is an important part of a blog post. It has been found out that the blog post contains the content related to the title of the blog post which helps the user to search the information required. In this paper, we proposes a framework that helps the user in the task of extracting blog summary using the title of the blog past. By using this proposed framework we further get access to several tools by simplifying the overall development of new applications. We also present an algorithm for locating all the keywords of the title in a blog sentence. Finally, we demonstrate the feasibility of our framework by means of an instantiation that achieved a precision and recall of 85.7% and 85.7%, respectively.

022339   Chen D;Huang X;Wang D;Jia L (Software College, Northeastern Univ, Shenyang, China, Email: chendm@mail.neu.edu.cn) : Public transit hubs identification based on complex networks theory. IETE Tech Rev 2014, 31(6), 440-51.

Hubs identification is important for the stability and attack tolerance of complex networks. This paper focuses on public transit hubs identification, and it is useful for the optimization, design, and evaluation of public transit systems. Three public transit hubs identification methods are proposed in this paper. The first one is based on comprehensive effects of stations on the distance and the transfer, and the second one is based on preferences of passengers Transfer - Shortest Path, and the third one is based on preferences of passengers Shortest Path - Transfer. Three employed methods are applied in the Shenyang (the capital of Liaoning province of China) bus transit system, and experimental results show that they are available and especially feasible for finding those potential nodes who play key roles in the network but are not commonly regarded as important nodes in practice, and it is beneficial for traffic policy making.

8 illus, 7 tables, 23 ref

022338   Chakraborty P (Computer Engineering Div, Netaji Subhas Institute of Technology, New Delhi-110 078, Email: pinaki_chakraborty_163@yahoo.com) : Is 'compiler construction' a dead subject. Curr Sci 2015, 108(5), 777-8.

1 table

022337   Bhardwaj N;Rajeev (NO, , ) : Efficient node selection based load balancing frame work for MANETs. Int J Adv Comput Inf Technol 2014, 3(1), 17-24.

Now days, the mobile and manageable computing and wireless technologies are on great demand which is raising the research area in field of wireless mobile network. A mobile ad hoc netwokisa set mobile nodes onnected and communicating with each other without any centralized computing and physical infrastructure. In a MANET, the nodes are mobile and hence the inter-node connectivity may change during normal phenomenon. Due to this the routing becomes a challenging task and an imbalance of load may occur in thenetwork.

022336   Baliyan N;Sandeep Kumar (Computer Science and Engineering Dep, Indian Institute of Technology Roorkee, Roorkee, Uttrakhand) : Software process and quality evaluation for semantic web applications. IETE Tech Rev 2014, 31(6), 452-62.

Semantic Web applications offer the benefit of providing reusable machine understandable content in the form of an ontology. Machine understandability is one of the most important aspects that differentiate Semantic Web based applications from traditional software. Hence, there is a need to adapt several features of the Software Engineering paradigm to Semantic Web based application development in order to make development and delivery of the latter, more efficient. In this paper, a rigorous review of the state of the art in this area has been presented. The existing works on Software Engineering processes for Semantic Web application development, on the process for reengineering web applications to Semantic Web applications, and on the quality assessment of Semantic Web applications have been reviewed with discussion on the brief process, tools used, contribution, limitations, and some other features of each work. In addition to identified research gaps in these directions, some observations have also been drawn.

3 illus, 5 tables, 47 ref

022335   Ananthan T V;Nakkeeran R (Computer Science Dep, Dr. M. G. R. Univ, Chennai, Tamil Nadu) : Amelioration of BEBA in distributed MAC protocol to reduce the waiting time of a station in WLAN (802.11). Int J Comp Applic 2014, 9(2), 201-6.

In this paper, we perform an in-depth study of the Binary Exponential Back-off Algorithm (BEBA) that is widely used in distributed Medium Access Control (MAC) protocols to avoid collision when more than one machine try to access the medium. We begin with a generalized framework of modeling of BEBA. Then we identify a key difference between BEBA and the commonly assumed p-persistent model. Due to the characteristics of BEBA it checks the medium only after the timer becomes zero, but the proposed BEBA frequently checks the medium whether it is idle or not. Also it uses a contention window to make the slot succeeding a busy period has a uniform contention rate from other slots. This causes access to a slot to be uniform and independent on whether or not the slot immediately follows a busy period. We propose a detailed model to bate the waiting time of station which is in the contention window. From reducing the waiting time of a station it expedite the medium access. It is demonstrated that the proposed model is an accurate characterization of BEBA algorithm in a broader range of system configuration.

4 illus, 9 ref

022334   Akana C M V S;Naga Raju O;Sirisha K P;Prasad R S;Balaji S (Computer Science & Engineering Dep, A.M.C. Engineering College, Bangalore) : Design of audio broad caster and listener using peer to peer network. Int J Comp Applic 2014, 9(2), 155-63.

Authors study how to assign a subset of the media data to each supplying peer and the fast amplification of the peer-to-peer streaming capacity. Intuitively, among multiple requesting peers, service priority should be given to those who promise higher out-bound bandwidth offers, because they will contribute more to the peer-to peer streaming capacity after becoming supplying peers. We have shown that how to realize such a differentiated admission policy and that fast capacity amplification will ultimately benefit all peers.

8 ref

022333   Ahn J;Kim C (NO, , Suwon Gyeonggi, Republic of Korea, Email: jhahn@kgu.ac.kr) : Inter-message causality satisfying multicast protocol for reducing gossip message redundancy in geographically distributed sensor networks. Int J Adv Comput Inf Technol 2013, 2(3), 52-60.

In this paper, authors, present a causally ordered delivery guaranteeing protocol for overlapping multicast groups based on sensor brokers: In the protocol, sensor brokers might lead to make overlapping multicast networks organized by subscriber's interests. The message delivery order has been guaranteed consistently and all multicast messages are delivered to overlapping subscribers using gossip-based protocols by sensor brokers, especially based on gossip-pull systems, which are only used when subscribers request their messages to sensor brokers. Therefore, these features of the protocol might be significantly less redundant rather than those of the gossip-push systems, which are periodical dissemination of sensor brokers and highly scalable for the area of the applications requiring only the minimum causal information.

3 illus, 11 ref

021428   Waghmode S;Kolhe Kishore (Information Technology Dep, MIT College of Engineering, Pune) : An adaptive approach for software cost estimation using hybrid model. Int J latest Technol Engng Mgmt appl Sci 2014, 3(11), 85-9.

Technology has become an indispensable part of everyone's life in today's competitive and globally connected world. One of the key and most important arm of continuously evolving technological framework is evolvement and innovations in areas of different software technologies, tools and packages that are either available or being made available on continual basis. While software development and configuration in one of the major contributors to the global economy, it's also remains one of the most complex and challenging business to be in as it doesn't always offer you tangible work-products to plan and estimate for Among different phases of software development process, software cost estimation and planning is the most important phase and when executed effectively and accurately, help us avoid costly delays and/or project scraps that are prevalent in this industry. There isn't a single formula based method in market that can guarantee you accurate estimation and it typically involves decomposition of larger project in smaller, manageable chunks and then estimating these individual pieces in relation to larger work product using facts and data from our previous, experiences from similar implementations. In this model, we have proposed a variable reduction technique based on auto associative clustering, and multilayer feed-forward the neural networks. The Kernel component analysis is log-linear regression functions calibrated with large data set with ordinary least squares. Based on the COCOMOII data set, we have showed that Kernel component analysis can improve the estimation model accuracy by shrinking the input variables into an equivalent pattern and removing irrelevant variable. We have showed that the models obtained by applying Kernel component analysis are more persistent, correct and reliable.

3 illus, 1 table, 19 ref

021427   Upneja V;Kamboj S;Manuja P (NO, JNIT, Jaipur Rajasthan) : Cloud computing a internet based computing. Int J latest Technol Engng Mgmt appl Sci 2015, 4(5), 31-3.

In this paper we will discuss about Cloud Computing a Internet Based Computing. Services can be accessed from anywhere in the world by multiple devices. The cloud model leads to basically two different kinds of clouds: private and public. The public clouds are those that offer IT services to any customer over the Internet. Private clouds offer IT services to a predefined group of customers, with access through Internet or private networks. You might have also heard about internal and external clouds. The former are a subgroup of the private clouds, and provide services within the same company or corporate group. The latter may be public or private and provide services to other companies.

1 illus, 12 ref

021426   Umesh I M;Srinivasan G N (NO, Bharathiar University, Coimbatore, Tamilnadu) : Study on bad code smell. Int J latest Technol Engng Mgmt appl Sci 2015, 4(5), 11-3.

Software quality degenerates over time due to various reasons like software ageing, inconsistent design and improper requirement analysis during early stages of software development. Bad code smell is an indication of the persistent deeper problem that may exist. Bad Code smells are neither bugs nor technically incorrect and hence do not prevent the software from normal functioning. Refactoring is the term used to describe the process of removing the bad code. This paper throws light on bad code smell and detection techniques available. The paper is divided in three sections: first we introduce code smells and methods to detect them, and then we review of various studies conducted on these bad code smells. Finally we will describe the results and discuss them.

1 illus, 1 table, 7 ref

021425   Sheshasayee A;Lakshmi J V N (Computer Science and Reseach Dep, Quaid-E--Millath Government College, Chennai, Email: jlakshmi.research@gmail.com) : Comparative analysis on machine learning algorithms implemented on Map Reduce Paradigm. Int J Data Mining Emerging Technol 2015, 5(1), 1-5.

Big data is clearly a game changer, enabling organisations to gain insights from new sources ofdata that was ever mined in the past. Working with such data whose size and variety is beyond the ability of typical database software to capture, store, manage and analyse. Hadoop is evolving open source framework for Big data analytics. It includes a distributed file system a parallel processing framework called Apache Map-Reduce. Map-Reduce paradigm solves many problems associated rising data volume by modelling algorithms. The machine learning field worked tremendously towards implementation of various algorithms on a Map-Reduce system. This paper presents a comparative analysis of Canopy, Min Hash and Mean Shift algorithms in a standard implementation of Hadoop in Map-Reduce distributed paradigm.

^iia5 illus, 16 ref

021424   Sharma B;Pandit S V (NO, , ) : Survey on different techniques of tampering and their detection. Int J latest Technol Engng Mgmt appl Sci 2014, 3(10), 151-5.

In today's highly Information Technology era it is important to provide a high level of security to protect highly processing, tampering can be defined as changing orignal sensitive and private information. Digital images -from digital cameras can be watermarked either in time domain or in frequency domain. The goal is to produce an efficient, secure and invisible watermarked image using digital watermarking by improving the quality and increasing the to clearly express the information content of the image heftiness of watermarked image. This can be done by image or secret messages. But detection of originality of the image is done by different techniques which are described in this paper. This work present different types of attacks with different kind of tampering and detection techniques.

1 illus, 9 ref