Institution
YMCA University of Science and Technology
Education•Faridabad, India•
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.
Topics: Web page, Web crawler, Ontology (information science), Flexible manufacturing system, Routing protocol
Papers
More filters
••
01 Jul 2016TL;DR: In this paper, a subwavelength patch antenna using epsilon negative metamaterial was designed at resonant frequency of reference rectangular patch antenna at 5.2 GHz and applied underneath the reference patch antenna.
Abstract: This paper presents design of a subwavelength patch antenna using epsilon negative metamaterial. Firstly, the metamaterial is designed at resonant frequency of reference rectangular patch antenna at 5.2 GHz and then this designed metamaterial is applied underneath the reference patch antenna. Addition of ENG metamaterial underneath the patch antenna decreases its resonant frequency. Simulation results shows that as the number ENG metamaterial layer underneath the patch increases the resonant frequency of reference antenna shift gradually to the lower side.
2 citations
••
28 Feb 2015TL;DR: The result shows that a node having spectrum sensing capability outperforms the other one in the shortest path routing strategy implemented in MATLAB-7.01.
Abstract: To have an efficient and successful communication in ad hoc networks, the use of Cognitive Radios (CR) has gained popularity in the recent past. These radios have spectrum sensing capabilities and thus can easily switch to free spectrum band. The use of such type of radios not only improves the routing performance but at the same time improves the overall throughput of the network. To show the same, we implement shortest path routing strategy in MATLAB-7.01. The routing scheme uses two types of radios one with spectrum sensing capability such as cognitive radios and the other which doesn’t. The following performance metrics such as Packet Delivery Ratio (PDR), Delay, Success Ratio and Hop count are taken into consideration for measuring the efficiency. The result shows that a node having spectrum sensing capability outperforms the other one.
2 citations
•
TL;DR: Using genetic algorithm based approach the location of FACTS devices, their type and rated values are optimized simultaneously taking Branch loading, Voltage Stability and loss minimization as the three objectives leading to system stability.
Abstract: This paper presents a genetic algorithm based approach to find out the optimal location of FACTS devices in a Multi-Machine power system. Using this approach the location of FACTS devices, their type and rated values are optimized simultaneously taking Branch loading, Voltage Stability and loss minimization as the three objectives leading to system stability. Two FACTS devices TCSC and SVC are simulated in this study and a mat lab coding has been developed for the purpose of simulation. To check the validity of proposed algorithm, it is applied on IEEE 30 bus system for different operating conditions and the results confirm the effectiveness of proposed algorithm.
2 citations
•
16 Mar 2016TL;DR: This research paper will present a consistent concurrency algorithm which presents a solution to consistency problem of distributed databases.
Abstract: Distributed database is not a new term in the current world. A distributed database is a set of several databases that are correlated to each other in a logical fashion over the network. Data is distributed as well as replicated at various locations in order to increase the availability. During recent years, data distribution has been evaluated as an important issue for databases. Since the data is distributed, it becomes necessary that all the copies be synchronized at the time of any data update, thus leaving all the copies with consistent data. This research paper will present a consistent concurrency algorithm which presents a solution to consistency problem of distributed databases.
2 citations
•
26 Jan 2018TL;DR: To rank a context sensitive web page, a ranking factor is developed which uses the underlying ontology of the particular domain in which it lies and the value of this factor is computed by calculating the number of data properties present in the web page.
Abstract: Today’s web is human readable where information cannot be easily processed by machines. The current existing Keyword-Based Search Engines provides an efficient way to browse the web content. But they do not consider the context of the user query or the web page and return a large result set, out of which very few are relevant to the user. Therefore, users are often confronted with the daunting task of shifting through multiple pages, to find the exact match. In addition, the Ranking factors employed by these search engines do not take into account the context or the domain of the web page. In this paper, to rank a context sensitive web page, a ranking factor is developed which uses the underlying ontology of the particular domain in which it lies. The value of this factor is computed by calculating the number of data properties present in the web page.
2 citations
Authors
Showing all 322 results
Name | H-index | Papers | Citations |
---|---|---|---|
Bharat Bhushan | 116 | 1276 | 62506 |
Vikas Kumar | 89 | 859 | 39185 |
Dinesh Kumar | 69 | 1333 | 24342 |
M K Arti | 21 | 49 | 1179 |
Tilak Raj | 20 | 68 | 1541 |
Parmod Kumar | 19 | 48 | 895 |
O.P. Mishra | 18 | 46 | 1242 |
Neeraj Sharma | 18 | 96 | 1063 |
Sandeep Grover | 18 | 82 | 1251 |
Gurpreet Singh | 17 | 107 | 1158 |
Vinod Chhokar | 15 | 55 | 526 |
Rahul Sindhwani | 14 | 41 | 498 |
Vineet Jain | 14 | 34 | 495 |
Arvind Kumar | 14 | 118 | 934 |
Rajesh Attri | 13 | 41 | 665 |