025600   Deepthi S;Baswaraj D (NO, CMR Institute of Technology, JNTUH, Hyderabad, Email: iamdeepthimanognya@gmail.com) : Architecting a secure enterprise data sharing environment to the edge. Int J Adv Comput Inf Technol 2012, 1(3), 306-2.

There are so many methods and implementations for developing a secured communication with the users that our located within the security domain. Now days as technologies and number of users is increasing day by day we need to provide high secure for each and every new established connection. But the problem arises when any new communication is established outside the security domain. To avoid this problem, investigates the requirements, technologies and risk mitigation techniques for securely sharing information with the tactical user. The new enterprise architecture needs to eliminate the stovepipe architectures and open the doors to share information across traditional and non-traditional domain boundaries.

1 illus, 7 ref

025599   Bhasin S;Mehta P;Gupta A (ECE Dep, Punjab College of Engineering and Technology, Lalru, Email: missbhasin@gmail.com ) : Comparison of AODV, OLSR and ZRP in mobile ad-hoc network on the basis of jitter. Int J Adv Comput Inf Technol 2012, 1(3), 346-53.

Mobile Adhoc networks are rapidly deployable and self-configuring networks. There is no need for existing infrastructure. These are wireless links. In this network nodes are mobile, topology can be very dynamic. Here the nodes must be able to relay traffic since communicating nodes might be out of range. A MANET can be a standalone network or it can be connected to external networks (Internet). The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic. Its routing protocol has to be able to cope with the new challenges that a MANET creates such as nodes mobility, security maintenance, and quality of service, limited bandwidth and limited power supply. These challenges set new demands on MANET routing protocols. The main objective is to compare the performance based on jitter present in transmission of packet in a MANET by using different types of protocols viz: Proactive, Reactive, Hybrid. This system is developed for IEEE 802.11b based Wireless network and simulated through Qualnet 5.0. Packet size and No. of users are the two parameters in this paper which helps to find out the suitable type of traffic that can be use in a MANET.

5 illus, 1 table, 26 ref

025598   Bansal M;Ranade S K (Computer Science Dep, Punjabi University, Patiala, Email: meenubansal11@gmail.com) : Fractal image compression. Int J Adv Comput Inf Technol 2012, 1(3), 275-56.

Demand for images, video sequences and computer animation has increased drastically over the years. As a result there is renewed interest in improving algorithms for the compression of image data. Image compression is a process of reducing or eliminating redundant or irrelevant data. JPEG is currently the accepted industry standard for still image compression, but alternative methods are also being explored. Fractal Image Compression is one of them. Studies fractal image compression, some basic concepts like contractive mapping, collage theorem, affine transformation and Iterative Function System for the fractal image coding, Encoding procedure, decoding procedure and some speed up techniques for encoding. The study will be very helpful for the beginners in fractal image compression.

^iia7 illus, 1 table, 22 ref

025597   Atreja T;Sharma A K;Duhan N (Computer Engineering Dep, YMCA University of Science and Technology, Faridabad, Email: tushar.atreja@gmail.com) : Comparison study of web page ranking algorithms. Int J Adv Comput Inf Technol 2012, 1(3), 354-63.

Web pages are returned in response to a web user query on the search interface of a search engine. Search engines, for the same, use some algorithms so as to bring an ordering among the web pages to be returned to the user in response. Such algorithms are named "Page Ranking Algorithms". Many of these algorithms exist in practice and are in use by a couple of search engines as the literature dictates. A detailed comparison study is being performed on three of such algorithms: first is the Page Rank, the Google's algorithm; second, the Weighted Page Rank, an extension to the first one and the last being the PRLV (Page Ranking based on Link Visits), which works on the pattern of Page Rank and takes number of visits of inbound links of Web pages into account.

6 illus, 3 tables, 11 ref

025596   Arun Kumar;Jaiswal M;Shelza (Computer Science and Engineering Dep, SVIET, Banur, Email: arunjas09@gmail.com) : Survey of classification algorithm used in diagnosis of hearing disorders. Int J Adv Comput Inf Technol 2012, 1(2), 195-8.

Hearing disorders are classified into various categories according to the anatomy of the ear that explains various parts of ears. Hearing disorders are categorized according to part in which hearing problem comes. Helps in classifying hearing disorders with the help of various algorithms that are based on wavelet packets and support vector machine, artificial neural network, DPOAE, modified back propagation network. Besides of many algorithms available, it's still very challenging to detect type of hearing disorder.

^iia1 illus, 5 ref

025595   Ahmed C F;Tanbeer S K;Jeong B S (Computer Engineering Dep, Database Lab, Kyung Hee Univ, 1, Seochun-dong, Kihung-gu, Youngin-si, Kyunggi-do-466 701, Republic of Korea) : Framework for mining high utility web access sequences. IETE Tech Rev 2011, (NULL), 3-16.

Mining web access sequences (WASs) can discover very useful knowledge from web logs with broad applications. By considering non-binary occurrences of web pages as internal utilities in WASs, e.g., time spent by each user in a web page, more realistic information can be extracted. However, the existing utility-based approach has many limitations such as considering only forward references of web access sequences, not applicable for incremental mining, suffers in the level-wise candidate generation-and-test methodology, needs several database scans and does not show how to mine web access sequences with different impacts/significances for different web pages. In this paper, we propose a novel framework to solve these problems. Moreover, we propose two new tree structures, called utility-based WAS tree (UWAS-tree) and incremental UWAS-tree (ILWAS-tree) for mining WASs in static and incremental databases, respectively. Our approach can handle both forward and backward references, static and incremental data, avoids the level-wise candidate generation-and-test methodology, does not scan databases several times, and considers both internal and external utilities of a web page. The IUWAS-tree is also applicable for interactive mining. Extensive performance analyses show that our approach is very efficient for both static and incremental mining of high utility WASs.

13 illus, 22 ref

024450   Shah S K;Soni R K;Shah B (Electrical Dep, Faculty of Technology & Engineering, M S U of Baroda, Vadodara, Gujarat, Email: satishkshah_2005@yahoo.com) : FPGA implementation of image compression algorithm using bottom-up approach of quad tree technique. IETE J Res 2011, 57(2), 111-7.

This paper presents an optimal technique for image compression by which one can achieve maximal storage and transmission capabilities. Realizing image compression hardware into a Field Programmable Gate Array (FPGA) reduces the implementation cost as well as the prototyping and design time cycle. Aggressive algorithm to architecture mapping of a Quad Tree based image compression method produces a fast, compact pipelined design. Mapped into a Xilinx Spartan II, XC200S-5PQ208 FPGA, this design utilizes as much as half the resources that other algorithms such as Discrete Cosine Transform and Wavelet Transform use. Performance of this implementation exceeds those of similar and or greater resource size, and allows for real-time image compression of an image up to 256 pixels by 256 pixels at 256 levels of gray. It is found that the algorithm provides a high compression ratio ranging between 0.12 and 0.68.

11 illus, 1 table, 9 ref

024449   Sengupta A;Sedaghat R (Electrical and Computer Engineering Dep, Ryerson Univ, Toronto, Canada, Email: asengupt@ee.ryerson.ca) : High-level synthesis design flow from ESL to RTL with multi-parametric optimization objective. IETE J Res 2011, 57(2), 172-89.

High-level synthesis (HLS) has emerged as the most sophisticated way to bridge the gap between electronic system level (ESL) and its respective structural building block at the register transfer level (RTL). As the growth of system complexity rapidly increases, the gap between high level and RTL needs to be filled. Much advancement has been made in the area of HLS, but none of the works have focused on a formal design methodology that bridges the gap from ESL to RTL considering multi-parametric optimization requirements. This paper exclusively focuses on the formal steps required for multi-parametric optimized HLS design flow. This is significant for industrial projects as well as for the development of fully automated HLS tools for the current generation of portable devices and high-end applications. The design flow initiates with the mathematical model of the application, performs multi-objective design space exploration and finally shows all the steps necessary after exploration for the HLS design. This paper explicitly focuses on highlighting the design flow with optimization of three parameters area, execution time and power consumption during HLS design while working under the prerequisite of stringent operational constraints. The implementation of the proposed method on Field-programmable Gate Array and the chip layout generation will also be presented.

17 illus, 11 table, 25 ref

024448   Sayeed F;Hanmandlu M;Ansari A Q (NO, PA College of Engineering, Mangalore, Email: sayeed.farrukh@gmail.com) : Face recognition using segmental euclidean distance. Def Sci J 2011, 61(5), 431-42.

In this paper an attempt has been made to detect the face using the combination of integral image along with the cascade structured classifier which is built using Adaboost learning algorithm. The detected faces are then passed through a filtering process for discarding the non face regions. They are individually split up into five segments consisting of forehead, eyes, nose, mouth and chin. Each segment is considered as a separate image and Eigenface also called principal component analysis (PCA) features of each segment is computed. The faces having a slight pose are also aligned for proper segmentation. The test image is also segmented similarly and its PCA features are found. The segmental Euclidean distance classifier is used for matching the test image with the stored one. The success rate comes out to be 88 per cent on the CG database created from the databases of California Institute and Georgia Institute. However the performance of this approach on ORL database with the same features is only 70 per cent. For the sake of comparison, discrete cosine transform (DCT) and fuzzy features are tried on CG and ORL databases but using a well known classifier, support vector machine (SVM). Results of recognition rate with DCT features on SVM classifier are increased by 3 per cent over those due to PCA features and Euclidean distance classifier on the CG database. The results of recognition are improved to 96 per cent with fuzzy features on ORL database with SVM.

25 illus, 21 tables, 21 ref

024447   Prasanna M;Chandran K R;Thiruvenkadam K (CIS and IT Dep, PSG College of Technology, Coimbatore, Tamil Nadu) : Automatic test case generation for UML collaboration diagrams. IETE J Res 2011, 57(1), 77-81.

A new model-based automatic test case generation for object-oriented systems using UML diagrams has been presented. Real-time application is expressed in the form of Collaboration diagram constructed using Rational Rose software. Collaboration diagram is converted into an intermediate graph form. Prim's and Dijkstra's algorithms has been applied to bring all the possible test cases from the graph. Illustrative case study has been presented in order to establish the effectiveness of our approach coupled with mutation analysis.

4 illus, 6 tables, 22 ref

024446   Park K H;Shin S H;Chang K;Kim T Y (GSAIM, Chung-Ang Univ, 221 Heukseok-Dong, Dongjak-Gu, Seoul, Republic of Korea, Email: oracle1027@wm.cau.ac.kr) : Facial color transition model to express character emotion. IETE J Res 2011, 57(2), 156-64.

High quality graphics for game characters has been continuously improving, spurred by the astonishing growth of the graphics technology. Despite such improvements, the current expression of emotion has limited representation because it is difficult to implement it in real-time and a large amount of storage is required to store sprites for various feelings. Since users are demanding a more expressive character to reflect emotion, such restrictions can prevent the users from getting fully indulged in a game. To address this, we propose a facial color transition model, which is a combination of the emotional colors based on the theory of emotion, the emotion-color association, and the emotional transition with personal traits. The model is implemented by using the homeostatic value, the accumulated stimulus, and nonlinear transition functions, which support diverse changes according to the character's personality with low computational cost. The reflection of the game character's emotion on its facial color will not only make users immerse into the game, but also enrich their fantasy in games.

9 illus, 4 tables, 17 ref

024445   Hanmandlu M;Das A (NO, Indian Institute of Technology Delhi, New Delhi-110 016, Email: mhmandlu@gmail.com) : Content-based image retrieval by information theoretic measure. Def Sci J 2011, 61(5), 415-30.

Content-based image retrieval focuses on intuitive and efficient methods for retrieving images from databases based on the content of the images. A new entropy function that serves as a measure of information content in an image termed as 'an information theoretic measure' is devised in this paper. Among the various query paradigms, query by example (QBE) is adopted to set a query image for retrieval from a large image database. In this paper, colour and texture features are extracted using the new entropy function and the dominant colour is considered as a visual feature for a particular set of images. Thus colour and texture features constitute the two-dimensional feature vector for indexing the images. The low dimensionality of the feature vector speeds up the atomic query. Indices in a large database system help retrieve the images relevant to the query image without looking at every image in the database. The entropy values of colour and texture and the dominant colour are considered for measuring the similarity. The utility of the proposed image retrieval system based on the information theoretic measures is demonstrated on a benchmark dataset.

9 illus, 9 tables. 27 ref

024444   Boroujeni F Z;Rahmat R W O K;Mustapha N; Affendey L S;Maskon O (NO, Islamic Azad Univ, Khorasgan Branch, Iran, Email: farsad.zamani@ieee.org) : Automatic selection of initial points for exploratory vessel tracing in fluoroscopic images. Def Sci J 2011, 61(5), 443-51.

Automatic extraction of vessel centerlines is viewed as an essential process in majority of image-guided diagnostic and therapeutic applications. Among a considerable number of methods, direct exploratory tracing method is known as an efficient solution for reliable extraction of vessel features from two-dimensional fluoroscopic images. The first step of most automatic exploratory tracing algorithms is to collect some candidate initial seed points as well as their initial tracing directions. To detect reliable initial points, a validation procedure is required to filter out the false candidates and avoid unnecessary tracing. Starting from reliable initial points, the algorithm efficiently extracts the centerline points along the initial direction until certain pre-defined criteria are met. However, most of these algorithms suffer from incomplete results due to inappropriate selection of the initial seed points. The conventional seed point selection algorithms either rely merely on signal-to-noise ratio analysis, which results in a large number of false traces, or impose a set of strict geometrical validation rules which leads to more false negatives and as a consequence more time shall be spent on computation. This paper presents a new method for efficient selection of initial points for exploratory tracing algorithms. The proposed method improves the performance upon existing methods by employing a combination of geometrical and intensity-based approaches. Moreover, it provides a tunable trade-off between the strictness of the validation procedure and computational efficiency. The results of comparative performance with other proposed techniques are included.

6 illus, 18 ref

024443   Blake J;Latifi S (NO, Nevada Univ, Las Vegas NV 89154-1022, USA, Email: jonathan.blake@unlv.edu) : Digital watermarking security. Def Sci J 2011, 61(5), 408-14.

As creative works (e.g. books, films, music, photographs) become increasingly available in digital formats in a highly connected world, it also becomes increasingly difficult to secure intellectual property rights. Digital watermarking is one potential technology to aid intellectual property owners in controlling and tracking the use of their works. Surveys the state of digital watermarking research and examines the attacks that the technology faces and how it fares against them. Digital watermarking is an inherently difficult design problem subject to many constraints. The technology currently faces an uphill battle to be secure against relatively simple attacks.

3 illus, 12 ref

023359   Suneet Kaur;Ubboveja V S;Agarwal A (Civil Engineering Dep, M.A. National Institute of Technology, Bhopal) : Artificial neural network modeling for prediction of CBR. Indian Highw 2011, 39(1), 31-7.

Importance of development and up-gradation of existing highway infrastructure in the country has been greatly acknowledged during the last decade and serious efforts are being made to this end, both by the Central and the State Governments. The parameter, almost universally used to characterize soils for the purposes of pavement design, is the California Bearing Ratio. Many attempts have been made to correlate the CBR with the soil properties to obviate laboratory testing. The laboratory tests to determine CBR are expensive and time consuming with adverse bearing on the preparation of the Detailed Project Reports. An attempt has been made in this paper to develop an Artificial Neural Network (ANN) model to determine reasonably accurate CBR, based on the simpler laboratory tests for grading and Atterberg limits of the soil. Data used in the training and testing of the model was collected from some soil samples tested by the author and additionally from tests got conducted by various Madhya Pradesh State entities undertaking the development of highways in the State. Back Propagation Neural Network is used for function approximation and the model has been trained by Lavenberg-Marqurdt learning algorithm. Test results achieved in the model demonstrate that the CBR can be predicted to a reasonable degree of accuracy. Use of an ANN model can thus greatly reduce the cost and time involved in the design of pavements.

6 illus, 5 tables, 11 ref

023358   Murtazaev A;Oh S (Computer and Information Engineering Dep, Ajou Univ, Suwon, Korea) : Sercon: server consolidation algorithm using live migration of virtual machines for green computing. IETE Tech Rev 2011, 28(3), 212-31.

Virtualization technologies changed the way data centers of enterprises utilize their server resources. Instead of using dedicated servers for each type of application, virtualization allows viewing resources as a pool of unified resources, thereby reducing complexity and easing manageability. Server consolidation technique, which deals with reducing the number of servers used by consolidating applications, is one of the main applications of virtualization in data centers. The latter technique helps to use computing resources more effectively and has many benefits, such as reducing costs of power, cooling and, hence, contributes to the Green IT initiative. In a dynamic data center environment, where applications encapsulated as virtual machines are mapped to and released from the nodes frequently, reducing the number of server nodes used can be achieved by migrating applications without stopping their services, the technology known as live migration. However, live migration is a costly operation; hence, how to perform periodic server consolidation operation in a migration-aware way is a challenging task. We propose server consolidation algorithm - Sercon, which not only minimizes the overall number of used servers, but also minimizes the number of migrations. We verify the feasibility of our algorithm along with showing its scalability by conducting experiments with eight different test cases.

12 illus, 4 tables, 29 ref

023357   Mishra B S P;Dehuri S (Computer Science and Engineering Dep, KIIT Univ, Bhubaneswar) : Parallel computing environments: a review. IETE Tech Rev 2011, 28(3), 240-7.

This article presents a review of various hardware and software parallel computing environments so far developed for the implementation of parallel algorithms to solve complex and computationally dominated optimization problems. These parallel environments are composed of parallel programming tools, performance evaluation tools, debuggers and optimization libraries. The environments can be classified based on the ease of implementation, hardware independence, ease to understand, and guarantee of performance.

^iia6 illus, 1 table, 28 ref

023356   Ma T;Yan Q;Liu W;Guan D;Lee S (School of Computer and Software, Nanjing Information Science and Technology Univ, People's Republic of China, Computer Dep, Keyung Hee Univ, South Korea) : Grid task scheduling: algorithm review. IETE Tech Rev 0000, 28(2), 158-67.

New distributed heterogeneous computing platform, grid aims at achieving Internet-wide resource sharing and collaborative computing. Grid task scheduling (GTS) is the key issue of grid computing, and its algorithm has a direct effect on the performance of the whole system. In this paper, two key entities in GTS, applications and target systems, are defined first. And then two types of the most popular GTS algorithms, namely, meta-task GTS algorithm and directed acyclic graph GTS algorithm, are discussed in details in accordance with the classification of the traditional deterministic algorithm and heuristic intelligent algorithm. In addition, the comparative analysis is made among them. Finally, some main research directions of GTS are pointed out.

5 illus, 1 table, 65 ref

023355   Lan G C;Hong T P;Tseng V S (Computer Science and Information Engineering Dep, National Kung Univ, 701, Taiwan) : Reducing database scans for on-shelf utility mining. IETE Tech Rev 0000, 28(2), 103-12.

Utility mining has recently been an emerging topic in the field of data mining. It finds out high-utility itemsets by considering both the profits and quantities of items in transactions. In real applications, however, utility mining may have a bias if items are not always on shelf. On-shelf utility mining is then proposed, which considers not only individual profit and quantity of each item in a transaction but also common on-shelf time periods of a product combination. In the past, a two-phase on-shelf utility mining was proposed to discover the desired patterns in on-shelf utility mining. It, however, adopted the level-wise mining way to find the patterns. To speed up the execution efficiency, a three-scan mining approach is thus proposed in the paper to efficiently discover high on-shelf utility itemsets. The proposed approach utilizes an itemset-generation mechanism to prune redundant candidates early and to systematically check the itemsets from transactions. At last, the experimental results on synthetic datasets show the proposed approach has a better performance than the previous one.

8 illus, 7 tables, 19 ref

023354   Kolasa T;Krol D (Institute of Informatics, Wroclaw Technology Univ, Wyb. Wyspianskiego 27, 50-370 Wroclaw, Poland) : Survey of algorithms for paper-reviewer assignment problem. IETE Tech Rev 0000, 28(2), 123-33.

This paper analyzes some details of artificial intelligence algorithms to paper-reviewer assignment problem. In particular, the study on most common algorithms like genetic algorithm (GA), ant colony optimization (ACO) and tabu-search (TS) is made and the performance of these algorithms in paper-reviewer assignment problem is tested. Moreover, two hybrid methods that efficiently combine the above-mentioned algorithms are proposed: the ACO-GA and GA-TS algorithms. To measure the performance of these algorithms, extensive computational experiments are conducted. Evaluation using different data sets shows that the proposed algorithms are effective and achieve good results.

7 illus, 3 tables, 24 ref

023353   Dagdeviren O;Korkmaz I;Tekbacak F;Erciyes K (Computer Engineering Dep, Izmir Institute of Technology, 35430, Urla) : Survey of agent technologies for wireless sensor networks. IETE Tech Rev 0000, 28(2), 168-84.

Wireless sensor networks (WSNs) do not have a fixed infrastructure and consist of sensor nodes that perform sensing and communicating tasks. The WSNs have large application spectrum such as habitat monitoring, military surveillance, and target tracking, where sensor nodes may operate distributed in highly dynamic environments. Battery-constrained sensor nodes may aggregate the sensed data, localize themselves, and route the packets in an energy-efficient and decentralized manner to enable running the applications. Agents are capable of independent and autonomous action, so that they can successfully carry out tasks that have been delegated to them, thus agent-based approaches are very suitable to apply as the solution of the problems occurring in WSNs. So far many agent-based approaches were proposed for WSNs. This paper surveys the agent technologies for sensor networks by providing a classification, objectives and costs of these approaches with the open research problems. To the best of our knowledge, this is the first study that covers the intersection of the agent technology and sensor networks from a wide perspective.

11 illus, 4 tables, 43 ref

007105   Yamada S;Aoki T;Toyota T (Social Management Engineering Dep, Graduate School of Engineering, Tottori Univ, Tottori-shi, 680-8552 Japan) : Quantitative software quality/reliability prediction based on project management data for waterfall and agile development paradigms. Opsearch 2008, 45(4), 391-404.

Software development productivity and product quality are related to quality of the software development process. Therefore, if we can improve quality of software development process based on project management technologies, software development productivity and product quality will be increased. In this paper, we conduct a multivariate analysis by using process measurement data, and derive a relational expression based on statistically significant factors, which can quantitatively predict final product quality/reliability. Furthermore, we apply a method of collaborative filtering by using process measurement data to predict final product quality from the similarity of software projects. Finally, we compare the results of two methods, i.e., multiple regression analysis and collaborative filtering, in terms of predictive accuracy of final product quality/reliability.

11 tables, 5 illus, 7 ref

007104   Mishra Y (NO, Krishi Vigyan Kendra, Jakhdhar (Guptkashi), Post-Barasu, Disrict- Rudraprayag-246 439) : Factors affecting utilization of mass media by the farmers. Pantnagar J Res 2008, 6(1), 173-5.

Utilization pattern of four mass media viz., newspaper, magazine, radio, and television was studied among 126 farmers from 11 randomly selected villages of community development block Kannauj district Kannauj, Uttar Pradesh. Out of four mass media, radio was most popular medium for agricultural information among farmers. Inability to read, inability to subscribe, lack of time, poor supply of electricity and adverse affect on children were the major factors responsible for less utilization of mass media by the farmers.

4 tables, 4 ref

021062   Sonia;Bhullar J S;Naresh B (Information Dep, Technology, MIMIT, Malout, Email: sonia.mimit@gmail.com) : Comparison analysis of efficient multicast routing protocols. Arya Bhatta J Math Inf 2011, 3(2), 355-62.

Multipoint communications have emerged as one of the most researched areas in the field of networking. As the technology and popularity of the Internet grows, application, such as video conferencing require multicast support, are becoming widespread. This paper analysis a core selection protocol that uses the fact that the median of tree is equivalent to centroid of that tree. The computation of tree's core node does not require any distance, information. Core node can be computed as the sum of weights of of all the links in the tree, which signified the total bandwidth consumed for multicasting a packet. In this paper, authors conclude that centroid core selection protocol is more efficient communication protocol.

3 illus, 1 table, 15 ref

021061   Soni R;Pahuja V (Computer Science Dep, D.A.V. College for Girls, Yamuna Nagar, Email: sonirachna67@gmail.com) : Stochastic schedule risk analysis through building of schedule buffer using monte carlo simulation. Arya Bhatta J Math Inf 2011, 3(2), 395-404.

Deals with the Schedule buffer using probabilistic project risk analysis. For this purpose three cases are used to step through the process. It deals with Risk based determination of buffer through Monte Carlo Simulation for critical path tasks. The focus of this paper is the use of the schedule risk assessment to establish the buffer and to recommend the extent of buffer to reduce the impact on schedule objectives. This provides the project manager with a means of evaluating the progress of the project activities, and a way to reasonably establish milestones for the project management.

8 tables, 12 ref

021060   Sachdeva R K;Sawtantar Singh (Computing Dep, Asia Pacific Institute of Information Technology of India, Panipat, Email: ravisachdeva1983@gmail.com) : Web accessibility - need of physically disabled people. Arya Bhatta J Math Inf 2011, 3(2), 227-32.

Qriginally web was developed as a medium for sharing information irrespective of browsing circumstances including physical disability, platform, devices etc. But with the evolution of web, crisis of websites developed rapidly due to adhoc methodology used and not implementing W3C standards properly. The digital word has ignored the user community of physically disabled people. The purpose of this paper is to describe how ignoring W3C standards can cause problems to physically disabled people.

1 table, 8 ref

021059   Pal S K;Jaiswal A;Chamoli V (NO, DRDO, Metcalfe House, Civil Lines, Delhi-110 054) : Quasigroup based design of new cryptographic schemes. Arya Bhatta J Math Inf 2011, 3(2), 277-94.

In this paper, new schemes are proposed that generate large random Quasigroups based on a user passnvord. Encryption is carried out in two steps. First, a pseudo-message is generated using a Quasigroup based All or Nothing Transform (AONT). Next, this message is encrypted either by a Quasigroup string transformation or by using a computationally efficient cryptographic scheme. To further increase the security of the scheme, the cipher output is processed using single-cycle invertible functions. Analysis has been carried out using similar as well as different text messages and keys for Quasigroup of order up to 256. The schemes have been found to be resistant to many existing statistical attacks. The schemes also depict the avalanche property which has been tested by introducing minor changes in the key and plaintext message. Observations and results show that these schemes are both secure and efficient and can be used for normal as vell as resource constrained environments.

17 ref

021058   John A K;Bhattacharjee A K;Sharma M;Ganesh G;Dhodapkar S D;Biswas B B (Reactor Control Div, Electronics and Instrumentation Group, BARC, , Trombay, Mumbai-400 085) : Design and application of a formal verification tool for VHDL designs. BARC Newsl 2012, (NULL), 34-40.

The design of Control and Instrumentation (C & I) systems used in safety critical applications such as nuclear power plants involves partitioning of the overall system functionality into subparts and implementing each subpart in hardware and/or software as appropriate. With increasing use of programmable devices like FPGA, the hardware subsystems are often implemented in Hardware Description Languages (HDL) like VHDL. Since the functional bugs in such hardware subsystems used in safety critical C&I systems have disastrous consequences, it is important to use rigorous reasoning to verify the functionalities of the HDL models. We describe our work on developing a software tool named VBMC (VHDL Bounded Model Checker) for mathematically proving functional properties of hardware designs described in VHDL. It is based on the principle of bounded model checking. Although the design of VBMC is still evolving, it is currently also being used for the functional verification of FPGA based intelligent I/O (EHS) boards developed in Reactor Control Division, BARC.

4 illus, 1 table, 9 ref

021057   Choudhary A K;Choudhary R k (Computer Science & Engineering Dep, Singhania Univ, Pacheribari(Raj)-333 515, Email: choudharyarun@rediffmail.com) : Performance of mutation testing on object oriented programs. Arya Bhatta J Math Inf 2011, 3(2), 337-48.

With the availability of massive computting power, there has been a resurgence of mutation analysis within computer science community, and work has been done to define the methods of applying mutation testing on Object Oriented Programs. Mutation testing is an important fault based testing technique. The primary use of mutation testing is in determining the effectiveness of test suites and to mak them more effective for detecting certain types of bug. The effectiveness of mutation testing depends heavily on the type of faults that the mutation operators are designed to introduce. This paper is concerned to detect a difference in the output produced as a part of mutation analysis. The checker in the test bench will actually detected the difference to measure the performance of mutation testing.

5 illus, 4 tables, 21 ref

019873   Singh T P;Kusum (NO, Yamuna Institute of Engg. & Technology, Gadholi, Yamuna Nagar, Email: tpsingh78@yahoo.com) : Trapezoidal fuzzy network queue model with blocking. Arya Bhatta J Math Inf 2011, 3(1), 185-92.

Proposes a general procedure to construct a network of fuzzy queue model with blocking by considering two servers in service each with its own queue. In some of these kind of system it generally happens that the arrival rate or service rate are uncertain. So we introduce fuzzy arrival rate and fuzzy service rate ??<109> using the fuzzy concept which results in deriving the state probability P_ij(t) as a fuzzy number. The objective of the paper is to derive the various performance measures such as expected number of customer in system i.e ??L_s, expected waiting time of customer in system, fractional part of potential customer lost etc, which are extracted from the fuzzy state probability function governing behavior of the system. The queue discipline is considered FCFS. A numerical illustration has also been mentioned to support the derived result under trapezoidal fuzzy arithmetic. The basic idea is to apply the a - cut and Zadeh's extension principle to transform the fuzzy queuing system to a family of crisp queue.

13 ref

019872   Rajesh K;Bhatt K;Sonvane D D;Vaibhav K; Duggal V;Karnani U;Chandorkar N;Koli K R;Mundada R S;Apte A G (Computer Division, BARC, Trombay, Mumbai-400 085) : Anupam-Adhya supercomputer. BARC Newsl 2012, 324(1-2), 27-33.

Modern day scientific research increasingly relies on high speed computers in some stage or other. This is true of BARC too, where a large number of scientists and engineers are engaged in research in advanced fields of science and engineering. Computer Division, BARC has developed the ANUPAM series of supercomputers to cater to this ever-increasing demand for computing power. The latest in the series of ANUPAM systems is the ANUPAM-Adhya supercomputer, developed in 2010-11 with a sustained performance of 47 Teraflops. This system is released to users and is being used extensively. Describes the new supercomputer, its architecture, subsystems and some applications that run on the system.

9 illus, ref

019871   Kamlesh Kumari;Aggarwal R K;Sandeep Kumar (Computer Engineering Dep, M.M. Engineering College, Mullana, Ambala, Email: kamal2779@yahoo.com) : Empirical evaluation of model parameters for isolated word recognition system. Arya Bhatta J Math Inf 2011, 3(1), 89-96.

The automatic speech recognition (ASR) is a pattern classification system, having feature extraction at front end and hidden Markov model (HMM) at back end for classification. This paper is an investigation to find empirically the optimum parameters of back end like size of codebook and number of states used in HMM. Experimental results show that size of codebook should be 128 and number of states in HMM should be 6 to attain best performance of ASR for small vocabulary size. All the experiments are conducted in general field conditions and for Indian speaking style. At front end two different feature extraction techniques (LPCC and MFCC) are also compared.

4 illus, 11 ref

019870   Carmichael J (College of Computing, Alghurair Univ, Dubai, UAE, Email: James_n_carmichael@hotmail.com) : Improved text-based algorithm for detecting automatic speech recognition errors: observations from the multimatch project. Arya Bhatta J Math Inf 2011, 3(1), 169-84.

This study reports on improvements made to the phoneme matching algorithm (PMA) the PMA's purpose is to identify word recognition errors in automatically generated transcripts detailing the speech content of digital multimedia soundtracks. When utilising these speech transcripts as a means of searching for a specific segment (clip) within an audiovisual document, it has been observed that even professional researchers tend to underestimate the fallibility of the automatic speech recognition (ASR) technology used to produce these automatic speech-to-text transcriptions. As demonstrated by two of the user evaluation studies reported here, it is usually the case that users - when searching a transcript for some key word or phrase - will, if the transcript does not contain the query term, neglect to conduct a systematic auditory inspection of the corresponding multimedia document's soundtrack, even though such a careful 'listen-through' would be the usual procedure if speech transcriptions were not available. In order, therefore, to alert the user to the possibility that a particular search term may have been incorrectly recognised as some other word or phrase, the PMA - when invoked during a query operation - will parse the transcript's text to locate words or phrases of similar phonetic structure to the query term and present these suspected ASR errors to the user for consideration. When tested on a corpus of digital multimedia documents the improved PMA averaged a 73.64% success rate in correctly identifying words/phrases which were actually instances of misrecognised query terms.

5 illus, 6 tables, 11 ref

019869   Arunjay Kumar (CSE/IT Dep, MIET, Mohri, Shahbad, Kurukshetra, Email: arunjay.shirai04@gmail.com) : Search engine optimization marketing (SOEM): analysis and techniqual concepts. Arya Bhatta J Math Inf 2011, 3(1), 67-76.

Search Engine Optimization (SEO) is an art of making a website to achieve higher position in a search engine when searchers type in their queries. While looking for any content on the web, searchers enter their queries in the search engines (Google, Yahoo, MSN - to name the top 3) of their choice and submit their queries. This paper introduces the concept of speculative search engine optimization (2SEO). Based on some recently conducted studies, guidelines are provided on how to optimize scholarly literature for speculative search engines in general and for any other search engine (like:-Google Scholar) in particular. We make & attempt to discuss the risk of researchers' criminally over-optimizing' their articles.

14 ref

018849   Sushil Kumar;Chander Sain (NO, I.I.E. Kurukshetra University, Kurukshetra, Haryana, Email: sushilkumar0047@gmail.com) : Robotics analysis and programming. Int J Adv Comput Inf Technol 2012, 1(1), 77-9.

Robotics is based on the two enabling technologies are Telemanipulators and ability of numerical control of machines. Gives an overview about the basics related to robots and robot control methods. It also describes a framework for the robot programming with programming interface.

^iia8 ref

018848   Suri P K;Soni M K;Tomar P (Computer Science and Applications Dep, Kurukshetra University, Kurukshetra, Haryana, Email: pksurikuk@rediffmail.com) : Routing in mobile ad hoc network. Int J Adv Comput Inf Technol 2012, 1(1), 7-16.

Goal of the study is to provide a review on various architectures available for routing in Mobile Ad hoc Networks. Mobile Ad hoc networks (MANET) are wireless networks which are infrastructure less in nature. There is no central access point in MANET, each node is able to move in any direction and has the ability to act as a router also. In order to make fast and easy communication between nodes various routing protocols have been proposed. Routing protocols can be categorized under various categories. The routing protocols have been divided under following major categories: Unicast routing protocols, QoS based routing protocols, power aware routing protocols, secure routing protocols, location based routing protocols.

^iia9 illus, 17 ref

018847   Sreenivasa Rao K (School of Information Technology, Indian Institute of Technology Kharagpur, Kharagpur-721 302, Email: ksrao@iitkgp.ac.in) : Role of networks models for developing speech systems. Sadhana 2011, 36(5), 783-836.

This paper discusses the application of neural networks for developing different speech systems. Prosodic parameters of speech at syllable level depend on positional, contextual and phonological features of the syllables. In this paper, neural networks are explored to model the prosodic parameters of the syllables from their positional, contextual and phonological features. The prosodic parameters considered in this work are duration and sequence of pitch (F₀) values of the syllables. These prosody models are further examined for applications such as text to speech synthesis, speech recognition, speaker recognition and language identification. Neural network models in voice conversion system are explored for capturing the mapping functions between source and target speakers at source, system and prosodic levels. We have also used neural network models for characterizing the emotions present in speech. For identification of dialects in Hindi, neural network models are used to capture the dialect specific information from spectral and prosodic features of speech.

22 illus, 34 tables, 146 ref

018846   Singhai A;Saxena A;Shukla J P (Center for Remote Sensing and GIS, , Maulana Azad National Institute of Technology, Email: akinchan.singhai@gmail.com) : Open source software technology in advancement of geomatics education. Int J Geomatics Geosci 2011, 2(1), 42-8.

Geomatics is a relatively new discipline, which is associated with the spatial referenced and heterogeneous geographic information. The rapid growth in the popularity of geomatics is due to advancement in the field of computing techniques, hardware and software, as well as space based and airborne remote sensing technologies. The remote sensing platform has been providing vast amount of geographical information at various levels of temporal, spatial, spectral, radiometric resolution. On the other hand, the development in software technology gives the better solutions at very low budget. Meanwhile the efforts have been made for developing a common platform to disseminate the spatial information among various stakeholders of scientific and educational community. These efforts include providing free software's as well as remote sensing data at absolutely free of cost. A new open source sharing platform has emerged from the joint initiatives of the educationist, researchers and software developers. Study throws light on the contemporary development of this open source technology in field of geomatics. An effort has been made to review the main components of open source technology at desktop and web based platforms, while the significance of open source technologies has been also discussed.

1 illus, 11 ref

018845   Sharma S;Marriwala N;Tripathi C C (ECE Dep, UIET, Kurukshetra University, Kurukshetra, Haryana, Email: er.sumitvashisht@hotmail.com) : Review on different routing protocols in ad-hoc network. Int J Adv Comput Inf Technol 2012, 1(1), 53-60.

Presents the review on different routing protocols for ad hoc wireless networks. This will provide us merits and demerits of routing protocol which used in ad hoc wireless network. In this authors also discuss about new routing protocol based on the Swarm Based Intelligence. The motivation for using Ant like mobile agents for providing routing information to mobile hosts in MANET from the facts that Ant-like agents do not require high bandwidth overhead compare to other routing protocols which discuss in this study. The increase connectivity information provided by Ant can be used to for making better routing decisions which can improve the network performance without causing high over head.

^iia11 ref

018844   Seeran A (NO, Annapurna Medical College, Salem, Tamil Nadu) : Development of FOSS (free open source software) for libraries. Pearl 2011, 5(1), 51-3.

Libraries have to adapt to changing times having a digital library with e-books for which FOSS is needful for every day applications in a library. Free and Open-source software (FOSS) is computer software for which the source code and certain other rights normally reserved for copyright holders are provided under a software license that meets the Open Source Definition or that is in the public domain. This permits users to use, change, and improve the software, and to redistribute it in modified or unmodified forms. It is very often developed in a public, collaborative manner. Open-source software is the most prominent example of open-source development and often compared to user-generated content. The term open-source software originated as part of a marketing campaign for free software. A report by Standish Group states that adoption of open-source software models has resulted in savings of about $60 billion per year to consumers.

7 ref

018843   Rashadul Islam M;Bhuyan M R K (NO, College of Engineering and Science, Louisiana Tech University, Ruston, LA 71270, USA, Email: mri005@LaTech.edu) : Development of software to transform graphically the stress at a point inside a cube in three dimensional directions. Int J appl Engng Res Dindigul 2011, 2(1), 125-34.

Software has been developed specially for educational or learning purpose for mechanical, material or civil engineers. This software is about "stress and its graphical transformation" which is one of the leading important phenomena in the field of material or geotechnical engineering. The current work is based on this software which will show the stress components in graphics as well as its transformation. The software is developed by Borland C++ builder and the graphics is supported by Opengl. This software will find the maximum normal stresses (which are called principal stresses) with the direction cosines of principal planes that contain these principal stresses as well as maximum value of shear and Mohr Circle. It will also show the state of stresses while rotation is applied to the cube. Rotating the cube the user may find the state of stresses inside the cube both graphically and algebraically.

10 illus, 7 ref

018842   Priyanka;Bhatia K K;Goel N (ECE Dep, Kurukshetra Institute of Technology and Management, Kurukshetra) : Performance analysis of "FRENSA" for best, average and worst case scenarios in MANETs. Int J Adv Comput Inf Technol 2012, 1(1), 1-6.

Mobile ad hoc networks (MANETs) are a kind of network that has no centralized body and in order to communicate with the nodes it has no fixed topology. Also it is difficult to find the route from source to destination in MANETs, because of its arbitrary mobility of nodes. In FRENSA (Farthest Reliable Efficient Node Selection Algorithm) we have discussed that how we can select a node that can act as a gateway to the other regions and a path from source to destination that should be efficient and reliable too. In this paper we are going to show that how FRENSA works with the three different cases (i.e. Best, Average and Worst) for selecting a path and can check the reliability and efficiency of route and can also check the complexity of route in terms of hopes in distance. In all the cases we would take some parameters that have been used in FRENSA and analyze the performance of this algorithm in all the cases.

4 illus, 1 table, 14 ref

018841   Pawar R;Sharma N;Hooda R V;Pal K (CSE Dep, Doon Valley Institute of Engineering and Technology, Karnal) : Neural network in hand tracking and gesture recognition. Int J Adv Comput Inf Technol 2012, 1(1), 94-101.

Describes hand gesture recognition system to recognize real time gesture in different environments. Efforts should be made to adapt computers to our natural means of communication: Speech and body language. A simple and fast algorithm using orientation histograms will be developed. It will recognize a subset of MAL static hand gestures. A pattern recognition system will be using a transform that converts an image into a feature vector, which will be compared with the feature vectors of a training set of gestures. The final system will be Perceptional implementation in MATLAB.

^iia5 illus, 13 ref

018840   Parthiban R;Parthiban L (Chemical Engineering Dep, Sri Venkateswara College of Engineering, Sriperumbudur-602 105, Email: parthi@svcc.ac.in) : Back propagation neural network modeling approach in the anaerobic digestion of wastewater treatment. Int J envir Sci 2012, 2(4), 1944-51.

Use of back propagation neural network for modeling is investigated from the experimental values obtained in a laboratory scale system of anaerobic tapered fluidized bed reactor. The input parameters considered for modeling are four inputs, flow of influent, COD_in, pH_in, hydraulic retention time and two outputs viz., COD_out, CH₄ gas yield. Back propagation neural network has great adaptability to the variations of system configuration and operation condition and the prediction results are found to be closer to the experimental results.

9 illus, 13 ref

018839   Neeru;Chander Kant (CSE Dep, ICL College of Engieering and Technology, Ambala, Email: neeru_393@yahoo.com) : Hiearcheical approach of software testing to uncovered the test. Int J Adv Comput Inf Technol 2012, 1(1), 86-93.

During development of a software to achieve the higher quality software the policy, strategy, system requirements, feasibility studies, acceptance test plans, test plans, test designs, test cases, test results system designs, logical & physical design, software code, user manuals, procedures, training material, plans, visions, project progress, work completed schedule is inspected. All these activities are inspected and tested. During the SDLC these are categorised as how to perform them, they are actually performed or not, is checked in the testing section. It is not the testing phase which will check the system. Testing start at the earlier stage of SDLC from the information gathering. Software testing is categorized into different types. One of the main purposes of categorizing software testing is to identify faults in the software. Faults in software testing can be defined as conflict from requirement or user expectation. It is very easy to categorize faults. If system is not functioning properly, it is a functional defect. If system is not performing well, it is a performance defect. If system is not usable, it is a usability defect. If system is not secure, it is a security defect. To identify these different faults, different skill set, different techniques and different type of test cases are required. Testing is divided into different types to reflect, what kind of faults can be uncovered by those activities. This division also helps management in managing these activities effectively. There is a very rare to have someone with skills in all the types of testing and this division helps in getting proper resources for team. Author tried to categorized the software testing test so that they may help to identifying the fault to uncovered it by those activities.

^iia21 ref

018838   Mishra A;Sharma A K (Computer Engineering Dep, YMCA University of Science and Technology, Haryana, Email: mish.atul@gmail.com) : Mobile agent based distributed network management models. Int J Adv Comput Inf Technol 2012, 1(1), 17-25.

Modern day telecommunication industry is facing ever increasing demand for more sophisticated services, higher quality and shorter times to market. Network operators and service providers in the telecommunications industry must meet these demands at a commercially viable cost and should have plans in place for any unforeseen change. Current management models based on client/server suffer from scalability and flexibility problems. Furthermore, the staleness of gathered data (due to network latency involved) and probable error in the selection of management task being carried over (owing to the staleness of data) reduces the reliability of the management applications. A distributed paradigm is a viable solution to perform management functions when network start growing significantly. It offers decentralize processing and control thereby reducing the management traffic around the management station and distribute processing load. In this sense, use of mobile agents offer many possibilities for designing the next generation of distributed network management systems. Discusses various mobile agent based network management models and analyzes the key advantages of mobile agents in the distributed network management systems.

^iia7 illus, 14 ref

018837   Kadry S;Kalakech A (Faculty of Sciences, Lebanese University, Lebanon, Email: skadry@gmail.com) : First comprehensive design of XLINK. Int J appl Sci Engng Res 2012, 1(1), 78-91.

Authors present the limitations of HTML hyperlink and how could be solve it by using a new XML based language XLINK. Till now there is neither clear specification nor implementation of this language, a new comprehensive design using UML is proposed.

2 illus, 15 ref

018836   Jangra A;Verma B (Computer Science and Engineering Dep, UIET, Kurukshetra University, Kurukshetra, Haryana) : Web mining security. Int J Adv Comput Inf Technol 2012, 1(1), 46-52.

Mining information and knowledge from large databases/Web is always a key research area in database systems with an opportunity of major revenues. Several emerging applications in information providing services call various data mining techniques to easily interact with user, to improve the service provided but very few of them thought about the security when mining the Web for information. Web mining combines two hot fields data mining and www together. In response to such a demand, this paper provides a closer view on the Web mining security, Website security against attacks specially DoS attack. In this paper, we explore the research in Web mining, point to some Web mining components and their methodologies, discusses about its Web mining categories. Focuses on computers and Web security specially the key issues in security and the DoS attacks and propose a novel Web mining framework.

^iia4 illus, 12 ref

018835   Jadhav S;Nikam K;Gandhi A;Shinde N;Salunkhe K (NO, Amrutvahini College of Pharmacy, Amrutnagar, Sangamner-422 608, Email: shiva.007ind@gmail.com) : Applications of computer science in pharmacy. Natn J Physiol Pharm Pharmac 2012, 2(1), 1-2.

Computer is mandatory in this advanced era and pharmacy and related subjects are not exception to it. This review mainly focuses on the various applications, softwares and use of computers in pharmacy. Computer science and technology is deeply utilized in pharmacy field everywhere like in pharmacy colleges, pharmaceutical industries, research centers, hospital pharmacy and many more. Computer significantly reduces the time, expenditure, and manpower required for any kind of work. Development of various softwares makes it trouble-free to handle huge data. In short, computers are playing critical role in pharmacy field, without computers pharmacy research will be long-lasting and expensive.

2 illus, 1 table, 17 ref

018834   Himani;Kulwinder Singh (ECE Dep, BMS College of Engineering and Technology, Muktsar) : Peer to peer networks. Int J Adv Comput Inf Technol 2012, 1(1), 102-7.

Client server setup has servers, which are dedicated machines that perform specific functions in the network. A server can be used to manage a network's email, database, files, printers, or access an anti-virus. In a client server setup, each component has a designated function in the network. One server generally supports numerous clients, and multiple servers can be networked together in a pool to handle the increased processing load as the number of clients grows. A client computer and a server computer are usually two separate devices, each customized for their designed purpose. However, in some cases a given device can function both as a client and a server for the same application. With a client-server approach, the performance of the server will deteriorate as the number of clients requesting services from the server increase. There is a scalability problem.

^iia2 illus, 11 ref