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
Hybridization of Meta-heuristics for Optimizing Routing protocol in VANETsIJERA Editor
The goal of VANET is to establish a vehicular communication system which is reliable and fast which caters to
road safety and road safety. In VANET where network fragmentation is frequent with no central control, routing
becomes a challenging task. Planning an optimal routing plan for tuning parameter configuration of routing
protocol for setting up VANET is very crucial. This is done by defining an optimization problem where
hybridization of meta-heuristics is defined. The paper contributes the idea of combining meta-heuristic
algorithm to enhance the performance of individual search method for optimization problem.
Optimized Robot Path Planning Using Parallel Genetic Algorithm Based on Visib...IJERA Editor
An analysis is made for optimized path planning for mobile robot by using parallel genetic algorithm. The
parallel genetic algorithm (PGA) is applied on the visible midpoint approach to find shortest path for mobile
robot. The hybrid ofthese two algorithms provides a better optimized solution for smooth and shortest path for
mobile robot. In this problem, the visible midpoint approach is used to make the effectiveness for avoiding
local minima. It gives the optimum paths which are always consisting on free trajectories. But the
proposedhybrid parallel genetic algorithm converges very fast to obtain the shortest route from source to
destination due to the sharing of population. The total population is partitioned into a number subgroups to
perform the parallel GA. The master thread is the center of information exchange and making selection with
fitness evaluation.The cell to cell crossover makes the algorithm significantly good. The problem converges
quickly with in a less number of iteration.
Nonlinear prediction of human resting state functional connectivity based on ...eSAT Journals
Abstract
Mounting evidence demonstrated that neuronal activity derived from functional magnetic resonance imaging (fMRI) relates to the
underlying anatomical circuitry measured by diffusion tensor/spectrum imaging (DTI/DSI). However, exploring the relationship
between functional connectivity (FC) and structural connectivity (SC) remains challengeable and thus has motivated a number of
computational models to investigate the extent to which the dynamics depend on the topology. Nevertheless, most of the models
are complex and difficult to treat analytically. In this paper, for simplicity, we utilize four network communication measures
extracted from SC as well as polynomial curves fitting method to predict FC. Our results indicate that all of these measures
predict FC via the nonlinear fitting method. Besides, compared with the linear method, the fitting value between predicted FC and
empirical FC attains higher after applying nonlinear process on communication measures which may help to shed light on the
function-structure relationship.
Key Words: brain connectivity; fMRI; DTI/DSI; network communication measure; nonlinear fitting
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands
as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted
demand. The novel idea is to select routes based on not only network states but also information derived
from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links.
Experiments with respect to acceptance ratio and computation time have been conducted against various
test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE)
.
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.
Trajectory Segmentation and Sampling of Moving Objects Based On Representativ...ijsrd.com
Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this paper, we propose a method for trajectory segmentation and sampling based on the representativeness of the (sub) trajectories in the MOD. In order to find the most representative sub trajectories, the following methodology is proposed. First, a novel global voting algorithm is performed, based on local density and trajectory similarity information. This method is applied for each segment of the trajectory, forming a local trajectory descriptor that represents line segment representativeness. The sequence of this descriptor over a trajectory gives the voting signal of the trajectory, where high values correspond to the most representative parts. Then, a novel segmentation algorithm is applied on this signal that automatically estimates the number of partitions and the partition borders, identifying homogenous partitions concerning their representativeness. Finally, a sampling method over the resulting segments yields the most representative sub trajectories in the MOD. Our experimental results in synthetic and real MOD verify the effectiveness of the proposed scheme, also in comparison with other sampling techniques.
Prediction of passenger train using fuzzy time series and percentage change m...journalBEEI
In the subject of railway operation, predicting railway passenger volume has always been a hot topic. Accurately forecasting railway passenger volume is the foundation for railway transportation companies to optimize transit efficiency and revenue. The goal of this research is to use a combination of the fuzzy time series approach based on the rate of change algorithm and the Holt double exponential smoothing method to forecast the number of train passengers. In contrast to prior investigations, we focus primarily on determining the next time period in this research. The fuzzy time series is employed as the forecasting basis, the rate of change is used to build the set of universes, and the Holt's double exponential smoothing method is utilized to forecast the following period in this case study. The number of railway passengers predicted for January 2020 is 38199, with a tiny average forecasting error rate of 0.89 percent and a mean square error of 131325. It can also help rail firms identify future passenger needs, which can be used to decide whether to expand train cars or run new trains, as well as how to distribute tickets.
A comprehensive review on hybrid network traffic prediction model IJECEIAES
Network traffic is a typical nonlinear time series. As such, traditional linear and nonlinear models are inadequate to describe the multi-scale characteristics of traffic, thus compromising the prediction accuracy. Therefore, the research to date has tended to focus on hybrid models rather than the traditional linear and non-linear ones. Generally, a hybrid model adopts two or more methods as combined modelling to analyze and then predict the network traffic. Against this backdrop, this paper will review past research conducted on hybrid network traffic prediction models. The review concludes with a summary of the strengths and limitations of existing hybrid network prediction models which use optimization and decomposition techniques, respectively. These two techniques have been identified as major contributing factors in constructing a more accurate and fast response hybrid network traffic prediction.
Hybridization of Meta-heuristics for Optimizing Routing protocol in VANETsIJERA Editor
The goal of VANET is to establish a vehicular communication system which is reliable and fast which caters to
road safety and road safety. In VANET where network fragmentation is frequent with no central control, routing
becomes a challenging task. Planning an optimal routing plan for tuning parameter configuration of routing
protocol for setting up VANET is very crucial. This is done by defining an optimization problem where
hybridization of meta-heuristics is defined. The paper contributes the idea of combining meta-heuristic
algorithm to enhance the performance of individual search method for optimization problem.
Optimized Robot Path Planning Using Parallel Genetic Algorithm Based on Visib...IJERA Editor
An analysis is made for optimized path planning for mobile robot by using parallel genetic algorithm. The
parallel genetic algorithm (PGA) is applied on the visible midpoint approach to find shortest path for mobile
robot. The hybrid ofthese two algorithms provides a better optimized solution for smooth and shortest path for
mobile robot. In this problem, the visible midpoint approach is used to make the effectiveness for avoiding
local minima. It gives the optimum paths which are always consisting on free trajectories. But the
proposedhybrid parallel genetic algorithm converges very fast to obtain the shortest route from source to
destination due to the sharing of population. The total population is partitioned into a number subgroups to
perform the parallel GA. The master thread is the center of information exchange and making selection with
fitness evaluation.The cell to cell crossover makes the algorithm significantly good. The problem converges
quickly with in a less number of iteration.
Nonlinear prediction of human resting state functional connectivity based on ...eSAT Journals
Abstract
Mounting evidence demonstrated that neuronal activity derived from functional magnetic resonance imaging (fMRI) relates to the
underlying anatomical circuitry measured by diffusion tensor/spectrum imaging (DTI/DSI). However, exploring the relationship
between functional connectivity (FC) and structural connectivity (SC) remains challengeable and thus has motivated a number of
computational models to investigate the extent to which the dynamics depend on the topology. Nevertheless, most of the models
are complex and difficult to treat analytically. In this paper, for simplicity, we utilize four network communication measures
extracted from SC as well as polynomial curves fitting method to predict FC. Our results indicate that all of these measures
predict FC via the nonlinear fitting method. Besides, compared with the linear method, the fitting value between predicted FC and
empirical FC attains higher after applying nonlinear process on communication measures which may help to shed light on the
function-structure relationship.
Key Words: brain connectivity; fMRI; DTI/DSI; network communication measure; nonlinear fitting
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands
as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted
demand. The novel idea is to select routes based on not only network states but also information derived
from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links.
Experiments with respect to acceptance ratio and computation time have been conducted against various
test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE)
.
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.
Trajectory Segmentation and Sampling of Moving Objects Based On Representativ...ijsrd.com
Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this paper, we propose a method for trajectory segmentation and sampling based on the representativeness of the (sub) trajectories in the MOD. In order to find the most representative sub trajectories, the following methodology is proposed. First, a novel global voting algorithm is performed, based on local density and trajectory similarity information. This method is applied for each segment of the trajectory, forming a local trajectory descriptor that represents line segment representativeness. The sequence of this descriptor over a trajectory gives the voting signal of the trajectory, where high values correspond to the most representative parts. Then, a novel segmentation algorithm is applied on this signal that automatically estimates the number of partitions and the partition borders, identifying homogenous partitions concerning their representativeness. Finally, a sampling method over the resulting segments yields the most representative sub trajectories in the MOD. Our experimental results in synthetic and real MOD verify the effectiveness of the proposed scheme, also in comparison with other sampling techniques.
Prediction of passenger train using fuzzy time series and percentage change m...journalBEEI
In the subject of railway operation, predicting railway passenger volume has always been a hot topic. Accurately forecasting railway passenger volume is the foundation for railway transportation companies to optimize transit efficiency and revenue. The goal of this research is to use a combination of the fuzzy time series approach based on the rate of change algorithm and the Holt double exponential smoothing method to forecast the number of train passengers. In contrast to prior investigations, we focus primarily on determining the next time period in this research. The fuzzy time series is employed as the forecasting basis, the rate of change is used to build the set of universes, and the Holt's double exponential smoothing method is utilized to forecast the following period in this case study. The number of railway passengers predicted for January 2020 is 38199, with a tiny average forecasting error rate of 0.89 percent and a mean square error of 131325. It can also help rail firms identify future passenger needs, which can be used to decide whether to expand train cars or run new trains, as well as how to distribute tickets.
A comprehensive review on hybrid network traffic prediction model IJECEIAES
Network traffic is a typical nonlinear time series. As such, traditional linear and nonlinear models are inadequate to describe the multi-scale characteristics of traffic, thus compromising the prediction accuracy. Therefore, the research to date has tended to focus on hybrid models rather than the traditional linear and non-linear ones. Generally, a hybrid model adopts two or more methods as combined modelling to analyze and then predict the network traffic. Against this backdrop, this paper will review past research conducted on hybrid network traffic prediction models. The review concludes with a summary of the strengths and limitations of existing hybrid network prediction models which use optimization and decomposition techniques, respectively. These two techniques have been identified as major contributing factors in constructing a more accurate and fast response hybrid network traffic prediction.
A Combined Approach for Feature Subset Selection and Size Reduction for High ...IJERA Editor
selection of relevant feature from a given set of feature is one of the important issues in the field of
data mining as well as classification. In general the dataset may contain a number of features however it is not
necessary that the whole set features are important for particular analysis of decision making because the
features may share the common information‟s and can also be completely irrelevant to the undergoing
processing. This generally happen because of improper selection of features during the dataset formation or
because of improper information availability about the observed system. However in both cases the data will
contain the features that will just increase the processing burden which may ultimately cause the improper
outcome when used for analysis. Because of these reasons some kind of methods are required to detect and
remove these features hence in this paper we are presenting an efficient approach for not just removing the
unimportant features but also the size of complete dataset size. The proposed algorithm utilizes the information
theory to detect the information gain from each feature and minimum span tree to group the similar features
with that the fuzzy c-means clustering is used to remove the similar entries from the dataset. Finally the
algorithm is tested with SVM classifier using 35 publicly available real-world high-dimensional dataset and the
results shows that the presented algorithm not only reduces the feature set and data lengths but also improves the
performances of the classifier.
Text documents clustering using modified multi-verse optimizerIJECEIAES
In this study, a multi-verse optimizer (MVO) is utilised for the text document clus- tering (TDC) problem. TDC is treated as a discrete optimization problem, and an objective function based on the Euclidean distance is applied as similarity measure. TDC is tackled by the division of the documents into clusters; documents belonging to the same cluster are similar, whereas those belonging to different clusters are dissimilar. MVO, which is a recent metaheuristic optimization algorithm established for continuous optimization problems, can intelligently navigate different areas in the search space and search deeply in each area using a particular learning mechanism. The proposed algorithm is called MVOTDC, and it adopts the convergence behaviour of MVO operators to deal with discrete, rather than continuous, optimization problems. For evaluating MVOTDC, a comprehensive comparative study is conducted on six text document datasets with various numbers of documents and clusters. The quality of the final results is assessed using precision, recall, F-measure, entropy accuracy, and purity measures. Experimental results reveal that the proposed method performs competitively in comparison with state-of-the-art algorithms. Statistical analysis is also conducted and shows that MVOTDC can produce significant results in comparison with three well-established methods.
K-nearest neighbor and naïve Bayes based diagnostic analytic of harmonic sour...journalBEEI
This paper proposes a comparison of machine learning (ML) algorithm known as the k-nearest neighbor (KNN) and naïve Bayes (NB) in identifying and diagnosing the harmonic sources in the power system. A single-point measurement is applied in this proposed method, and using the S-transform the measurement signals are analyzed and extracted into voltage and current parameters. The voltage and current features that estimated from time-frequency representation (TFR) of S-transform analysis are used as the input for MLs. Four significant cases of harmonic source location are considered, whereas harmonic voltage (HV) and harmonic current (HC) source type-load are used in the diagnosing process. To identify the best ML, the performance measurement of the proposed method including the accuracy, precision, specificity, sensitivity, and F-measure are calculated. The sufficiency of the proposed methodology is tested and verified on IEEE 4-bust test feeder and each ML algorithm is executed for 10 times due to prevent any overfitting result.
Application Of Extreme Value Theory To Bursts PredictionCSCJournals
Bursts and extreme events in quantities such as connection durations, file sizes, throughput, etc. may produce undesirable consequences in computer networks. Deterioration in the quality of service is a major consequence. Predicting these extreme events and burst is important. It helps in reserving the right resources for a better quality of service. We applied Extreme value theory (EVT) to predict bursts in network traffic. We took a deeper look into the application of EVT by using EVT based Exploratory Data Analysis. We found that traffic is naturally divided into two categories, Internal and external traffic. The internal traffic follows generalized extreme value (GEV) model with a negative shape parameter, which is also the same as Weibull distribution. The external traffic follows a GEV with positive shape parameter, which is Frechet distribution. These findings are of great value to the quality of service in data networks, especially when included in service level agreement as traffic descriptor parameters.
Hybrid multi objectives genetic algorithms and immigrants scheme for dynamic ...khalil IBRAHIM
the main concept of intelligent optimization techniques, artificial neural networks, and new genetic algorithms to solve the multi-objective multicast routing problems with shortest path (SP) problem that used in the addresses networks and improve all processes addressing in the wireless communications based on multi-objective optimization. The most important characteristics in mobile wireless networks is the topology dynamics and the network topology changes over time, the routing problem (SPRP) in mobile ad hoc networks (MANETs) turns out to be a dynamic optimization problem[13], the hybrid immigrants multiple-objective genetic algorithm (HIMOGAs) in the real- world are dynamic in nature, that has objective functions, constraints, and parameters, the dynamic optimization problems (DOPs) are a big challenges to evolutionary multi-objective, since any environmental change may affect the objective vector, constraints, and parameters, HIMOGA for the optimization goal is to track the moving of parameters and get a sequence of approximations solutions over time. The quantity of services (QoS) is supporting guarantee for all data traffic and getting the maximizing utilization for network, the QoS based on multicast routing offers significant challenges, and increases to use an efficient multicast routing protocol that will be able to check multicast routing and satisfying QoS constraints, The author propose to use HIMOGAs and SP algorithm to solve multicast problem that produces new generation wireless networks with immigrants schema to get high-quality solutions after each change and satisfying all objectives.
Extended pso algorithm for improvement problems k means clustering algorithmIJMIT JOURNAL
The clustering is a without monitoring process and one of the most common data mining techniques. The
purpose of clustering is grouping similar data together in a group, so were most similar to each other in a
cluster and the difference with most other instances in the cluster are. In this paper we focus on clustering
partition k-means, due to ease of implementation and high-speed performance of large data sets, After 30
year it is still very popular among the developed clustering algorithm and then for improvement problem of
placing of k-means algorithm in local optimal, we pose extended PSO algorithm, that its name is ECPSO.
Our new algorithm is able to be cause of exit from local optimal and with high percent produce the
problem’s optimal answer. The probe of results show that mooted algorithm have better performance
regards as other clustering algorithms specially in two index, the carefulness of clustering and the quality
of clustering.
2-DOF BLOCK POLE PLACEMENT CONTROL APPLICATION TO:HAVE-DASH-IIBTT MISSILEZac Darcy
In a multivariable servomechanism design, it is required that the output vector tracks a certain reference
vector while satisfying some desired transient specifications, for this purpose a 2DOF control law
consisting of state feedback gain and feedforward scaling gain is proposed. The control law is designed
using block pole placement technique by assigning a set of desired Block poles in different canonical forms.
The resulting control is simulated for linearized model of the HAVE DASH II BTT missile; numerical
results are analyzed and compared in terms of transient response, gain magnitude, performance
robustness, stability robustness and tracking. The suitable structure for this case study is then selected.
PROTECTOR CONTROL PC-AODV-BH IN THE AD HOC NETWORKSZac Darcy
In this paper we deal with the protector control that which we used to secure AODV routing protocol in Ad
Hoc networks. The considered system can be vulnerable to several attacks because of mobility and absence
of infrastructure. While the disturbance is assumed to be of the black hole type, we purpose a control
named "PC-AODV-BH" in order to neutralize the effects of malicious nodes. Such a protocol is obtained by
coupling hash functions, digital signatures and fidelity concept. An implementation under NS2 simulator
will be given to compare our proposed approach with SAODV protocol, basing on three performance
metrics and taking into account the number of black hole malicious nodes.
A Novel Penalized and Compensated Constraints Based Modified Fuzzy Possibilis...ijsrd.com
A cluster is a group of objects which are similar to each other within a cluster and are dissimilar to the objects of other clusters. The similarity is typically calculated on the basis of distance between two objects or clusters. Two or more objects present inside a cluster and only if those objects are close to each other based on the distance between them.The major objective of clustering is to discover collection of comparable objects based on similarity metric. Fuzzy Possibilistic C-Means (FPCM) is the effective clustering algorithm available to cluster unlabeled data that produces both membership and typicality values during clustering process. In this approach, the efficiency of the Fuzzy Possibilistic C-means clustering approach is enhanced by using the penalized and compensated constraints based FPCM (PCFPCM). The proposed PCFPCM approach differ from the conventional clustering techniques by imposing the possibilistic reasoning strategy on fuzzy clustering with penalized and compensated constraints for updating the grades of membership and typicality. The performance of the proposed approaches is evaluated on the University of California, Irvine (UCI) machine repository datasets such as Iris, Wine, Lung Cancer and Lymphograma. The parameters used for the evaluation is Clustering accuracy, Mean Squared Error (MSE), Execution Time and Convergence behavior.
Comparison of search algorithms in Javanese-Indonesian dictionary applicationTELKOMNIKA JOURNAL
This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. Performance Testing is used to test the performance of algorithm implementations in applications. The test results show that the Boyer Moore and Knuth Morris Pratt algorithms have an accuracy rate of 100%, and the Horspool algorithm 85.3%. While the processing time, Knuth Morris Pratt algorithm has the highest average speed level of 25ms, Horspool 39.9 ms, while the average speed of the Boyer Moore algorithm is 44.2 ms. While the complexity test results, the Boyer Moore algorithm has an overall number of n 26n2, Knuth Morris Pratt and Horspool 20n2 each.
A study and implementation of the transit route network design problem for a ...csandit
The design of public transportation networks presup
poses solving optimization problems,
involving various parameters such as the proper mat
hematical description of networks, the
algorithmic approach to apply, and also the conside
ration of real-world, practical
characteristics such as the types of vehicles in th
e network, the frequencies of routes, demand,
possible limitations of route capacities, travel de
cisions made by passengers, the environmental
footprint of the system, the available bus technolo
gies, besides others. The current paper
presents the progress of the work that aims to stud
y the design of a municipal public
transportation system that employs middleware techn
ologies and geographic information
services in order to produce practical, realistic r
esults. The system employs novel optimization
approaches such as the particle swarm algorithms an
d also considers various environmental
parameters such as the use of electric vehicles and
the emissions of conventional ones.
The Improved Hybrid Algorithm for the Atheer and Berry-ravindran Algorithms IJECEIAES
Exact String matching considers is one of the important ways in solving the basic problems in computer science. This research proposed a hybrid exact string matching algorithm called E-Atheer. This algorithm depended on good features; searching and shifting techniques in the Atheer and BerryRavindran algorithms, respectively. The proposed algorithm showed better performance in number of attempts and character comparisons compared to the original and recent and standard algorithms. E-Atheer algorithm used several types of databases, which are DNA, Protein, XML, Pitch, English, and Source. The best performancein the number of attempts is when the algorithm is executed using the pitch dataset. The worst performance is when it is used with DNA dataset. The best and worst databases in the number of character comparisons with the E-Atheer algorithm are the Source and DNA databases, respectively.
A spatial data model for moving object databasesijdms
Moving Object Databases will have significant role in Geospatial Information Systems as they allow users
to model continuous movements of entities in the databases and perform spatio-temporal analysis. For
representing and querying moving objects, an algebra with a comprehensive framework of User Defined
Types together with a set of functions on those types is needed. Moreover, concerning real world
applications, moving objects move along constrained environments like transportation networks so that an
extra algebra for modeling networks is demanded, too. These algebras can be inserted in any data model if
their designs are based on available standards such as Open Geospatial Consortium that provides a
common model for existing DBMS’s. In this paper, we focus on extending a spatial data model for
constrained moving objects. Static and moving geometries in our model are based on Open Geospatial
Consortium standards. We also extend Structured Query Language for retrieving, querying, and
manipulating spatio-temporal data related to moving objects as a simple and expressive query language.
Finally as a proof-of-concept, we implement a generator to generate data for moving objects constrained
by a transportation network. Such a generator primarily aims at traffic planning applications.
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
Devlopement of the dynamic resistance measurement (drm) method for condition ...eSAT Publishing House
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 Combined Approach for Feature Subset Selection and Size Reduction for High ...IJERA Editor
selection of relevant feature from a given set of feature is one of the important issues in the field of
data mining as well as classification. In general the dataset may contain a number of features however it is not
necessary that the whole set features are important for particular analysis of decision making because the
features may share the common information‟s and can also be completely irrelevant to the undergoing
processing. This generally happen because of improper selection of features during the dataset formation or
because of improper information availability about the observed system. However in both cases the data will
contain the features that will just increase the processing burden which may ultimately cause the improper
outcome when used for analysis. Because of these reasons some kind of methods are required to detect and
remove these features hence in this paper we are presenting an efficient approach for not just removing the
unimportant features but also the size of complete dataset size. The proposed algorithm utilizes the information
theory to detect the information gain from each feature and minimum span tree to group the similar features
with that the fuzzy c-means clustering is used to remove the similar entries from the dataset. Finally the
algorithm is tested with SVM classifier using 35 publicly available real-world high-dimensional dataset and the
results shows that the presented algorithm not only reduces the feature set and data lengths but also improves the
performances of the classifier.
Text documents clustering using modified multi-verse optimizerIJECEIAES
In this study, a multi-verse optimizer (MVO) is utilised for the text document clus- tering (TDC) problem. TDC is treated as a discrete optimization problem, and an objective function based on the Euclidean distance is applied as similarity measure. TDC is tackled by the division of the documents into clusters; documents belonging to the same cluster are similar, whereas those belonging to different clusters are dissimilar. MVO, which is a recent metaheuristic optimization algorithm established for continuous optimization problems, can intelligently navigate different areas in the search space and search deeply in each area using a particular learning mechanism. The proposed algorithm is called MVOTDC, and it adopts the convergence behaviour of MVO operators to deal with discrete, rather than continuous, optimization problems. For evaluating MVOTDC, a comprehensive comparative study is conducted on six text document datasets with various numbers of documents and clusters. The quality of the final results is assessed using precision, recall, F-measure, entropy accuracy, and purity measures. Experimental results reveal that the proposed method performs competitively in comparison with state-of-the-art algorithms. Statistical analysis is also conducted and shows that MVOTDC can produce significant results in comparison with three well-established methods.
K-nearest neighbor and naïve Bayes based diagnostic analytic of harmonic sour...journalBEEI
This paper proposes a comparison of machine learning (ML) algorithm known as the k-nearest neighbor (KNN) and naïve Bayes (NB) in identifying and diagnosing the harmonic sources in the power system. A single-point measurement is applied in this proposed method, and using the S-transform the measurement signals are analyzed and extracted into voltage and current parameters. The voltage and current features that estimated from time-frequency representation (TFR) of S-transform analysis are used as the input for MLs. Four significant cases of harmonic source location are considered, whereas harmonic voltage (HV) and harmonic current (HC) source type-load are used in the diagnosing process. To identify the best ML, the performance measurement of the proposed method including the accuracy, precision, specificity, sensitivity, and F-measure are calculated. The sufficiency of the proposed methodology is tested and verified on IEEE 4-bust test feeder and each ML algorithm is executed for 10 times due to prevent any overfitting result.
Application Of Extreme Value Theory To Bursts PredictionCSCJournals
Bursts and extreme events in quantities such as connection durations, file sizes, throughput, etc. may produce undesirable consequences in computer networks. Deterioration in the quality of service is a major consequence. Predicting these extreme events and burst is important. It helps in reserving the right resources for a better quality of service. We applied Extreme value theory (EVT) to predict bursts in network traffic. We took a deeper look into the application of EVT by using EVT based Exploratory Data Analysis. We found that traffic is naturally divided into two categories, Internal and external traffic. The internal traffic follows generalized extreme value (GEV) model with a negative shape parameter, which is also the same as Weibull distribution. The external traffic follows a GEV with positive shape parameter, which is Frechet distribution. These findings are of great value to the quality of service in data networks, especially when included in service level agreement as traffic descriptor parameters.
Hybrid multi objectives genetic algorithms and immigrants scheme for dynamic ...khalil IBRAHIM
the main concept of intelligent optimization techniques, artificial neural networks, and new genetic algorithms to solve the multi-objective multicast routing problems with shortest path (SP) problem that used in the addresses networks and improve all processes addressing in the wireless communications based on multi-objective optimization. The most important characteristics in mobile wireless networks is the topology dynamics and the network topology changes over time, the routing problem (SPRP) in mobile ad hoc networks (MANETs) turns out to be a dynamic optimization problem[13], the hybrid immigrants multiple-objective genetic algorithm (HIMOGAs) in the real- world are dynamic in nature, that has objective functions, constraints, and parameters, the dynamic optimization problems (DOPs) are a big challenges to evolutionary multi-objective, since any environmental change may affect the objective vector, constraints, and parameters, HIMOGA for the optimization goal is to track the moving of parameters and get a sequence of approximations solutions over time. The quantity of services (QoS) is supporting guarantee for all data traffic and getting the maximizing utilization for network, the QoS based on multicast routing offers significant challenges, and increases to use an efficient multicast routing protocol that will be able to check multicast routing and satisfying QoS constraints, The author propose to use HIMOGAs and SP algorithm to solve multicast problem that produces new generation wireless networks with immigrants schema to get high-quality solutions after each change and satisfying all objectives.
Extended pso algorithm for improvement problems k means clustering algorithmIJMIT JOURNAL
The clustering is a without monitoring process and one of the most common data mining techniques. The
purpose of clustering is grouping similar data together in a group, so were most similar to each other in a
cluster and the difference with most other instances in the cluster are. In this paper we focus on clustering
partition k-means, due to ease of implementation and high-speed performance of large data sets, After 30
year it is still very popular among the developed clustering algorithm and then for improvement problem of
placing of k-means algorithm in local optimal, we pose extended PSO algorithm, that its name is ECPSO.
Our new algorithm is able to be cause of exit from local optimal and with high percent produce the
problem’s optimal answer. The probe of results show that mooted algorithm have better performance
regards as other clustering algorithms specially in two index, the carefulness of clustering and the quality
of clustering.
2-DOF BLOCK POLE PLACEMENT CONTROL APPLICATION TO:HAVE-DASH-IIBTT MISSILEZac Darcy
In a multivariable servomechanism design, it is required that the output vector tracks a certain reference
vector while satisfying some desired transient specifications, for this purpose a 2DOF control law
consisting of state feedback gain and feedforward scaling gain is proposed. The control law is designed
using block pole placement technique by assigning a set of desired Block poles in different canonical forms.
The resulting control is simulated for linearized model of the HAVE DASH II BTT missile; numerical
results are analyzed and compared in terms of transient response, gain magnitude, performance
robustness, stability robustness and tracking. The suitable structure for this case study is then selected.
PROTECTOR CONTROL PC-AODV-BH IN THE AD HOC NETWORKSZac Darcy
In this paper we deal with the protector control that which we used to secure AODV routing protocol in Ad
Hoc networks. The considered system can be vulnerable to several attacks because of mobility and absence
of infrastructure. While the disturbance is assumed to be of the black hole type, we purpose a control
named "PC-AODV-BH" in order to neutralize the effects of malicious nodes. Such a protocol is obtained by
coupling hash functions, digital signatures and fidelity concept. An implementation under NS2 simulator
will be given to compare our proposed approach with SAODV protocol, basing on three performance
metrics and taking into account the number of black hole malicious nodes.
A Novel Penalized and Compensated Constraints Based Modified Fuzzy Possibilis...ijsrd.com
A cluster is a group of objects which are similar to each other within a cluster and are dissimilar to the objects of other clusters. The similarity is typically calculated on the basis of distance between two objects or clusters. Two or more objects present inside a cluster and only if those objects are close to each other based on the distance between them.The major objective of clustering is to discover collection of comparable objects based on similarity metric. Fuzzy Possibilistic C-Means (FPCM) is the effective clustering algorithm available to cluster unlabeled data that produces both membership and typicality values during clustering process. In this approach, the efficiency of the Fuzzy Possibilistic C-means clustering approach is enhanced by using the penalized and compensated constraints based FPCM (PCFPCM). The proposed PCFPCM approach differ from the conventional clustering techniques by imposing the possibilistic reasoning strategy on fuzzy clustering with penalized and compensated constraints for updating the grades of membership and typicality. The performance of the proposed approaches is evaluated on the University of California, Irvine (UCI) machine repository datasets such as Iris, Wine, Lung Cancer and Lymphograma. The parameters used for the evaluation is Clustering accuracy, Mean Squared Error (MSE), Execution Time and Convergence behavior.
Comparison of search algorithms in Javanese-Indonesian dictionary applicationTELKOMNIKA JOURNAL
This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. Performance Testing is used to test the performance of algorithm implementations in applications. The test results show that the Boyer Moore and Knuth Morris Pratt algorithms have an accuracy rate of 100%, and the Horspool algorithm 85.3%. While the processing time, Knuth Morris Pratt algorithm has the highest average speed level of 25ms, Horspool 39.9 ms, while the average speed of the Boyer Moore algorithm is 44.2 ms. While the complexity test results, the Boyer Moore algorithm has an overall number of n 26n2, Knuth Morris Pratt and Horspool 20n2 each.
A study and implementation of the transit route network design problem for a ...csandit
The design of public transportation networks presup
poses solving optimization problems,
involving various parameters such as the proper mat
hematical description of networks, the
algorithmic approach to apply, and also the conside
ration of real-world, practical
characteristics such as the types of vehicles in th
e network, the frequencies of routes, demand,
possible limitations of route capacities, travel de
cisions made by passengers, the environmental
footprint of the system, the available bus technolo
gies, besides others. The current paper
presents the progress of the work that aims to stud
y the design of a municipal public
transportation system that employs middleware techn
ologies and geographic information
services in order to produce practical, realistic r
esults. The system employs novel optimization
approaches such as the particle swarm algorithms an
d also considers various environmental
parameters such as the use of electric vehicles and
the emissions of conventional ones.
The Improved Hybrid Algorithm for the Atheer and Berry-ravindran Algorithms IJECEIAES
Exact String matching considers is one of the important ways in solving the basic problems in computer science. This research proposed a hybrid exact string matching algorithm called E-Atheer. This algorithm depended on good features; searching and shifting techniques in the Atheer and BerryRavindran algorithms, respectively. The proposed algorithm showed better performance in number of attempts and character comparisons compared to the original and recent and standard algorithms. E-Atheer algorithm used several types of databases, which are DNA, Protein, XML, Pitch, English, and Source. The best performancein the number of attempts is when the algorithm is executed using the pitch dataset. The worst performance is when it is used with DNA dataset. The best and worst databases in the number of character comparisons with the E-Atheer algorithm are the Source and DNA databases, respectively.
A spatial data model for moving object databasesijdms
Moving Object Databases will have significant role in Geospatial Information Systems as they allow users
to model continuous movements of entities in the databases and perform spatio-temporal analysis. For
representing and querying moving objects, an algebra with a comprehensive framework of User Defined
Types together with a set of functions on those types is needed. Moreover, concerning real world
applications, moving objects move along constrained environments like transportation networks so that an
extra algebra for modeling networks is demanded, too. These algebras can be inserted in any data model if
their designs are based on available standards such as Open Geospatial Consortium that provides a
common model for existing DBMS’s. In this paper, we focus on extending a spatial data model for
constrained moving objects. Static and moving geometries in our model are based on Open Geospatial
Consortium standards. We also extend Structured Query Language for retrieving, querying, and
manipulating spatio-temporal data related to moving objects as a simple and expressive query language.
Finally as a proof-of-concept, we implement a generator to generate data for moving objects constrained
by a transportation network. Such a generator primarily aims at traffic planning applications.
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
Devlopement of the dynamic resistance measurement (drm) method for condition ...eSAT Publishing House
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.
Multi agent paradigm for cognitive parameter based feature similarity for soc...eSAT Publishing House
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.
Evaluvation of noise level and its adverse effect in metal die manufacuturing...eSAT Publishing House
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.
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
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
Effect of shade percentage on various properties of cotton knitted fabric dye...eSAT Publishing House
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
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.
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.
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.
Location and Mobility Optimized On-demand Geographical Multipath Routing Prot...Eswar Publications
The advancement of science and technology had made mobile ad hoc network an important tool to access network of next generation. Recently, numerous multipath routing protocols for mobile ad hoc network are reported in literature. Each routing methods works based on their salient feature, but failed to control congestion, energy efficiency, overhead packets, signal stability during data transmission which leads to edge effect, signal decay and bottleneck situation of the bandwidth consumption. In this paper a novel approach havely Geographical Distance based Ad Hoc On-demand Distance Vector Routing (GD-AOMDV), which selects the path based on transmission distance value to limit and control the congestion and control overheads has been proposed. The salient feature of the proposed model is that it establishes a relationship between path distance and MANET design parameters
including transmission range, consumption of energy and bandwidth. The accuracy of the proposed scheme is
analyzed and validated with the experimental results in respect to various flow using NS2 simulations.
An Improved Greedy Parameter Stateless Routing in Vehicular Ad Hoc NetworkIJAAS Team
Congestion problem and packet delivery related issues in the vehicular ad hoc network environment is a widely researched problem in recent years. Many network designers utilize various algorithms for the design of ad hoc networks and compare their results with the existing approaches. The design of efficient network protocol is a major challenge in vehicular ad hoc network which utilizes the value of GPS and other parameters associated with the vehicles. In this paper GPSR protocol is improved and compared with the existing GPSR protocol and AODV protocol on the basis of various performance parameters like throughput of the network, delay and packet delivery ratio. The results also validate the performance of the proposed approach.
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
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensio...IOSR Journals
Abstract: Network on Chip has emerged as new paradigm for the system designers to design an on chip interconnection network. However, NOC presents a large amount of array of design parameters and decision that are sometimes difficult to tackle. Apart from these issues NOC presents a framework of communication for complex SOC and has been widely accepted by the industries and academia’s. Today all the complex VLSI circuitry which requires an on chip communication between them are the part of NOC. The mature concepts of communication network such as routing algorithm, switching technique, flow and congestion control etc in the NOC are the important features on which the performance of NOC depends. This paper introduces the efficient source routing algorithm which generates the minimum hop from source to destination. Performance of NOC network in terms of latency and throughput for minimum hop source routing algorithm is also evaluated. Keywords: Network on chip, routing algorithm, topology, traffic.
Survey on scalable continual top k keyword search in relational databaseseSAT Journals
Abstract Keyword search in relational database is a technique that has higher relevance in the present world. Extracting data from a large number of sets of database is very important .Because it reduces the usage of man power and time consumption. Data extraction from a large database using the relevant keyword based on the information needed is a very interactive and user friendly. Without knowing any database schemas or query languages like sql the user can get information. By using keyword in relational database data extraction will be simpler. The user doesn’t want to know the query language for search. But the database content is always changing for real time application for example database which store the data of publication data. When new publications arrive it should be added to database so the database content changes according to time. Because the database is updated frequently the result should change. In order to handle the database updation takes the top-k result from the currently updated data for each search. Top-k keyword search means take greatest k results based on the relevance of document. Keyword search in relational database means to find structural information from tuples from the database. Two types of keyword search are schema-based method and graph based approach. Using top-k keyword search instead of executing all query results taking highest k queries. By handling database updation try to find the new results and remove expired one
Performance Evaluation of Routing Protocols in University Networkijtsrd
In an enterprise network, multiple dynamic routing protocols are used for forwarding packets with the best routes. Therefore, performance of the network is based on routing protocols and the route redistribution is an important issue in an enterprise network that has been configured by multiple different routing protocols in its routers. So, aim of the system is to analyze the performance and comparison of different Interior Gateway routing protocols. Routing is depended on many parameters critical such as network convergence time, Ethernet delay, throughput, end to end delay, jitter, packet delivery, security and bandwidth, etc. In this paper, the analysis of characteristics and the performance of the different routing protocols as Routing Information Protocol RIP , Open Shortest Path First OSPF and Enhanced Interior Gateway Routing Protocol EIGRP are evaluated in a university network. The performance evaluation are based on end to end packet delay, network convergence time, packet delay variation and administrative distance, etc. The analysis focuses on the performance of the routing protocols with its routing table in a simulator. The Simulation software can be used to evaluate and compare the performance of the routing protocols. The simulator return the routing table for each node or router in the university network which would contain the best path to reach the remote destination on the metric chosen based on the routing protocol implemented. The simulation software give results used to evaluate the performance of routing protocols, the performance of different routing protocols will be compared, and to analyze the convergence time and administrative distance of routing protocols. Kyaw Zay Oo "Performance Evaluation of Routing Protocols in University Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26582.pdfPaper URL: https://www.ijtsrd.com/engineering/information-technology/26582/performance-evaluation-of-routing-protocols-in-university-network/kyaw-zay-oo
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.
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
Abstract Our work mainly focused on the performance and effects of different mobility models like Random Waypoint, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Link-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) routing protocols. These three routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updated-proactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed the performance issues in AODV, DSDV and DSR routing protocols in Random Waypoint mobility model on Mobile Ad hoc Networks (MANETs) is not satisfactory due to link failure and late acknowledgement. To resolve the specified issue, we have come up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA and ZRP. A simulation was carried out in NS2 and Bonnmotion for above said protocols and mobility models in Constant Bit Rate (CBR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our simulation it was shown that few mobility model performed better in different routing protocols. In our simulation results, we got a high Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR protocols. Index Terms: MANET, CBR, Routing protocols, Mobility models, NS2
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningEswar Publications
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector
or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 nodes MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
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.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
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.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Fundamentals of Electric Drives and its applications.pptx
A survey on optimal route queries for road networks
1. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 02 Issue: 12 | Dec-2013, Available @ http://www.ijret.org 447
A SURVEY ON OPTIMAL ROUTE QUERIES FOR ROAD NETWORKS
Gopika N.A1
, S. Deepa Kanmani2
1
PG student, 2
Assistant Professor, Computer Science and Engineering, Karunya University, Tamilnadu, India,
gopika.nasa@gmail.com, deepa_cse@karunya.edu
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.
----------------------------------------------------------------------***------------------------------------------------------------------------
1. INTRODUCTION
Query processing is the efficient retrieval of desired
information from the database system. The various phases of
query processing system are shown in the Fig 1. Four main
steps are there in the query processing where first three steps
are executed in compile time and last one in the runtime. The
route queries obtain the route from the spatial data with
categorical information stored in the database. The optimal
route queries find the optimal route from the given set of
information. The users have to give query starting point and
some travelling rules or constraints [4], [7] along with the
database which contains the categorical information about the
road map. Various techniques are used for the processing of
route queries. The some of the techniques used travelling rules
which are either total order or partial order and some other
without any specification. The given constraints may be either
total order or partial order.
Optimal route query processing finds all the possible routes
and then optimizes these possible routes. For that, route
queries operate on the spatial data with categorical
information [5], [8]. The goal is to find the optimal route from
the given queries.
In this paper, we discuss about various techniques in optimal
route queries. There are two main approaches: query
processing for optimal route [2], [3], [4], [7] and queries that
operate on spatial data [5], [6], [8].
Fig -1: Various Phases of query processing system
Relational
algebra
expression
Execution
plan
Generated
code
Query
output
System
catalog
Database
statistics
Main
database
Com
pile
time
Runti
me
Query
decomposi
tion
Query
optimizati
on
Code
generation
Runtime
query
execution
Query in high
level language
2. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 02 Issue: 12 | Dec-2013, Available @ http://www.ijret.org 448
The paper is organized as follows: section 2 presents the
problems in the optimal route queries. Section 3 and 4
classifies the optimal route query processing and the queries
related to spatial search with categorical information. The
advantages and disadvantages of each scheme are also
specified in this section.
2. PROBLEM STATEMENT
The optimal route query processing is mainly used in the road
network. The very first solution of the optimal route query is
based on the greedy strategy [1]. The first approaches
considered only the end points. The later approaches used
some category sequences as the input for the optimal route
queries that is some of the constraints are considered.
Different types of constraints are combined with the query.
Apart from the optimal route query some of the categorical
information is needed to consider for better surroundings and
facilities. For the effectiveness of some clustering techniques
are also discussed. Most of the techniques have limitations in
some particular area. The main problems are some of the
techniques may produce optimal route and others not. Among
this some may consider constraints and others without
consider the constraints and these are the main problems to
consider.
3. OPTIMAL ROUTE QUERY PROCESSING IN
ROAD NETWORK
3.1 On Trip Planning Queries (TPQ) in Spatial
Database
On Trip Planning Queries [3] are the efficient and exact
solutions for the general optimal route queries. A set of point
of interest (POI) of different categories, starting point and
destination point is given and TPQ [3] finds the best trip
starting from the specific source and will ends on the
destination through some POI. There are no ordered
constraints here in this method. The existence of multiple
choices per category is the main difficulty of this technique
and for solving this some of the approximation techniques are
used.
Mainly two greedy algorithms are available with the tight
approximation ratios with respect to the total number of
categories. The first algorithm is the nearest neighbor
algorithm. This algorithm find the best trip by visiting the
nearest neighbor of the last category to be added and that have
not been visited at that particular moment. The route thus
formed from source to destination point which is specified by
the user. The second one is the minimum distance algorithm
which introduces a novel greedy algorithm and while
comparing with the first one this is having the better
approximation bound [3]. This will find the set of vertices
with minimum cost. In this paper the nearest neighbor
algorithm is used to finds the better route starting and ending
at specific points. The advantages of the On Trip Planning
Queries include 1. Approximation ratio is high, 2. Minimum
cost for route finding. The disadvantage includes 1. No user
defined constraints in the TPQ.
3.2 The Optimal Sequenced Route (OSR) Query
The Optimal Sequenced Route Query [7] is a type of Nearest
Neighbor query and it finds the optimal route that starts from a
specific location and passed through a number of typed
location in some specific order. The shortest path problem is
the basics of this technique. First of all the OSR problem is
transformed into a simple shortest path problem in large planar
graph. For that the Dijkstra’s algorithm [7] is used. The OSR
query is given with starting point, a set of intermediate points
and the sequence of the locations. The weighted directed
graph is constructed from the given network. The starting
point is connected to all the other vertices and the weight
assigned to each edge of graph is the distance between two
end vertices. From this the optimal route of the OSR query is
the route or set of points with minimum length. The shortest
path finding is by travelling from starting point to all other
points and returning the minimum path length and this is done
by the Dijkstra’s algorithm. But this classic Dijkstra’s
algorithm is impractical due to the following reasons. The first
one is, in the real world dataset millions of possible edges
have to be handles so the time complexity is very high. Thus
the complexity of the algorithm is also very huge.
To improve the problem occurred due to the Dijkstra’s
algorithm the range query can be used. Even then the problem
cannot be overcome. Therefore Light Optimal Route Discover
(LORD)[7] algorithm developed for handling OSR queries.
This is an iterative and a light threshold based algorithm,
which uses different thresholds to filter out the points that
cannot be the optimal route. The memory requirement for
LORD is very much less than Dijkstra’s algorithm therefore it
is named as light. First this algorithm generates a set of partial
sequenced routes in the opposite order. That is from the
destination point to the starting point. Attach each point to the
recently added one and finally forms the optimal route.
The next one is R-LORD [7] algorithm which is an enhanced
version of LORD algorithm. It is based on R-tree and it
calculated the threshold value more efficiently. This is the first
correct solution for the optimal route queries with total order
travelling rules. R-LORD uses the greedy algorithm to find the
optimal route and the threshold value. From the end category,
finds the optimal points in the sequence and within the
threshold distance to the query point. Iteratively finds the
optimum route.
3.3 The Multi-Rule Partial Sequenced Route Query
The optimal route computation is purely based on greedy [1]
solutions in the earlier stages. This uses two approaches. The
first one is Nearest Neighbor Partial Sequenced Route
3. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 02 Issue: 12 | Dec-2013, Available @ http://www.ijret.org 449
(NNPSR)[2] which works similar to greedy approach. This
will start from the query start point and find the point which is
nearest to the start point and forms the edge. Then using the
newly added point finds the nearest point and forms the route.
The final route will be optimal through this greedy approach.
That is it finds the best at that moment. The second approach
will find all the nearest points from each and every category
and forms the route. This is also optimal route with in a
particular range.
Then another approach is the combination of NNPSR and R-
LORD [7]. The NNPSR is used to obtain the greedy route.
From that it obtains the category of each and every point. This
total order of categories is the input of R-LORD. And it will
output the suboptimal routes.
4. SPATIAL SEARCH WITH CATEGORICAL
INFORMATION
4.1 Top-K spatial Preference Queries
The spatial preference query [8] is used to rank the objects
from the feature qualities of the neighborhood objects.
Generally Top-K spatial preference queries are used to rank
the spatial objects effectively. Different types of algorithms
are used for this ranking. First one is a baseline algorithm
named simple probing algorithm and which applying the
spatial queries on feature dataset and calculate the scores for
every object. Thus the ranking is done. The incremental
computation techniques are used to optimize the simple
probing algorithm and which minimizes the number of
computations of component scores.
A variant of simple probing algorithm [8] is the group probing
algorithm and which computing the object scores in the
particular leaf node repeatedly and thus reduces the I/O cost.
Branch and Bound algorithm [8] is the enhanced version of
group probing algorithm, which removes the entries other than
the leaf nodes in the object tree that cannot produce better
performance. For this a new method is used by accessing
feature trees and deriving upper bound scores for the entities.
The last one is feature join algorithm [8] which performs over
the feature tree by multi-way join used to find the group of
feature points and then search for the objects using this
grouping.
4.2 Categorical Range Queries (CRQ) in Large
Databases
The categorical range queries [5] in the large database are
handled through the paper. Mainly it is related to the spatial
data like geostationary information systems. For this technique
a multi tree indent is used and which is associated with an
effective way of categorical data and spatial information. The
main concept is the augmentation [5] of categorical points
with some information to accelerate the queries.
The technical parts are a new method for spatial data structure
and R-Tree based on the query processing of CRQs in the
context of large databases. The new method is compared with
two baseline algorithms. The first one is the regular range
query [5] which handles the query for the particular range of
lower and upper boundary. The second one is the construction
of R-Tree [5] which contains the nodes that are the categorical
attributes.
4.3 Query Processing in Spatial Network Databases
The query processing in spatial database [6] is mainly based
on Euclidean spaces. But in this paper a new architecture is
proposed in which the road network is separated from the
datasets. To gather connectivity and location, a disk-based
representation is used. For handling the dynamic updates and
Euclidean queries the spatial entities are scored by some of the
corresponding spatial access methods. Based on the above
architecture two techniques are developed which are
Euclidean restriction and network expansion. The most
common spatial queries are the range search queries, nearest
neighbor queries, closest pair queries and distance join
queries. These are processed by using the above mentioned
frameworks. By using the location information and
connectivity, the efficient pruning of the search space is
possible. Through this the traditional processing methods can
be expanded by the new algorithms. The query processing in
the Spatial Network Databases (SNDB)[6] in efficient and this
paper introduces this advantage.
4.4 Optimal Route Query with Arbitrary Order
Constraints
The optimal route query considers the partial order constraints
for finding the optimal route. The user wants to specify
starting point, destination point and a set of arbitrary order
constraints [4]. This is different from the total sequenced rules.
The example for the partial order constraints is “visit the pub
before hotel”. Therefore any other categories can be included
in between these two categories. But total order is the
sequenced route conditions.
For considering the partial order constraints two different
types of techniques are developed namely Backward search
and Forward search [4]. Both the methods will take the same
inputs and will produce the same output. The backward search
algorithm finds the optimal route in the reverse manner that is
starting from the destination and ends at the query starting
point. This is similar to the R-LORD algorithm [7]. First select
the destination point and as per the partial sequenced route
find out all the possible edges to the second last point. Then
find the optimum edge from these and attached to the
destination. Then repeat the process until the query starting
point encountered.
4. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
__________________________________________________________________________________________
Volume: 02 Issue: 12 | Dec-2013, Available @ http://www.ijret.org 450
The second one is Forward search algorithm and which is
similar to the greedy algorithm [1]. First select the query
starting point and then find the nearest neighbor point which
satisfies the given constraint. The process repeats and finally
one optimal route is obtained. Then this forward search
algorithm will use the backward search algorithm for the
backtracking process. This will eliminate the demerits of the
greedy algorithm. That is it eliminates some points that will
not be a part of the optimal route. Both the algorithms find the
optimal routes and which satisfies all the given partial order
constraints. The memory usage is reduced by using some
pruning techniques. Thus the number of categories from the
dataset is reduced and the memory usage will be reduced.
This paper which uses both the optimal route query processing
in road network and the spatial search with categorical
information. Thus the methods used here is included in both
the classifications. This technique solved the problem of
optimal route query with partial order constraints [4]. Another
advantage is that several sub routes also can be obtained and
are optimal. Therefore in the real world application some of
the category points can be omitted to meet the particular cost
or the time.
5. CONCLUSIONS
The optimal route queries find the optimal route and this has
greater applications in the road network. The spatial search
with categorical information is used to consider the categorical
points to be visited with better facilities. The initial solution of
the optimal route query is based on the greedy solution. Some
of the techniques considered total order constraints. The recent
solutions of the optimal route query handle the arbitrary order
constraints. All the methods will result in the optimal solutions
with the given the starting and destination points. But many of
the techniques do not consider constraints. Some may consider
the total order constraints and some others use the partial order
constraints. In future, some of the timing constraints can be
included to the optimal route queries.
ACKNOWLEDGEMENTS
I feel it pleasure to be indebted to my guide Mrs. S. Deepa
Kanmani, M.E, Assistant professor, Department of Computer
Science and Engineering for her invaluable support, advice
and encouragement and the reference for her feedback.
REFERENCES
[1]. Boinski P, Wojciechowski M, Zakrzewicz M(2007), “A
Greedy Approach to Concurrent Processing of Frequent
Itemset Queries”, Proc. Of the International IIS: IIPWM’06
Conference
[2]. Chen H, Ku W.S, Sun M.T, Zimmermann R(2008), “The
Multi-Rule Partial Sequenced Route Query”, Proc. 16th ACM
SIGSPATIAL Int’l Conf. Advances in Geographic
Information Systems (GIS)
[3]. Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng
S.H(2005), “On Trip Planning Queries in Spatial Databases”,
Proc. Ninth Int’l Conf. Advances in Spatial and Temporal
Databases (SSTD)
[4]. Li J, Yang Y.D, Mamoulis N(2013), “Optimal Route
Queries with Arbitrary Order Constraints”, IEEE Trans.
Computers, vol. 25, no. 5, pp. 1097- 1110
[5]. Nanopoulos A, Bozanis P(2003), “Categorical Range
Queries in Large Databases”, Springer-Verlag Berlin
Heidelberg, pp. 122-139
[6]. Papadias D,Zhang J, Mamoulis N, Tao Y(2003), “Query
Processing in Spatial Network Databases”, VLDB conference.
[7]. Sharifzadeh M, Kolahdouzan M.R, Shahabi C(2008),
“The Optimal Sequenced Route Query”, VLDB J - Int’l J.
Very Large Data Bases, vol. 17, no. 4, pp. 765-787
[8]. Yiu M.L, Mamoulis N, Vaitis M(2007), “Top-k Spatial
Preference Queries”, 7160/05E from Hong Kong RGC
BIOGRAPHIES
Gopika N.A pursuing her M.Tech in Computer
Science and Engineering from Karunya
University, Tamilnadu, India. She received her
Bachelor’s degree from Lourdes Matha
Engineering College under Kerala University
in Computer Science and Engineering.
Mrs. S. Deepa Kanmani received her Master of
Engineering degree from the Anna University,
India. Currently she is pursuing her Ph.D
degree in Distributed Data Mining & Database,
Karunya University, and Coimbatore. She is
working as an Assistant Professor in Computer Science and
Engineering Department, Karunya University, Coimbatore.