YMCA University of Science and Technology

About: YMCA University of Science and Technology is a education organization based out in Faridabad, India. It is known for research contribution in the topics: Web page & Web crawler. The organization has 299 authors who have published 568 publications receiving 4547 citations.

A QIIIEP based domain specific hidden web crawler

Abstract: For context based surfing of World Wide Web in a systematic and automatic manner, a web crawler is required. The World Wide Web consists interlinked documents and resources that are easily crawled by general web crawler, known as surface web crawler. But for crawling the hidden web data, in which the data is hidden behind the html forms requires special type of crawler, known as hidden web crawler. For efficient crawling of hidden web data, the discovery of relevant and proper html forms is very important step. For this purpose a technique for domain specific hidden web crawler is proposed in this paper. The proposed technique is based on the domain specific crawling of World Wide Web. In this approach, a link is followed in a step by step manner, which results in a large source of hidden web databases. Experiential results verify that the proposed approach is quite effective in crawling the hidden web data contents.

Search for Prioritized Test Cases in Multi-Objective Environment During Web Application Testing

Abstract: Regression testing is an expensive procedure that is implemented during maintenance phase of the Software Development Life Cycle of evolving software. During this process, test case prioritization is one of the strategies followed in which test cases are organized in a fashion so as to enhance efficiency in achieving some performance goal. During the process, there could be several aspects to be kept in mind due to resources constraints such as fault severity detected per unit of test cost, severity detection per test case execution, and execution time of test cases to detect all the faults. Keeping all such constraints in mind, the test case prioritization problem becomes a multi-objective problem where some of the objectives have to be maximized and the remaining ones minimized. In this study, experiments were performed on different versions of five web applications. The problem instance was found to vary from 5 $$\times $$ 5 test cases versus fault matrix, to 125 $$\times $$ 125 matrix. Random approach, 2-opt algorithm, improved 2-opt algorithm, greedy approach, additional greedy approach, Weighted Genetic Algorithm and Non-dominated Sorting Genetic Algorithm-II (NSGA-II) were applied to a generate prioritized test sequence which maximizes the Cost Cognizant Average Percentage of Fault Detection value, severity detection and minimizes test case execution cost to expose all the faults. The performances of these algorithms are compared, keeping these parameters in mind, and it is concluded that the performance of NSGA-II algorithm is better than that of all the other tested algorithms throughout all the experiments.

Geo-Social Semantic Profile Matching Algorithm for Dynamic Interests in Ad-hoc Social Network

Abstract: Ad-hoc Social Network (ASN) allows users to create social network connections using wireless ad hoc network. Various techniques have been proposed to create ASN by matching profiles of users. In order to create meaningful ASN, there is a need to dynamically set and match user profile based on changing user's interests. This paper provides an algorithm to semantically match users profiles based on geographic location and dynamic interests.

OE-LEACH: An optimized energy efficient LEACH algorithm for WSNs

Abstract: Wireless Sensor Networks (WSNs) are designed by hundreds or thousands of tiny, low cost and multifunctional sensor nodes. Each sensor node has very low battery life. Sensor nodes have finite storage capabilities, transmission and processing range and energy resources are also limited. There are many design issues in WSNs such as mobility, energy consumption, network topology, data aggregation, localization, production cost, security, network size and density etc. Routing protocols provide efficient working of the network, increase network lifetime, responsible for maintaining the routes in the network and perform reliable multi-hop communication under various conditions. LEACH (Low Energy Adaptive Clustering Protocol) is one of the hierarchical protocol in WSNs. LEACH uses TDMA MAC Protocol. During random data distribution, a number of TDMA slots are wasted. Because sensor nodes don't know either they have data to send or not, they continuously listen to the medium and this result in idle listening problem. This paper proposed OE-LEACH (An Optimized Energy Efficient LEACH Algorithm for WSNs) to enhance the performance of the LEACH Protocol, reduce time delay and energy consumption. Network Lifetime and throughput of WSN also increases. The Proposed method is simulated in MATLAB 2010a.

OWL-based ontology indexing and retrieving algorithms for Semantic Search Engine

Abstract: Various researchers have recognized that ontology based retrieval is one of the best in terms of precision and recall for semantic search engine. However, they did not specify explicitly any scheme/ algorithm for ontology based indexing and retrieval. This motivates us to conceive a proposal that includes (a) suggesting indexing algorithm to effectively maintain ontologies, (b) suggesting retrieving algorithm to process user query and produce results with better precision and recall. The proposed indexing algorithm has been tested manually considering a sample of ten OWL ontologies of mammal domain but presented only a result of two ontologies due to space constraint. Finally, the proposed retrieval algorithms have also been validated against three user queries.