MIT-World Peace University (MIT-WPU) is a top educational institute located in Pune, India. It is recognized within&nbsp;UGC under Government of Maharashtra Act No. XXXV 2017.&nbsp;

It is part of the MIT group of institutions (established in 1983) which covers 10+ campuses across India and has more than 50,000+ students enrolled across various disciplines at a given point of time. The institute houses 15 schools ranging from Engineering &amp; Technology, Design, Pharmacy, Commerce, Governance among others. It offers undergraduate, postgraduate and PhD programs among different disciplines.&nbsp;

&nbsp;

MIT World Peace University

World University root node

School of Computer Engineering & Technology

Engineering and Technology

International Journal of Computer Science and Mobile Computing

Detecting Hate Speech and Offensive Language on Twitter using Machine Learning

Recent statistics show that malware attacks have been increased by over 97% in the past two years. Among these, a large portion is due to Ransomware, a subset of malware. Ransomware codes are easily available as Ransomware as-a-service (RaaS). Because of it, there is a significant threat to the world, as this is a malware which generates high revenues and is creating a viable criminal business model. Because of this the systems of private companies, individuals, or public service providers are at stake and can suffer a severe disruption and financial loss. There are two methods for the detection and analysis to be done for the detection of ransomware. One is the Static detection approach and the other is the Dynamic detection approach. We have done the detection using the Dynamic approach. This paper focuses on detection of ransomware and benign applications using machine learning algorithms for dynamic detection of ransomware. Our experimentation results show that high accuracy is obtained using the KNN algorithm.

International Advanced Computing Conference

Detection of Ransomware on Windows System Using Machine Learning Technique: Experimental Results

Proceeding of International Conference on Computational Science and Applications

Detection of Ransomware Attack: A Review

arXiv preprint arXiv:1809.08651

Detecting hate speech and offensive language on twitter using machine learning: An n-gram and tfidf based approach

A major problem in Wireless Mesh Network is capacity decrease due to wireless interference. A wireless mesh router with multiple routers and channels is capable of reducing network interference. Static channel allocation and dynamic channel allocation are types of channel allocation. Adaptive Dynamic Channel Allocation protocol (ADCA) is dynamic channel allocation protocol which decreases the packet delay without degrading the network throughput. The hybrid architecture shows much preferred adaptivity to changing traffic over absolutely static scheme without increasing in overhead and attains to lower delay than existing methodologies for hybrid networks. In addition, we have used an Interference and Congestion Aware Routing protocol (ICAR) in the hybrid network which achieves load balancing in the channel usage. Our simulation results show that compared to previous works, ADCA reduces the packet delay considerably without degrading the network throughput. Current hybrid implementation utilizes multiple static interfaces but only single dynamic interface. In this paper, we have implemented a novel scheme which utilized two dynamic interfaces along with two static interfaces so the performance of existing system has boosted. Our system have attain higher throughput and lessen the packet delay than existing system. We have compared our system performance with existing static and hybrid systems.

2015 Twelfth International Conference on Wireless and Optical Communications Networks (WOCN)

Evaluation of metrics in hybrid multichannel multiradio wireless mesh networks for multiple dynamic channel interfaces

Routing in Wireless Mesh Algorithm is concerned with finding good source destination paths and has been an active research area since many years. Much of the work is focused on the improvement of global resources, or on the performance of individual transfers. Either case, the routing problem can be casted as a multi-objective with objectives such as load-balancing, end-to-end delay and path capacity. But if real-time applications are needed then the bounded end-to-end delay as an QoS parameter can be used. This can be found by the Mesh routing Algorithm (MRA). But there is also a need to find the effect of changing the link capacity(rate of link) and the effect of changing inter-arrival time between two packets for these capacity values. This paper does the analysis of the MRA algorithm to see the effect of changing these parameters and find the PDR(Packet Delivery Ratio) and bounded end-to-end delay. Through extensive simulation we have observed that the PDR of a network changes as the link capacity and the inter-arrival time between the packets and also between two nodes changes. {\textcopyright} 2011 IEEE.

2011 Eighth International Conference on Wireless and Optical Communications Networks

Performance analysis of Mesh routing Algorithm for routing metrics link capacity and delay against inter-arrival time dependencies