Computer Engineering Commons^™

Leveraging Writing And Photography Styles For Drug Trafficker Identification In Darknet Markets, Wei Song

Graduate Theses, Dissertations, and Problem Reports

Due to its anonymity, there has been a dramatic growth of underground drug markets hosted in the darknet (e.g., Dream Market and Valhalla). To combat drug trafficking (a.k.a. illicit drug trading) in the cyberspace, there is an urgent need for automatic analysis of participants in darknet markets. However, one of the key challenges is that drug traffickers (i.e., vendors) may maintain multiple accounts across different markets or within the same market.

To address this issue, in this thesis, we propose and develop an intelligent system named uStyle-uID leveraging both writing and photography styles for drug trafficker identification at the first …

Roadnet: Robust Adaptive Network For Information Diffusion In Vanet, Priyashraba Misra

Graduate Theses, Dissertations, and Problem Reports

The automotive industry has changed more in the last one decade than ever before. Rapid advancements in autonomous driving have opened up opportunities for CAVs (Connected and Automated Vehicles). Vehicles today rely on a sensor-suite to map the surrounding and use that information for safety and navigation. The sensor's view is limited to its line of sight and this drawback can be tapered off by using Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I), generally referred to as Vehicle to Everything (V2X) communication. In this thesis, we specifically focus on utilizing V2V communication using on-board Dedicated Short Range Communication …

An Empirical Analysis Of An Algorithm For The Budgeted Maximum Vertex Cover Problem In Trees, Mujidat Abisola Adeyemo

Graduate Theses, Dissertations, and Problem Reports

Covering problems are commonly studied in fields such as mathematics, computer science, and engineering. They are also applicable in the real world, e.g., given a city, can we build base-stations such that there is network availability everywhere in the city. However, in the real world, there are usually constraints such as cost and resources. The Budgeted Maximum Vertex Cover is a generalization of covering problems. It models situations with constraints. In this thesis, we empirically analyze an algorithm for the problem of finding the Budgeted Maximum Vertex Cover in undirected trees (BMVCT). The BMVCT problem is defined as follows: Given …