Search

Airline industry has witnessed a tremendous growth in the recent past. Percentage of people choosing air travel as first choice to commute is continuously increasing. Highly demanding and congested air routes are resulting in inadvertent delays, additional fuel consumption and high emission of greenhouse gases. Trajectory planning involves creation identification of cost-effective flight plans for optimal utilization of fuel and time. This situation warrants the need of an intelligent system for dynamic planning of optimized flight trajectories with least human intervention required. In this paper, an algorithm for dynamic planning of optimized flight trajectories has been proposed. The proposed algorithm divides the airspace into four dimensional cubes and calculate a dynamic score for each cube to cumulatively represent estimated weather, aerodynamic drag and air traffic within that virtual cube. There are several constraints like simultaneous flight separation rules, weather conditions like air temperature, pressure, humidity, wind speed and direction that pose a real challenge for calculating optimal flight trajectories. To validate the proposed methodology, a case analysis was undertaken within Indian airspace. The flight routes were simulated for four different air routes within Indian airspace. The experiment results observed a seven percent reduction in drag values on the predicted path, hence indicates reduction in carbon footprint and better fuel economy. [ABSTRACT FROM AUTHOR]

Ransomware is a special malware designed to extort money in return for unlocking the device and personal data files. Smartphone users store their personal as well as official data on these devices. Ransomware attackers found it bewitching for their financial benefits. The financial losses due to ransomware attacks are increasing rapidly. Recent studies witness that out of 87% reported cyber-attacks, 41% are due to ransomware attacks. The inability of application-signature-based solutions to detect unknown malware has inspired many researchers to build automated classification models using machine learning algorithms. Advanced malware is capable of delaying malicious actions on sensing the emulated environment and hence posing a challenge to dynamic monitoring of applications also. Existing hybrid approaches utilize a variety of features combination for detection and analysis. The rapidly changing nature and distribution strategies are possible reasons behind the deteriorated performance of primitive ransomware detection techniques. The limitations of existing studies include ambiguity in selecting the features set. Increasing the feature set may lead to freedom of adept attackers against learning algorithms. In this work, we intend to propose a hybrid approach to identify and mitigate Android ransomware. This study employs a novel dominant feature selection algorithm to extract the dominant feature set. The experimental results show that our proposed model can differentiate between clean and ransomware with improved precision. Our proposed hybrid solution confirms an accuracy of 99.85% with zero false positives while considering 60 prominent features. Further, it also justifies the feature selection algorithm used. The comparison of the proposed method with the existing frameworks indicates its better performance. [ABSTRACT FROM AUTHOR]

Advancement in technology has resulted in the easy sharing of locations across various stakeholders. Unprotected sharing of location information makes any Global Navigation Satellite System (GNSS) device vulnerable to spoofing attacks. Spoofed GNSS signals propagate misleading trajectories to cripple any Location-Based Service (LBS). This manuscript introduces a novel algorithm for the detection and mitigation of spoofing attacks. The proposed algorithm was implemented in the Android application using the OpenStreetMap dataset. GNSS spoofing attacks were simulated and detected in real-time. The efficiency of the proposed algorithm was analyzed using the Ratio of Correctly Detected (RCD) and Ratio of Correctly Matched (RCM) spoofed points. The maximum observed values for RCD and RCM were 75% and 94%, respectively. Minimum RCD and RCM values observed during the experiment were 59% and 92%. The accuracy of the proposed algorithm was further analyzed using average positional error (APE). Maximum and minimum recorded APE values were 25.08% and 13.83% respectively. The manuscript concludes with a comparison of the proposed algorithm with that of existing techniques. [ABSTRACT FROM AUTHOR]

Complex road networks, inaccurate GPS receiver output, low sampling rate and many other associated issues pose real challenges for map matching process. Genetic algorithms have recently been trialed for rendering GPS fix on digital maps. This manuscript introduces an improvised genetic algorithm named as post-processing genetic-inspired map matching (GiMM) algorithm. The proposed GiMM intends to mitigate inherent challenges associated with originally proposed genetic algorithm for map matching. The fitness function used by GiMM makes use of Bucket Dijkstra's and fast dynamic time wrapping (FDTW) algorithms to render GPS information on digital maps. Bucket Dijkstra's suggests the shortest path available in between two points, and FDTW is responsible for comparing two data series. Unlike traditional genetic algorithm for map matching, GiMM was evaluated on sparse as well as dense GPS data. The performance of the GiMM algorithm was evaluated in real time using OpenStreetMap data and GPS dataset mapped onto a road network of 82 km. GiMM uses population size, generation count, accuracy and execution time as input parameters. A maximum accuracy of 99.4% with root-mean-square error 0.06 was observed, whereas a minimum of 60% accuracy was observed at 0.47 root-mean-square error. Number of iterations and population size were concluded to be the most influential parameters for the performance of genetic algorithms for map matching. [ABSTRACT FROM AUTHOR]

Virtual machine consolidation is a major solution for addressing the issue of increasing energy consumption by cloud computing data centers. A lot of work is done on developing algorithms for detecting underloaded, overloaded hosts, selection of virtual machines and their placement to perform the consolidation. These algorithms are usually tested on publicly available Planet lab workload. There is a need to know how benchmarks algorithms used in consolidation of virtual machines respond to other workloads. This paper is an attempt to evaluate these algorithms on Google workload trace. An importer is made to use this dataset by extending the CloudSim toolkit. The comparison of results using Planet lab and Google workload traces is made which shows the difference of 46.41%, 14.84%, 12.86% and 44.83% respectively in terms of number of virtual machine migrations, service level agreement violation time per active host, number of hosts shutdown, and energy consumption. The objective comparison of results illustrated that there is a need to test the proposed algorithms on multiple datasets in order to be assessed as optimal. [ABSTRACT FROM AUTHOR]

Business houses and marketers have been relying on social media to affect consumer opinions and purchasing behavior. In this paper a framework has been proposed to identify and quantify the emotive value of any movie trailer. The proposed framework made use of Dlib-ml (a machine learning toolkit) and a Genetic Algorithm inspired Support Vector Machine algorithm (GA i SVM) for parameter tuning and classification and emotive analysis of movie trailers. A case study comprising of 141 movies trailers released from Jan 1, 2017 till April 31, 2018 was done to investigate the relationship between emotive score of a movie trailer and financial returns associated with it. Results revealed a direct correlation between emotive score of a movie trailer and financial returns. Further, it was concluded that an emotionally intense movie trailer could result high financial returns in comparison to non-much emotionally intense trailers. • Release of movie trailer has a positive effect on the stock value of the movie. • Higher the emotional appeal of trailer, higher is the impact on stock value. • SVM performs better if its parameter tuning is done. [ABSTRACT FROM AUTHOR]

Campus Management Systems (CMSs) are vital tools in managing educational institutions, handling tasks like student enrollment, scheduling, and resource allocation. The increasing adoption of CMS for online and mixed-learning environments highlights their importance. However, inherent limitations in conventional CMS platforms hinder personalized student guidance and effective identification of academic challenges. Addressing this crucial gap, our study introduces an AI Student Success Predictor empowered by advanced machine learning algorithms, capable of automating grading processes, predicting student risks, and forecasting retention or dropout outcomes. Central to our approach is the creation of a standardized dataset, meticulously curated by integrating student information from diverse relational databases. A Convolutional Neural Network (CNN) feature learning block is developed the extract the hidden patterns in the student data. This classification model stands as an ensemble masterpiece, incorporating SVM, Random Forest, and KNN classifiers, subsequently refined by a Bayesian averaging model. The proposed ensemble model shows the ability to predict the student grades, retention, and risk levels of dropout. The accuracy achieved by the proposed model is assessed using test data, culminating in a commendable 93% accuracy for student grade prediction and student risk prediction, and a solid 92% accuracy for the complex domain of retention and dropout forecasting. The proposed AI system seamlessly integrates with existing CMS infrastructure, enabling real-time data retrieval and swift, accurate predictions, enhancing academic decision-making efficiency. Our study's pioneering AI Student Success Predictor bridges the chasm between traditional CMS limitations and the growing demands of modern education. • Revolutionizing CMSs with advanced ML for grading, risk identification, and retention forecasting. • Introducing novel methods i.e., dataset curation, CNN features, and ensemble classification for enhanced predictive accuracy. • Seamlessly integrating AI Student Success Predictor into existing CMS infrastructures for real-time predictive insights. • Achieving commendable accuracy rates for grade prediction, risk assessment, and retention forecasting. [ABSTRACT FROM AUTHOR]