In 1900, less than 20 percent of the world populace lived in cities, in 2007, fair more than 50 percent of the world populace lived in cities. In 2050, it has been anticipated that more than 70 percent of the worldwide population (about 6.4 billion individuals) will be city tenants. There's more weight being set on cities through this increment in population [1]. With approach of keen cities, data and communication technology is progressively transforming the way city regions and city inhabitants organize and work in reaction to urban development. In this paper, we create a nonspecific plot for navigating a route throughout city A asked route is given by utilizing combination of A* Algorithm and Haversine equation. Haversine Equation gives least distance between any two focuses on spherical body by utilizing latitude and longitude. This least distance is at that point given to A* calculation to calculate minimum distance. The method for identifying the shortest path is specify in this paper.
TEXT EXTRACTION FROM RASTER MAPS USING COLOR SPACE QUANTIZATIONcsandit
Maps convey valuable information by relating names to their positions. In this paper we present
a new method for text extraction from raster maps using color space quantization. Previously,
most researches in this field were focused on Latin texts and the results for Persian or Arabic
texts were poor. In our proposed method we use a Mean-Shift algorithm with proper parameter
adjustment and consequently, we apply color transformation to make the maps ready for KMeans
algorithm which quantizes the colors in maps to six levels. By comparing to a threshold
the text layer candidates are then limited to three. The best layer can afterwards be chosen by
user. This method is independent of font size, direction and the color of the text and can find
both Latin and Persian/Arabic texts in maps. Experimental results show a significant
improvement in Persian text extraction.
TEXT EXTRACTION FROM RASTER MAPS USING COLOR SPACE QUANTIZATIONcsandit
Maps convey valuable information by relating names to their positions. In this paper we present
a new method for text extraction from raster maps using color space quantization. Previously,
most researches in this field were focused on Latin texts and the results for Persian or Arabic
texts were poor. In our proposed method we use a Mean-Shift algorithm with proper parameter
adjustment and consequently, we apply color transformation to make the maps ready for KMeans
algorithm which quantizes the colors in maps to six levels. By comparing to a threshold
the text layer candidates are then limited to three. The best layer can afterwards be chosen by
user. This method is independent of font size, direction and the color of the text and can find
both Latin and Persian/Arabic texts in maps. Experimental results show a significant
improvement in Persian text extraction.
An index based road feature extraction from LANDSAT-8 OLI imagesIJECEIAES
Road feature extraction from the remote sensing images is an arduous task and has a significant role in various applications of urban planning, updating the maps, traffic management, etc. In this paper, a new band combination (B652) to form a road index (RI) from OLI multispectral bands based on the spectral reflectance of asphalt, is presented for road feature extraction. The B652 is converted to road index by normalization. The morphological operators (Top-hat or Bottom-hat) uses on RI to enhance the roads. To sharpen the edges and for better discrimination of features, shock square filter (SSF), is proposed. Then, an iterative adaptive threshold (IAT) based online search with variational min-max and markov random fields (MRF) model are used on the SSF image to segment the roads and non-roads. The roads are extracting by using the rules based on the connected component analysis. IAT and MRF model segmentation methods prove the proposed index (RI) able to extract road features productively. The proposed methodology is a combination of saturation based adaptive thresholding and morphology (SATM), and saturation based MRF (SMRF), applied to OLI images of several urban cities of India, producing the satisfactory results. The experimental results with the quantitative analysis presented in the paper.
Classified 3d Model Retrieval Based on Cascaded Fusion of Local Descriptors ijcga
One of the core tasks in order to perform fast and accurate retrieval results in a content-based search and retrieval 3D system is to determine an efficient and effective method for matching similarities between the 3D models. In this paper the “cascaded fusion of local descriptors” is proposed for efficient retrieval of classified 3D models, based on a 2D coloured logo retrieval methodological approach, suitably modified for the purpose of 3D search and retrieval tasks that are widely used in the augmented reality (AR) and virtual reality (VR) fields. Initially, features from Key points are extracted using different state of the art local descriptor algorithms and then they are joined to constitute the feature tuple for the respective key point. Additionally, a feature vocabulary for each descriptor is created that maps those tuples to the respective vocabularies using distance functions that applied among the newly created tuples of each Point Cloud. Subsequently, an inverted index table is formed that maps the 3D models to each tuple respectively. Therefore, for every query 3D model only the corresponding 3D models are retrieved as these were previously mapped in the inverted index table. Finally, from the retrieved list by comparing the local features frequency of appearance to the first vocabulary, the final re ranked list of the most similar 3D models is produced.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Performance Evaluation of GPSR Routing Protocol for VANETs using Bi-direction...CSCJournals
Routing in Vehicular Adhoc Networks is a challenging task where the nodes themselves are vehicles. The mobility factors such as beacon intervals and vehicles with different velocities may cause inaccuracy in the identification of the vehicle's position. This in turn affects the performance of the position based routing protocols. Further, there is a need to evaluate through simulations performance of the position based routing protocol, especially in urban realistic scenarios for VANETs. The work in this paper evaluates the performance of Greedy Perimeter Stateless Routing protocol (GPSR) for VANETs which is a popular position based protocol especially for routing in MANETs. In order to evaluate realistic simulation environment bi-directional coupling of OMNET++/ INET Framework and SUMO is chosen for Nagarbhavi region in Bengaluru, India. The simulations are done for various scenarios realizing the impact of mobility parameters on routing using GPSR, and performance is measured in terms of packet delivery ratio and throughput.
A Model and Algorithm of Dynamic Map Expression and its ApplicationTELKOMNIKA JOURNAL
On the basis of summarizing the research results of visual variables, we define six
dynamic visual variables of the map symbol in this paper. We analyze the related attributes of
dynamic symbols, and then construct a dynamic map expression model based on symbols. A
key technology to realize dynamic expression, the key frame transform algorithm is present in
the paper. The cartography process of the urban population proportion dynamic change map of
the cities in Shandong province are taken as an example to demonstrate the methods and
process of dynamic mapping based on the above map dynamic expression theories and
models, which includes base map digitization, sorting and processing of attribute data, adding
the map elements, the creation of special dynamic effect such as color transform, continuous
flashing and object moving, and realization of interactive function. Finally, the paper shows the
dynamic map of sea level rising influence on Qingdao, the Typhoon Soulik traveling map and
other dynamic map effect at the end of the article.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Determination of the optimum route is often encountered in daily life. The purpose of the optimum route itself is to find the best trajectory of the two pairs of vertices contained in a map or graph. The search algorithm applied is A*. This algorithm has the evaluation function to assist the search. The function is called heuristic. Two methods which have been introduced as a step to obtain the value of heuristic function are by using Euclidean and Manhattan distance. Both of these methods create the optimum distance in shortest path problem, but these functions gain the different results. This research performs the development of the heuristic function using Euclidean, Manhattan, Euclidean Square and a new method to compare the results.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A survey on optimal route queries for road networkseSAT Journals
Abstract
In daily life the need to find optimal routes between two points is critical, for example finding the shortest distance to the nearest
hospital. Internet based maps are now widely used for this purpose. Route search and optimal route queries are two important classes
of queries based on road network concept. Route search queries find the route according to the given constraints. The optimal route
queries find the optimum route from a set of specifications by a user. In road map queries, users have to give the specification of
starting point and ending point of their travelling with or without constraints. Some spatial features about the categories and the
different locations should be specified along with this. If the travelling constraints are given then it should be unique. These
constraints may be either total order or partial order. In this specification order there should be information about both starting point
and destination point of the travelling. The optimal route queries optimize the possible routes and give the optimal route that satisfies
all the constraints. This paper describes the survey on optimal route query processing, two categories namely optimal route query
processing and spatial search with categorical information have been considered, a discussion on technique for optimal route query
with constraints and without constraint is also included. The total order needs a specification of list of points and in the same order
that they should be visited but that is not required for partial order constraints. Finally this paper concludes with pros and cons of
different techniques under optimal route queries.
Keywords: Query processing, optimal route queries, Spatial search, Categorical information, Constraints.
This paper proposes development of an android app to improve the transportation services for
bus rental companies that lift Taibah University students. It intends to reduce the waiting time
for bus students, thereby to stimulate sharing of updated information between the bus drivers
and students. The application can run only on android devices. It would inform the students
about the exact time of arrival and departure of buses on route. This proposed app would
specifically be used by students and drivers of Taibah University. Any change in the scheduled
movement of the buses would be updated in the software. Regular alerts would be sent in case of
delays or cancelation of buses. Bus locations and routes are shown on dynamic maps using
Google maps. The application is designed and tested where the users assured that the
application gives the real time service and it is very helpful for them.
This paper proposes development of an android app to improve the transportation services for
bus rental companies that lift Taibah University students. It intends to reduce the waiting time
for bus students, thereby to stimulate sharing of updated information between the bus drivers
and students. The application can run only on android devices. It would inform the students
about the exact time of arrival and departure of buses on route. This proposed app would
specifically be used by students and drivers of Taibah University. Any change in the scheduled
movement of the buses would be updated in the software. Regular alerts would be sent in case of
delays or cancelation of buses. Bus locations and routes are shown on dynamic maps using
Google maps. The application is designed and tested where the users assured that the
application gives the real time service and it is very helpful for them.
Abstract— Itinerary planning is the important process for the travelling agencies which need to be done carefully to satisfy the requirements of the users. The satisfaction level of users can be increased by creating the itinerary planning in the customized manner by gathering the details from the users itself. There will be more burden of processing the large search space will occur where the number of POI present will be large. The time complexity and cost of processing those requests will be increased due to the large search space. And also it will be more difficult when there is a need of creating an similar type of itinerary plan to the multiple users. To overcome this problem in this work multi-user itinerary plan generation was proposed which intends to generate the multi-user customized itinerary plan by using the fuzzy-c-means clustering algorithm. In this approach, membership values are defined for clustering process. Based on the membership values of users we are clustering the users. From the experimentation result, the proposed system is used to reduce the search complexity as well as time complexity of the system.
An index based road feature extraction from LANDSAT-8 OLI imagesIJECEIAES
Road feature extraction from the remote sensing images is an arduous task and has a significant role in various applications of urban planning, updating the maps, traffic management, etc. In this paper, a new band combination (B652) to form a road index (RI) from OLI multispectral bands based on the spectral reflectance of asphalt, is presented for road feature extraction. The B652 is converted to road index by normalization. The morphological operators (Top-hat or Bottom-hat) uses on RI to enhance the roads. To sharpen the edges and for better discrimination of features, shock square filter (SSF), is proposed. Then, an iterative adaptive threshold (IAT) based online search with variational min-max and markov random fields (MRF) model are used on the SSF image to segment the roads and non-roads. The roads are extracting by using the rules based on the connected component analysis. IAT and MRF model segmentation methods prove the proposed index (RI) able to extract road features productively. The proposed methodology is a combination of saturation based adaptive thresholding and morphology (SATM), and saturation based MRF (SMRF), applied to OLI images of several urban cities of India, producing the satisfactory results. The experimental results with the quantitative analysis presented in the paper.
Classified 3d Model Retrieval Based on Cascaded Fusion of Local Descriptors ijcga
One of the core tasks in order to perform fast and accurate retrieval results in a content-based search and retrieval 3D system is to determine an efficient and effective method for matching similarities between the 3D models. In this paper the “cascaded fusion of local descriptors” is proposed for efficient retrieval of classified 3D models, based on a 2D coloured logo retrieval methodological approach, suitably modified for the purpose of 3D search and retrieval tasks that are widely used in the augmented reality (AR) and virtual reality (VR) fields. Initially, features from Key points are extracted using different state of the art local descriptor algorithms and then they are joined to constitute the feature tuple for the respective key point. Additionally, a feature vocabulary for each descriptor is created that maps those tuples to the respective vocabularies using distance functions that applied among the newly created tuples of each Point Cloud. Subsequently, an inverted index table is formed that maps the 3D models to each tuple respectively. Therefore, for every query 3D model only the corresponding 3D models are retrieved as these were previously mapped in the inverted index table. Finally, from the retrieved list by comparing the local features frequency of appearance to the first vocabulary, the final re ranked list of the most similar 3D models is produced.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Performance Evaluation of GPSR Routing Protocol for VANETs using Bi-direction...CSCJournals
Routing in Vehicular Adhoc Networks is a challenging task where the nodes themselves are vehicles. The mobility factors such as beacon intervals and vehicles with different velocities may cause inaccuracy in the identification of the vehicle's position. This in turn affects the performance of the position based routing protocols. Further, there is a need to evaluate through simulations performance of the position based routing protocol, especially in urban realistic scenarios for VANETs. The work in this paper evaluates the performance of Greedy Perimeter Stateless Routing protocol (GPSR) for VANETs which is a popular position based protocol especially for routing in MANETs. In order to evaluate realistic simulation environment bi-directional coupling of OMNET++/ INET Framework and SUMO is chosen for Nagarbhavi region in Bengaluru, India. The simulations are done for various scenarios realizing the impact of mobility parameters on routing using GPSR, and performance is measured in terms of packet delivery ratio and throughput.
A Model and Algorithm of Dynamic Map Expression and its ApplicationTELKOMNIKA JOURNAL
On the basis of summarizing the research results of visual variables, we define six
dynamic visual variables of the map symbol in this paper. We analyze the related attributes of
dynamic symbols, and then construct a dynamic map expression model based on symbols. A
key technology to realize dynamic expression, the key frame transform algorithm is present in
the paper. The cartography process of the urban population proportion dynamic change map of
the cities in Shandong province are taken as an example to demonstrate the methods and
process of dynamic mapping based on the above map dynamic expression theories and
models, which includes base map digitization, sorting and processing of attribute data, adding
the map elements, the creation of special dynamic effect such as color transform, continuous
flashing and object moving, and realization of interactive function. Finally, the paper shows the
dynamic map of sea level rising influence on Qingdao, the Typhoon Soulik traveling map and
other dynamic map effect at the end of the article.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Determination of the optimum route is often encountered in daily life. The purpose of the optimum route itself is to find the best trajectory of the two pairs of vertices contained in a map or graph. The search algorithm applied is A*. This algorithm has the evaluation function to assist the search. The function is called heuristic. Two methods which have been introduced as a step to obtain the value of heuristic function are by using Euclidean and Manhattan distance. Both of these methods create the optimum distance in shortest path problem, but these functions gain the different results. This research performs the development of the heuristic function using Euclidean, Manhattan, Euclidean Square and a new method to compare the results.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A survey on optimal route queries for road networkseSAT Journals
Abstract
In daily life the need to find optimal routes between two points is critical, for example finding the shortest distance to the nearest
hospital. Internet based maps are now widely used for this purpose. Route search and optimal route queries are two important classes
of queries based on road network concept. Route search queries find the route according to the given constraints. The optimal route
queries find the optimum route from a set of specifications by a user. In road map queries, users have to give the specification of
starting point and ending point of their travelling with or without constraints. Some spatial features about the categories and the
different locations should be specified along with this. If the travelling constraints are given then it should be unique. These
constraints may be either total order or partial order. In this specification order there should be information about both starting point
and destination point of the travelling. The optimal route queries optimize the possible routes and give the optimal route that satisfies
all the constraints. This paper describes the survey on optimal route query processing, two categories namely optimal route query
processing and spatial search with categorical information have been considered, a discussion on technique for optimal route query
with constraints and without constraint is also included. The total order needs a specification of list of points and in the same order
that they should be visited but that is not required for partial order constraints. Finally this paper concludes with pros and cons of
different techniques under optimal route queries.
Keywords: Query processing, optimal route queries, Spatial search, Categorical information, Constraints.
This paper proposes development of an android app to improve the transportation services for
bus rental companies that lift Taibah University students. It intends to reduce the waiting time
for bus students, thereby to stimulate sharing of updated information between the bus drivers
and students. The application can run only on android devices. It would inform the students
about the exact time of arrival and departure of buses on route. This proposed app would
specifically be used by students and drivers of Taibah University. Any change in the scheduled
movement of the buses would be updated in the software. Regular alerts would be sent in case of
delays or cancelation of buses. Bus locations and routes are shown on dynamic maps using
Google maps. The application is designed and tested where the users assured that the
application gives the real time service and it is very helpful for them.
This paper proposes development of an android app to improve the transportation services for
bus rental companies that lift Taibah University students. It intends to reduce the waiting time
for bus students, thereby to stimulate sharing of updated information between the bus drivers
and students. The application can run only on android devices. It would inform the students
about the exact time of arrival and departure of buses on route. This proposed app would
specifically be used by students and drivers of Taibah University. Any change in the scheduled
movement of the buses would be updated in the software. Regular alerts would be sent in case of
delays or cancelation of buses. Bus locations and routes are shown on dynamic maps using
Google maps. The application is designed and tested where the users assured that the
application gives the real time service and it is very helpful for them.
Abstract— Itinerary planning is the important process for the travelling agencies which need to be done carefully to satisfy the requirements of the users. The satisfaction level of users can be increased by creating the itinerary planning in the customized manner by gathering the details from the users itself. There will be more burden of processing the large search space will occur where the number of POI present will be large. The time complexity and cost of processing those requests will be increased due to the large search space. And also it will be more difficult when there is a need of creating an similar type of itinerary plan to the multiple users. To overcome this problem in this work multi-user itinerary plan generation was proposed which intends to generate the multi-user customized itinerary plan by using the fuzzy-c-means clustering algorithm. In this approach, membership values are defined for clustering process. Based on the membership values of users we are clustering the users. From the experimentation result, the proposed system is used to reduce the search complexity as well as time complexity of the system.
AbstractWe design an software to find optimal(shortest) path .docxaryan532920
Abstract
We design an software to find optimal(shortest) path on the University of Minnesota map by using the A* algorithm. Using GUI (Graphical User Interface) to visualize the path on the map and print the list, which contains the transient nodes. It is definitely efficient way for students to make route planning in the campus. The approach supports that query the shortest path and manage the time in the campus.
Maps are kind of diagrammatic form that represents physical features such as buildings and roads, and maps play an essential role in the development of civilization. Most of people are familiar with using maps to find routes and locate their position on the maps. However, it is very challenge to find a shortest path in the real world. Therefore, using computers and algorithms are efficient ways to solve route planning problems. Using graph theories to take the place of real buildings and available roads with nodes and edges, then a transportation network has been established by connecting them. Meanwhile, computer software can generate a shortest path in such transportation network. The path shows the optimal solution in the corresponding transportation network, what is more, the tool we designed should be tested against real world, complex situation in order to detect any bugs existing in it.
Map is a graphic way to represent spatial concepts. A type which people most familiar with is transportation map. Map is a medium of interaction between human and environment. That is because vision of human cannot satisfied human when they make plan according to environment. An accurate map could help human to learn where they are, and make correct decision. For the record, Napoleon Bonaparte did that we owe the first systematic use of maps in the conduct of war. \cite{p2}Accurate information on map helped French Emperor to coordinate geographically expansive campaigns and discrete armies in the field. They indicate positions of enemy armies and do prediction by labelling on map. By calculating distance and highlighted important topographical features on map, predication could be much more accurate. As “a means of visualizing and managing the future,” the Napoleonic map was “the central part of an information-transformation system”\cite{p3}
Technology helped map develop more quickly. Map helps human learn a more accurate world, and also makes life of human more convenient. For example, when students join a new university, or they want to know about campus, students could use visual map software installed in smartphones to get rough idea about it. Map cannot show all detail about each building in campus but it could provide students the most accurate shapes of buildings in vertical view, distance between them and relations of positions. All these information could help students to learn their campus better. However, it is difficult for some of students to find a route between two location in a complicated campus which is with a big ar.
User Category Based Estimation of Location Popularity using the Road GPS Traj...Waqas Tariq
The mining of the user GPS trajectories and identifying the interesting places have been well studied based on the visitor’s frequency. However, every user is given the same importance in the majority of the trajectory mining methods. In reality, the popularity of the place also depends on the category of the visitor i.e. international vs local visitors etc. We are proposing user category based location popularity estimation using the trajectories databases. It includes mainly three steps. First , pre-processing – the error correction and the graph connection establishment in the road network in order to be able to carry the graph based computations. Second , find the stay regions where the travelers spent some time off-the-road. The visitors can be easily categorized for each POI based on the travel distance from the home location. Finally , normalization and popularity estimation – measure the frequency and stay time of the visitors of each category in the places in question. The weighted sum of the frequency and stay time for each category of the visitors is calculated. The final popularity of the places is computed with values of the pre-configured range. We have implemented and evaluated the proposed method using a large real road GPS trajectory of 182 users that was collected in a period of over three years by Microsoft Asia Research group.
This paper proposes development of an android app to improve the transportation services for bus rental
companies that lift Taibah University students. It intends to reduce the waiting time for bus students,
thereby to stimulate sharing of updated information between the bus drivers and students. The application
can run only on android devices. It would inform the students about the exact time of arrival and departure
of buses on route. This proposed app would specifically be used by students and drivers of Taibah
University. Any change in the scheduled movement of the buses would be updated in the software. Regular
alerts would be sent in case of delays or cancelation of buses. Bus locations and routes are shown on
dynamic maps using Google maps. The application is designed and tested where the users assured that the
application gives the real time service and it is very helpful for them.
This paper proposes development of an android app to improve the transportation services for bus rental companies that lift Taibah University students. It intends to reduce the waiting time for bus students, thereby to stimulate sharing of updated information between the bus drivers and students. The application can run only on android devices. It would inform the students about the exact time of arrival and departure of buses on route. This proposed app would specifically be used by students and drivers of Taibah University. Any change in the scheduled movement of the buses would be updated in the software. Regular alerts would be sent in case of delays or cancelation of buses. Bus locations and routes are shown on dynamic maps using Google maps. The application is designed and tested where the users assured that the application gives the real time service and it is very helpful for them.
UNIVERSITY BUSES ROUTING AND TRACKING SYSTEMijcseit
This paper proposes development of an android app to improve the transportation services for bus rental
companies that lift Taibah University students. It intends to reduce the waiting time for bus students,
thereby to stimulate sharing of updated information between the bus drivers and students. The application
can run only on android devices. It would inform the students about the exact time of arrival and departure
of buses on route. This proposed app would specifically be used by students and drivers of Taibah
University. Any change in the scheduled movement of the buses would be updated in the software. Regular
alerts would be sent in case of delays or cancelation of buses. Bus locations and routes are shown on
dynamic maps using Google maps. The application is designed and tested where the users assured that the
application gives the real time service and it is very helpful for them.
Estimation of Road Roughness Condition and Ghat Complexity Analysis Using Sma...rahulmonikasharma
Our system works on producing the result sets which shows the road conditions and ghat complexity during traveling. We all use the map but it does not show potholes and bumps in the road. Our system analyzes the data through the sensors of mobile phone such as sensors like accelerometer, orientation sensor, and magnetometer to analyze the ghat complexity and roads quality we use the GPS system of an android phone.
Estimation of Road Roughness Condition and Ghat Complexity Analysis Using Sma...rahulmonikasharma
Our system works on producing the result sets which shows the road conditions and ghat complexity during traveling. We all use the map but it does not show potholes and bumps in the road. Our system analyzes the data through the sensors of mobile phone such as sensors like accelerometer, orientation sensor, and magnetometer to analyze the ghat complexity and roads quality we use the GPS system of an android phone.
Transportation involves the movement of people and the shipment of goods from one location to another.
A geospatial model of a transportation network is comprised of linear features and the points of intersection between them.
Similar to A Landmark Based Shortest Path Detection by Using A* and Haversine Formula (20)
Data Mining is a significant field in today’s data-driven world. Understanding and implementing its concepts can lead to discovery of useful insights. This paper discusses the main concepts of data mining, focusing on two main concepts namely Association Rule Mining and Time Series Analysis
A Review on Real Time Integrated CCTV System Using Face Detection for Vehicle...rahulmonikasharma
We are describes the technique for real time human face detection and counting the number of passengers in vehicle and also gender of the passengers.The Image processing technology is very popular,now at present all are going to use it for various purpose. It can be applied to various applications for detecting and processing the digital images. Face detection is a part of image processing. It is used for finding the face of human in a given area. Face detection is used in many applications such as face recognition, people tracking, or photography. In this paper,The webcam is installed in public vehicle and connected with Raspberry Pi model. We use face detection technique for detecting and counting the number of passengers in public vehicle via webcam with the help of image processing and Raspberry Pi.
Considering Two Sides of One Review Using Stanford NLP Frameworkrahulmonikasharma
Sentiment analysis is a type of natural language processing for tracking the mood of the public about a particular product or a topic and is useful in several ways. Polarity shift is the most classical task which aims at classifying the reviews either positive or negative. But in many cases, in addition to the positive and negative reviews, there still many neutral reviews exist. However, the performance sometimes limited due to the fundamental deficiencies in handling the polarity shift problem. We propose an Improvised Dual Sentiment Analysis (IDSA) model to address this problem for sentiment classification. We first propose a novel data expansion technique by creating sentiment-reversed review for each training and test review. We develop a corpus based method to construct a pseudo-antonym dictionary. It removes DSA’s dependency on an external antonym dictionary for review reversion. We conduct a range of experiments and the results demonstrates the effectiveness of DSA in addressing the polarity shift in sentiment classification. .
A New Detection and Decoding Technique for (2×N_r ) MIMO Communication Systemsrahulmonikasharma
The requirements of fifth generation new radio (5G- NR) access networks are very high capacity and ultra-reliability. In this paper, we proposed a V-BLAST2 × N_r MIMO system that is analyzed, improved, and expected to achieve both very high throughput and ultra- reliability simultaneously.A new detection technique called parallel detection algorithm is proposed. The performance of the proposed algorithm compared with existing linear detection algorithms. It was seen that the proposed technique increases the speed of signal transmission and prevents error propagation which may be present in serial decoding techniques. The new algorithm reduces the bit error probability and increases the capacity simultaneouslywithout using a standard STC technique. However, it was seen that the BER of systems using the proposed algorithm is slightly higher than a similar system using only STC technique. Simulation results show the advantages of using the proposed technique.
Broadcasting Scenario under Different Protocols in MANET: A Surveyrahulmonikasharma
A wireless network enables people to communicate and access applications and information without wires. This provides freedom of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid the loss of data. In this paper an overview of different broadcast protocols are discussed.
Sybil Attack Analysis and Detection Techniques in MANETrahulmonikasharma
Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node Illegitimately claims multiple identities.Mobility cause a main problem when we talk about security in Mobile Ad-hoc networks. It doesn’t depend on fixed architecture, the nodes are continuously moving in a random fashion. In this article we will focus on identifying the Sybil attack in MANET. It uses air medium for communication so it is more prone to the attack. Sybil attack is one in which single node present multiple fake identities to other nodes, which cause destruction.
Processing Over Encrypted Query Data In Internet of Things (IoTs) : CryptDBs,...rahulmonikasharma
Internet of Things (IoT) is the developing technologies that would be the biggest agents to modify the current world. Machine-to-machine communications perform with virtual, mobile and instantaneous connections. In IoT system, it consists of data-gathering sensors various other household devices. Intended for protecting IoT system, the end-to-end secure communication is a necessary measure to protect against unauthorized entities (e.g., modification attacks and eavesdropping,) and the data unprotected on the Cloud. The most important concern hereby is how to preserve the insightful information and to provide the privacy of user data. In IoT, the encrypted data computing is based on techniques appear to be promising approaches. In this paper, we discuss about the recent secure database systems, which are capable to execute SQL queries over encrypted data.
Quality Determination and Grading of Tomatoes using Raspberry Pirahulmonikasharma
In India cultivation of tomatoes is carried out by traditional methods and techniques. Today tremendous improvement in field of agriculture technologies and products can be seen. The tomatoes affect the overall production drastically. Image processing technique can be key technique for finding good qualities of tomatoes and grading. This work aimed to study different types of algorithms used for quality grading and sorting of fruit from the acquire image. In previous years several types of techniques are applied to analyses the good quality fruits. A simple system can be implemented using Raspberry pi with computer vision technology and image processing algorithms.
Comparative of Delay Tolerant Network Routings and Scheduling using Max-Weigh...rahulmonikasharma
Network management and Routing is supportively done by performing with the nodes, due to infrastructure-less nature of the network in Ad hoc networks or MANET. The nodes are maintained itself from the functioning of the network, for that reason the MANET security challenges several defects. Routing process and Scheduling is a significant idea to enhance the security in MANET. Other than, scheduling has been recognized to be a key issue for implementing throughput/capacity optimization in Ad hoc networks. Designed underneath conventional (LT) light tailed assumptions, traffic fundamentally faces Heavy-tailed (HT) assumption of the validity of scheduling algorithms. Scheduling policies are utilized for communication networks such as Max-Weight, backpressure and ACO, which are provably throughput optimality and the Pareto frontier of the feasible throughput region under maximal throughput vector. In wireless ad-hoc network, the issue of routing and optimal scheduling performs with time varying channel reliability and multiple traffic streams. Depending upon the security issues within MANETs in this paper presents a comparative analysis of existing scheduling policies based on their performance to progress the delay performance in most scenarios. The security issues of MANETs considered from this paper presents a relative analysis of existing scheduling policies depend on their performance to progress the delay performance in most developments.
DC Conductivity Study of Cadmium Sulfide Nanoparticlesrahulmonikasharma
The dc conductivity of consolidated nanoparticle of CdS has been studied over the temperature range from 303 K to 523 K and the conductivity has been found to be much larger than that of single crystals.
A Survey on Peak to Average Power Ratio Reduction Methods for LTE-OFDMrahulmonikasharma
OFDM (Orthogonal Frequency Division Multiplexing) is generally preferred for high data rate transmission in digital communication. The Long-Term Evolution (LTE) standards for the fourth generation (4G) wireless communication systems. Orthogonal Frequency Division Multiple Access (OFDMA) and Single Carrier Frequency Division Multiple Access (SC-FDMA) are the two multiple access techniques which are generally used in LTE.OFDM system has a major shortcoming of high peak to average power ratio (PAPR) value. This paper explains different PAPR reduction techniques and presents a comparison of the various techniques based on theoretical results. It also presents a survey of the various PAPR reduction techniques and the state of the art in this area.
IOT Based Home Appliance Control System, Location Tracking and Energy Monitoringrahulmonikasharma
Home automation has been a dream of sciences for so many years. It could wind up conceivable in twentieth century simply after power all family units and web administrations were begun being utilized on across the board level. The point of home robotization is to give enhanced accommodation, comfort, vitality effectiveness and security. Vitality checking and protection holds prime significance in this day and age in view of the irregularity between control age and request observing frameworks accessible in the market. Ordinarily, customers are disappointed with the power charge as it doesn't demonstrate the power devoured at the gadget level. This paper shows the outline and execution of a vitality meter utilizing Arduino microcontroller which can be utilized to gauge the power devoured by any individual electrical apparatus. The primary expectation of the proposed vitality meter is to screen the power utilization at the gadget level, transfer it to the server and build up remote control of any apparatus. So we can screen the power utilization remotely and close down gadgets if vital. The car segment is additionally one of the application spaces where vehicle can be made keen by utilizing "IOT". So a vehicle following framework is additionally executed to screen development of vehicles remotely.
Thermal Radiation and Viscous Dissipation Effects on an Oscillatory Heat and ...rahulmonikasharma
An anticipated outcome that is intended chapter is to investigate effects of magnetic field on an oscillatory flow of a viscoelastic fluid with thermal radiation, viscous dissipation with Ohmic heating which bounded by a vertical plane surface, have been studied. Analytical solutions for the quasi – linear hyperbolic partial differential equations are obtained by perturbation technique. Solutions for velocity and temperature distributions are discussed for various values of physical parameters involving in the problem. The effects of cooling and heating of a viscoelastic fluid compared to the Newtonian fluid have been discussed.
Advance Approach towards Key Feature Extraction Using Designed Filters on Dif...rahulmonikasharma
In fast growing database repository system, image as data is one of the important concern despite text or numeric. Still we can’t replace test on any cost but for advancement, information may be managed with images. Therefore image processing is a wide area for the researcher. Many stages of processing of image provide researchers with new ideas to keep information safe with better way. Feature extraction, segmentation, recognition are the key areas of the image processing which helps to enhance the quality of working with images. Paper presents the comparison between image formats like .jpg, .png, .bmp, .gif. This paper is focused on the feature extraction and segmentation stages with background removal process. There are two filters, one is integer filter and second one is floating point Filter, which is used for the key feature extraction from image. These filters applied on the different images of different formats and visually compare the results.
Alamouti-STBC based Channel Estimation Technique over MIMO OFDM Systemrahulmonikasharma
The examination on various looks into on MIMO STBC framework in order to accomplish the higher framework execution is standard that the execution of the remote correspondence frameworks can be improved by usage numerous transmit and get radio wires, that is normally gathered on the grounds that the MIMO procedure, and has been incorporated. The Alamouti STBC might be a promising because of notice the pick up inside the remote interchanges framework misuse MIMO. To broaden the code rate and furthermore the yield of the symmetrical zone time square code for more than 4 transmit reception apparatuses is examined. The outlined framework is beated once forced with M-PSK (i.e upto 32-PSK) regulation. The channel estimation examine in these conditions.
Empirical Mode Decomposition Based Signal Analysis of Gear Fault Diagnosisrahulmonikasharma
A vibration investigation is about the specialty of searching for changes in the vibration example, and after that relating those progressions back to the machines mechanical outline. The level of vibration and the example of the vibration reveal to us something about the interior state of the turning segment. The vibration example can let us know whether the machine is out of adjust or twisted. Al-so blames with the moving components and coupling issues can be distinguished. This paper shows an approach for equip blame investigation utilizing signal handling plans. The information has been taken from college of ohio, joined states. The investigation has done utilizing MATLAB software.
This paper discusses a new algorithm of a univariate method, which is vitally important to develop a short-term load forecasting module for planning and operation of distribution system. It has many applications including purchasing of energy, generation and infrastructure development etc. We have discussed different time series forecasting approaches in this paper. But ARIMA has proved itself as the most appropriate method in forecasting of the load profile for West Bengal using the historical data of the year of 2017. Auto Regressive Integrated Moving Average model gives more accuracy level of load forecast than any other techniques. Mean Absolute Percentage Error (MAPE) has been calculated for the mentioned forecasted model.
Impact of Coupling Coefficient on Coupled Line Couplerrahulmonikasharma
The coupled line coupler is a type of directional coupler which finds practical utility. It is mainly used for sampling the microwave power. In this paper, 3 couplers A,B & C are designed with different values of coupling coefficient 6dB,10dB & 18dB respectively at a frequency of 2.5GHz using ADS tool. The return loss, isolation loss & transmission loss are determined. The design & simulation is done using microstrip line technology.
Design Evaluation and Temperature Rise Test of Flameproof Induction Motorrahulmonikasharma
The ignition of flammable gases, vapours or dust in presence of oxygen contained in the surrounding atmosphere may lead to explosion. Flameproof three phase induction motors are the most common and frequently used in the process industries such as oil refineries, oil rigs, petrochemicals, fertilizers, etc. The design of flameproof motor is such that it allows and sustain explosion within the enclosure caused by ignition of hazardous gases without transmitting it to the external flammable atmosphere. The enclosure is mechanically strong enough to withstand the explosion pressure developed inside it. To prevent an explosion due to hot spot on the surface of the motor, flameproof induction motors are subjected to heat run test to determine the maximum surface temperature and temperature class with respect to the ignition temperature of the surrounding flammable gas atmosphere. This paper highlights the design features of flameproof motors and their surface temperature classification for different sizes.
Advancement in Abrasive Water Jet Machining - A Studyrahulmonikasharma
The abrasive water-jet machining is an unconventional and eco-friendly technology used for hard and brittle material in industrial purpose. As the only cold high-energy beam machining technology, abrasive water-jet (AWJ) is one of the most rapidly developed techniques in material manufacturing industry and can be applied for wide variety of materials. Energy transformation is used to get pressurized jet and to have plastic deformation and fracture, results wear ratio is infinite. The study is focused on abrasive water jet lag info and recharging of abrasives and process parameter such as Influence of pressure, traverse rate, and abrasive flow rate, depth of cut and surface roughness and size and shape of abrasive particles and effectiveness of process to get higher surface finish. Advantageous and comparison will also be part of the concern study.AWJM technique has suitable for precise machining such as polishing, drilling, turning and milling. This technique has sought the benefits of combining with other material removal methods to further expand its applications.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
A Landmark Based Shortest Path Detection by Using A* and Haversine Formula
1. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 98 - 101
______________________________________________________________________________________
98
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
A Landmark Based Shortest Path Detection by Using A* and Haversine Formula
Ms. Megha G. Mathpal
Department of Information Technology
Government Engineering College
Modasa, Gujarat, India
mathpalmegha@gmail.com
Abstract—In 1900, less than 20 percent of the world populace lived in cities, in 2007, fair more than 50 percent of the world populace lived in
cities. In 2050, it has been anticipated that more than 70 percent of the worldwide population (about 6.4 billion individuals) will be
city tenants. There's more weight being set on cities through this increment in population [1]. With approach of keen cities, data and
communication technology is progressively transforming the way city regions and city inhabitants organize and work in reaction to
urban development. In this paper, we create a nonspecific plot for navigating a route throughout city
A asked route is given by utilizing combination of A* Algorithm and Haversine equation. Haversine Equation gives least distance between any
two focuses on spherical body by utilizing latitude and longitude. This least distance is at that point given to A* calculation to calculate
minimum distance. The method for identifying the shortest path is specify in this paper.
Keywords- Haversine Formula, Dijkstra Algorithm, Google Map, XML.
________________________________________________*****_________________________________________________
I. INTRODUCTION
The downsides happened in past paper of shortest path
discovery by utilizing Dijkstra calculation is recuperated in
this paper by employing A* calculation. A* calculation is
heuristic in nature. The point of Paper is to discover the route
between two places inside a city entered by client utilizing
the Intersections between Source and Goal intersections. The
witticism behind it is to progress navigation of client inside a
city; particularly in India where Town Arranging approach
doesn’t take after a standard rule for naming the diverse
places. Most of the times an unknown person can’t discover
indeed the foremost popular places inside the city due to
nonappearance of noteworthy identities. Hence the paper is
planning to allow a suitable route to client by coordinating it
through different intersections and streets which will be
effortlessly distinguished by the related landmarks and a
Google map. The route is given in two parts as: 1) Content
route containing route giving a intersection to intersection
movement to client in conjunction with the appropriate
directions and turnings directing the client to induce the
precise halfway intersections or landmarks 2) Google Map
for correct requested route. Paper uses client-server
engineering. Communication between them is entirely in
XML for adaptability. The client has client interface from
where an input is taken in XML for processing. The server
comprises of a Java Processing Application and Database for
it. The Database utilized by handling application could be a
Social database containing whole information around city.
The processing application after parsing request computes
route between them with all necessary subtle elements with
Latitude/Longitude for Google map and sends it as XML
response. Client once more parsing response gets it on Client
Interface with Google map handling done in JavaScript.
II. PROBLEM DEFINATION
The Point of Paper is to discover out the route in between two
spots/junctions inside a city entered by client by making use of
the Intersections in between the Source and Goal spots/junctions.
The main motto behind it is to progress the navigation of client
inside a city; particularly in Indian cities where Town Arranging
approach doesn’t take after a standard rule for numbering or
naming the distinctive spots or places. Most of the times an
obscure individual can’t discover indeed the most famous places
inside the city due to nonappearance of naming sheets or other
noteworthy identities. Subsequently the project is intended to
allow a suitable route to client by coordinating it through various
junctions and streets which is able be easily identified by the
related landmarks given with the route. The requested route is
given to client in terms of the intersections present in between the
source and goal route along with landmarks and streets
interfacing them. The Landmarks utilized within the route may be
noteworthy Buildings, Statues, Streets, Complexes, Landmarks,
Sanctuaries, etc. The use of Landmarks includes an advantage of
getting to the exact place having no critical personality whereas
voyaging through route provided to client making the application
friendly to the client obscure of the city to discover out the route
in between any two spots or intersections within the city. The
application is bound to deliver the shortest route providing a
junction to junction movement to client in conjunction with the
appropriate directions and turnings directing the client to induce
the precise intermediate intersections (with their significant
landmarks) or landmarks in specific zones in between two
junctions/spots provided by client.
2. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 98 - 101
______________________________________________________________________________________
99
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
III. LITERATURE SURVEY
This paper contains “great circle distance” which speaks to
the shortest path for distance modeling and optimal facility
area on spherical surface. Great circle distances take into
consideration the geometrical reality of the spherical Earth
and offers an elective to broadly held idea that travel over
water can be precisely displayed by Euclidean distances. The
need for geometrical presentation of the spherical earth gets
to be exceptionally important when we take into thought an
ever-expanding junction inside a city. The utilize of “Great
circle distances” opens another avenue for merging of
Navigation and Spherical Trigonometry into progression of
logistics and facility location. In this paper an assessment of
distance area utilizing great circle distances is utilized to
illustrate the application of the concept [4][3]. This paper
proposes and executes a strategy for performing shortest
path calculations taking crowdsourced information, in the
form of imperatives and impediments, into consideration.
The strategy is built on top of Google Maps (GM) and
employments its directing benefit to calculate the most
limited distance between two areas. Clients give the
limitations and obstacles in the form of polygons which
identify closed areas in the real world [5].
A.Haversine Formula
The Haversine formula is an equation important in
navigation, giving great-circle distances between two points
on a sphere from their longitudes and latitudes [4]. These
names follow from the fact that they are customarily written
in terms of the haversine function, given by haversin (θ) =
sin2 (θ/2). The haversine formula is used to calculate the
distance between two points on the Earth’s surface specified
in longitude and latitude. d is the distance between two points
with longitude and latitude (ψ,φ) and r is the radius of the
Earth. Translation to SQL statement[1] 3956 * 2 * ASIN (
SQRT (POWER(SIN((orig.lat - dest.lat)*pi()/180 / 2), 2)
+COS(orig.lat *pi()/180) *COS(dest.lat * pi()/180)
*POWER(SIN((orig.lon - dest.lon) * pi()/180 / 2), 2)) ) AS
distance [2].
B.A* Algorithm
A* uses a best-first search and finds a least-cost path from a
given beginning node to one objective node (out of one or
more possible objectives). As A* navigates the chart, it takes
after a path of the least anticipated total cost or distance,
keeping a sorted priority queue of alternate path segments
along the way. It uses a knowledge-plus-heuristic cost
function of node (usually indicated) to decide the arrange in
which the search visits nodes in the tree. The cost function is
a whole of two functions: • the past path-cost function, which
is the known distance from the beginning node to the current
node • a future path-cost function, which is an allowable
"heuristic estimate" of the distance from to the goal
Pseudo Code:
function A*(start,goal)
closedset := the empty set // The set of nodes already evaluated.
openset := {start} // The set of tentative nodes to be evaluated,
initially containing the start node
came_from := the empty map // The map of navigated nodes.
g_score[start] := 0 // Cost from start along best known path.
// Estimated total cost from start to goal through y.
f_score[start] := g_score[start] + heuristic_cost_estimate(start,
goal) while openset is not empty
current: = the node in openset having the lowest f_score[] value
if current = goal
return reconstruct_path(came_from, goal)
remove current from openset
add current to closedset
for each neighbour in neighbor_nodes(current)
tentative_g_score:=g_score[current]+
dist_between(current,neighbor)
if neighbor in closedset
if tentative_g_score>= g_score[neighbor]
continue
if neighbor not in openset or tentative_g_score<g_score[neighbor]
came_from[neighbor] := current
g_score[neighbor] := tentative_g_score
f_score[neighbor]:=g_score[neighbor]+heuristic_cost_estimate(ne
ighbor, goal)
if neighbor not in openset
add neighbor to openset
return failure;
function reconstruct_path(came_from, current_node)
if current_node in came_from
p:=reconstruct_path(came_fromcame_from[current_node])
return (p + current_node)
else
return current_node.
The above pseudo code assumes that the heuristic function is
monotonic, which is a frequent case in many practical problems,
such as the Shortest Distance Path in road networks. However, if
the assumption is not true, nodes in the closed set may be
rediscovered and their cost improved.
IV. SYSTEM DESIGN
The Point of the paper is to discover out the route in between any
two spots inside a city entered by the client. This may be
implemented using a client-server design where a request having
two intersections as Source and Goal is sent from client to server
and requested route is returned to client as a response from server.
The client-server execution assumes that the client gets to the
functional application remotely from client end to server one. This
makes a clear thought of having client at one machine remotely
accessing the application and server at the other. Hence the plan
incorporates noteworthy components shown in functional project
plan below: The client end consists of client interface from where
an input is taken for processing. The server end consists of a Java
Processing Application and Database for it.
3. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 98 - 101
______________________________________________________________________________________
100
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
The preparing application essentially takes as it were begin
and end junctions and computes the route in between them
with all fundamental subtle elements having middle
intersections with landmarks and streets in a specific region.
The Database utilized by preparing application may be a
Social database containing entirety data almost city in terms
of intersections, landmarks, streets and areas. The input
containing source and goal intersections for the asked route is
sent to the server conclusion as a request from client end.
This request is inserted in a XML record can be called as
XML request to be sent to server. At server on accepting a
XML request; it is provided to a XML parser for extricating
fundamental information i.e. source and destination junctions
which are in turn provided to Java Processing application as
an input. This application computes a requested route (a most
limited one) by connection with the database utilizing SQL
inquiries to get vital data for computation. For a computed
route to be sent to client, it is once more implanted into a
XML forming a XML response. This reaction on accepting at
client end is once more sent to a parser to extricate a route to
be shown to the client at to user interface.
A. Shortest route in the form of text route:
A client has arrangement to know the shortest way from
source to goal in two ways content-based route and graphical
route by utilizing Google outline. A content-based route
gives correct way from source to goal in the shape of
directions, turns, middle spots and distance between that
spots. A path is given to client by utilizing SQL query. At
last it gives the overall shortest distance from source to
destination.
B. Shortest route graphical representation:
Graphical representation of shortest route is appeared in figure. It
highlighted the shortest course from source to destination. Client
can utilize both the procedures to effortlessly know the route
between source to goal. GPI provides different strategies to get to
the highlighted route.
4. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 98 - 101
______________________________________________________________________________________
101
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
V. FUTURESCOPE
The downsides happened in past paper of shortest way
discovery by utilizing Dijkstra calculation is recovered in
this paper by employing A* algorithm. In this paper, we
utilize A* calculation for deciding shortest way between two
junctions. But A* is heuristic in nature it implies that A*
algorithm does not grant any guaranty for great solution.
This is property of any heuristic algorithm A* algorithm. So,
able to utilize any algorithm related with A* algorithm
which can donate best arrangement to calculate shortest path
between two cities. A* algorithm is combination of Dijkstra
algorithm and Breadth First Search algorithm. In expansion
to that, A* is heuristic in nature. This System can be applied
as a navigation system which can navigate through out city.
Together with intracity shortest path detection, we will
implement same concept for intercity.
VI. CONCLUSION
“Landmark Based Routing in Indian Cities” is bound to
allow the briefest route giving a junction to junction
movement to client together with the appropriate bearings
and turnings directing the client to urge the precise
intermediate junctions (with their noteworthy points of
interest) or points of interest in specific zones in between
two junctions/spots provided by user. The client moreover
gets correct route with direction of inserted Google Map.
VII. ACKNOWLEDGEMENT
We would like to thank Government engineering college,
Modasa for providing all the required amenities. I am also
grateful to Prof. J.S. Dhobi, Head of Information Technology
Department, GECM, Gujarat for their indispensable support,
suggestions and motivation.
REFERENCES
[1] By Mr. Reid “Shortest distance between two points on earth”
http://wordpress.mrreid.org/haversine-formula/ This is an
electronic document. Date of publishing 20/12/2011.
[2] Samuel Idowu, Nadeem Bari, “A Development Framework for
Smart City,” Luleå University of Technology International
journal of Computer Application, vol 6, 9 Nov. 2012
[3] Javin J. Mwemzi, YoufangHuang,” Optimal Facility location
on spherical surfaces”, New york science Journal, April 2011.
[4] Ben Gardiner, Waseem Ahmad, Travis Cooper,”Collision
Avoidance Techniques for unmanned Aerial Vehicles”, Auburn
University, National Science Foundation, 08/07/2011.
[5] Simeon Nedkov, SisiZlatanova, “Enabling Obstacle Avoidance
for Google maps”,June 2011.
[6] Bing Pan,john C. Crotts and Brian Muller,”Developing Web
Based Tourism Information using Google Map” Departemnt of
Huminity and Tourism Mangement,Charston ,USA.
[7] ElinaAgapie.jason Ryder, Jeff Burke, Deborth Estrin,”
Probable Path Interference for GPS traces in cities”, university
of California,2009.
[8] K.M.Chandy,J. Misra, “Distributed Computation on Graphs:
Shortest Path Algorithm”, University of Texas, March 1982.
[9] Siemens AG. Munchen, Ulrich Lauther “An Extremely Fast
Exact Algorithm for Finding Shortest Path in static network
with geographic backgroung”, International journal on
Computer science and Engineering, June2006.
[10] Philip Klein,Satish Rao ,Monika Rauch, Sairam Subramnyam,
“Faster Shortest Path Algorithm for Planner Graphs”, March
1994.
[11] Andrew v. Goldberg, Haim Kaplan, Renato F. Werneck,
“Efficient Point to point shortest Path Algorithm”, Internation
Research on Advance Research in Computer Science and
Software Engineering, Oct 2005.
![International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 98 - 101
______________________________________________________________________________________
98
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
A Landmark Based Shortest Path Detection by Using A* and Haversine Formula
Ms. Megha G. Mathpal
Department of Information Technology
Government Engineering College
Modasa, Gujarat, India
mathpalmegha@gmail.com
Abstract—In 1900, less than 20 percent of the world populace lived in cities, in 2007, fair more than 50 percent of the world populace lived in
cities. In 2050, it has been anticipated that more than 70 percent of the worldwide population (about 6.4 billion individuals) will be
city tenants. There's more weight being set on cities through this increment in population [1]. With approach of keen cities, data and
communication technology is progressively transforming the way city regions and city inhabitants organize and work in reaction to
urban development. In this paper, we create a nonspecific plot for navigating a route throughout city
A asked route is given by utilizing combination of A* Algorithm and Haversine equation. Haversine Equation gives least distance between any
two focuses on spherical body by utilizing latitude and longitude. This least distance is at that point given to A* calculation to calculate
minimum distance. The method for identifying the shortest path is specify in this paper.
Keywords- Haversine Formula, Dijkstra Algorithm, Google Map, XML.
________________________________________________*****_________________________________________________
I. INTRODUCTION
The downsides happened in past paper of shortest path
discovery by utilizing Dijkstra calculation is recuperated in
this paper by employing A* calculation. A* calculation is
heuristic in nature. The point of Paper is to discover the route
between two places inside a city entered by client utilizing
the Intersections between Source and Goal intersections. The
witticism behind it is to progress navigation of client inside a
city; particularly in India where Town Arranging approach
doesn’t take after a standard rule for naming the diverse
places. Most of the times an unknown person can’t discover
indeed the foremost popular places inside the city due to
nonappearance of noteworthy identities. Hence the paper is
planning to allow a suitable route to client by coordinating it
through different intersections and streets which will be
effortlessly distinguished by the related landmarks and a
Google map. The route is given in two parts as: 1) Content
route containing route giving a intersection to intersection
movement to client in conjunction with the appropriate
directions and turnings directing the client to induce the
precise halfway intersections or landmarks 2) Google Map
for correct requested route. Paper uses client-server
engineering. Communication between them is entirely in
XML for adaptability. The client has client interface from
where an input is taken in XML for processing. The server
comprises of a Java Processing Application and Database for
it. The Database utilized by handling application could be a
Social database containing whole information around city.
The processing application after parsing request computes
route between them with all necessary subtle elements with
Latitude/Longitude for Google map and sends it as XML
response. Client once more parsing response gets it on Client
Interface with Google map handling done in JavaScript.
II. PROBLEM DEFINATION
The Point of Paper is to discover out the route in between two
spots/junctions inside a city entered by client by making use of
the Intersections in between the Source and Goal spots/junctions.
The main motto behind it is to progress the navigation of client
inside a city; particularly in Indian cities where Town Arranging
approach doesn’t take after a standard rule for numbering or
naming the distinctive spots or places. Most of the times an
obscure individual can’t discover indeed the most famous places
inside the city due to nonappearance of naming sheets or other
noteworthy identities. Subsequently the project is intended to
allow a suitable route to client by coordinating it through various
junctions and streets which is able be easily identified by the
related landmarks given with the route. The requested route is
given to client in terms of the intersections present in between the
source and goal route along with landmarks and streets
interfacing them. The Landmarks utilized within the route may be
noteworthy Buildings, Statues, Streets, Complexes, Landmarks,
Sanctuaries, etc. The use of Landmarks includes an advantage of
getting to the exact place having no critical personality whereas
voyaging through route provided to client making the application
friendly to the client obscure of the city to discover out the route
in between any two spots or intersections within the city. The
application is bound to deliver the shortest route providing a
junction to junction movement to client in conjunction with the
appropriate directions and turnings directing the client to induce
the precise intermediate intersections (with their significant
landmarks) or landmarks in specific zones in between two
junctions/spots provided by client.](https://image.slidesharecdn.com/20153303228031-07-2018-190131154250/85/A-Landmark-Based-Shortest-Path-Detection-by-Using-A-and-Haversine-Formula-1-320.jpg)
![International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 6 Issue: 7 98 - 101
______________________________________________________________________________________
99
IJRITCC | July 2018, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
III. LITERATURE SURVEY
This paper contains “great circle distance” which speaks to
the shortest path for distance modeling and optimal facility
area on spherical surface. Great circle distances take into
consideration the geometrical reality of the spherical Earth
and offers an elective to broadly held idea that travel over
water can be precisely displayed by Euclidean distances. The
need for geometrical presentation of the spherical earth gets
to be exceptionally important when we take into thought an
ever-expanding junction inside a city. The utilize of “Great
circle distances” opens another avenue for merging of
Navigation and Spherical Trigonometry into progression of
logistics and facility location. In this paper an assessment of
distance area utilizing great circle distances is utilized to
illustrate the application of the concept [4][3]. This paper
proposes and executes a strategy for performing shortest
path calculations taking crowdsourced information, in the
form of imperatives and impediments, into consideration.
The strategy is built on top of Google Maps (GM) and
employments its directing benefit to calculate the most
limited distance between two areas. Clients give the
limitations and obstacles in the form of polygons which
identify closed areas in the real world [5].
A.Haversine Formula
The Haversine formula is an equation important in
navigation, giving great-circle distances between two points
on a sphere from their longitudes and latitudes [4]. These
names follow from the fact that they are customarily written
in terms of the haversine function, given by haversin (θ) =
sin2 (θ/2). The haversine formula is used to calculate the
distance between two points on the Earth’s surface specified
in longitude and latitude. d is the distance between two points
with longitude and latitude (ψ,φ) and r is the radius of the
Earth. Translation to SQL statement[1] 3956 * 2 * ASIN (
SQRT (POWER(SIN((orig.lat - dest.lat)*pi()/180 / 2), 2)
+COS(orig.lat *pi()/180) *COS(dest.lat * pi()/180)
*POWER(SIN((orig.lon - dest.lon) * pi()/180 / 2), 2)) ) AS
distance [2].
B.A* Algorithm
A* uses a best-first search and finds a least-cost path from a
given beginning node to one objective node (out of one or
more possible objectives). As A* navigates the chart, it takes
after a path of the least anticipated total cost or distance,
keeping a sorted priority queue of alternate path segments
along the way. It uses a knowledge-plus-heuristic cost
function of node (usually indicated) to decide the arrange in
which the search visits nodes in the tree. The cost function is
a whole of two functions: • the past path-cost function, which
is the known distance from the beginning node to the current
node • a future path-cost function, which is an allowable
"heuristic estimate" of the distance from to the goal
Pseudo Code:
function A*(start,goal)
closedset := the empty set // The set of nodes already evaluated.
openset := {start} // The set of tentative nodes to be evaluated,
initially containing the start node
came_from := the empty map // The map of navigated nodes.
g_score[start] := 0 // Cost from start along best known path.
// Estimated total cost from start to goal through y.
f_score[start] := g_score[start] + heuristic_cost_estimate(start,
goal) while openset is not empty
current: = the node in openset having the lowest f_score[] value
if current = goal
return reconstruct_path(came_from, goal)
remove current from openset
add current to closedset
for each neighbour in neighbor_nodes(current)
tentative_g_score:=g_score[current]+
dist_between(current,neighbor)
if neighbor in closedset
if tentative_g_score>= g_score[neighbor]
continue
if neighbor not in openset or tentative_g_score<g_score[neighbor]
came_from[neighbor] := current
g_score[neighbor] := tentative_g_score
f_score[neighbor]:=g_score[neighbor]+heuristic_cost_estimate(ne
ighbor, goal)
if neighbor not in openset
add neighbor to openset
return failure;
function reconstruct_path(came_from, current_node)
if current_node in came_from
p:=reconstruct_path(came_fromcame_from[current_node])
return (p + current_node)
else
return current_node.
The above pseudo code assumes that the heuristic function is
monotonic, which is a frequent case in many practical problems,
such as the Shortest Distance Path in road networks. However, if
the assumption is not true, nodes in the closed set may be
rediscovered and their cost improved.
IV. SYSTEM DESIGN
The Point of the paper is to discover out the route in between any
two spots inside a city entered by the client. This may be
implemented using a client-server design where a request having
two intersections as Source and Goal is sent from client to server
and requested route is returned to client as a response from server.
The client-server execution assumes that the client gets to the
functional application remotely from client end to server one. This
makes a clear thought of having client at one machine remotely
accessing the application and server at the other. Hence the plan
incorporates noteworthy components shown in functional project
plan below: The client end consists of client interface from where
an input is taken for processing. The server end consists of a Java
Processing Application and Database for it.](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)