• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5
  • 4
  • 3
  • 1
  • Tagged with
  • 92
  • 92
  • 92
  • 34
  • 24
  • 24
  • 23
  • 23
  • 20
  • 17
  • 17
  • 17
  • 15
  • 15
  • 14
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
71

SOLVING PREDICTION PROBLEMS FROM TEMPORAL EVENT DATA ON NETWORKS

Hao Sha (11048391) 06 August 2021 (has links)
<div><div><div><p>Many complex processes can be viewed as sequential events on a network. In this thesis, we study the interplay between a network and the event sequences on it. We first focus on predicting events on a known network. Examples of such include: modeling retweet cascades, forecasting earthquakes, and tracing the source of a pandemic. In specific, given the network structure, we solve two types of problems - (1) forecasting future events based on the historical events, and (2) identifying the initial event(s) based on some later observations of the dynamics. The inverse problem of inferring the unknown network topology or links, based on the events, is also of great important. Examples along this line include: constructing influence networks among Twitter users from their tweets, soliciting new members to join an event based on their participation history, and recommending positions for job seekers according to their work experience. Following this direction, we study two types of problems - (1) recovering influence networks, and (2) predicting links between a node and a group of nodes, from event sequences.</p></div></div></div>
72

EXPLORING ECOSYSTEMS IN INDIANA’S EDUCATION AND WORKFORCE DEVELOPMENT USING A DATA VISUALIZATION DASHBOARD

Yash S Gugale (8800853) 05 May 2020 (has links)
<div>Large datasets related to Indiana’s Education and Workforce development are used by various demographics such as stakeholders and decision makers in education and government, parents, teachers and employees of various companies to find trends and patterns in the data to better guide decision-making through statistical analysis. However, most of this data is scattered, textual and available in the form of excel sheets which makes it harder to look at the data from different perspectives, drill down and roll up the data and find trends and patterns in the data. Such data representation does not take into account the inherent characteristics of the user which can affect how well the user understands, perceives and interprets the data.</div><div>Information dashboards used to view and navigate between visualizations of different datasets, provide a coherent, central access to all data, and make it easy to view different aspects of the system. The purpose of this research is to create a new data visualization dashboard for visualizing education and workforce data and find which design principles are applicable while designing such a dashboard for the target demographic in the education and workforce domain. This study also aims at assessing how the introduction of such a data dashboard affects the work processes and decision making of stakeholders involved in education and workforce development in the state of Indiana.</div><div>User studies consisting of usability testing and semi-structured interviews with the stakeholders in education and workforce development in the state of Indiana is conducted to test the effectiveness of the dashboard. Finally, this research proposes how a regional map-based dashboard can be used as an effective method to design a data dashboard for education and workforce data for other states and other domains as well.</div>
73

INTERNET OF THINGS SYSTEMS SECURITY: BENCHMARKING AND PROTECTION

Naif S Almakhdhub (8810120) 07 May 2020 (has links)
<div><p>Internet of Things (IoT) systems running on Microcontrollers (MCUS) have become a prominent target of remote attacks. Although deployed in security and safety critical domains, such systems lack basic mitigations against control-flow hijacking attacks. Attacks against IoT systems already enabled malicious takeover of smartphones, vehicles, unmanned aerial vehicles, and industrial control systems.</p></div><div><p> </p><div><p>The thesis introduces a systemic analysis of previous defense mitigations to secure IoT systems. Building off this systematization, we identify two main issues in IoT systems security. First, efforts to protect IoT systems are hindered by the lack of realistic benchmarks and evaluation frameworks. Second, existing solutions to protect from control-flow hijacking on the return edge are either impractical or have limited security guarantees. This thesis addresses these issues using two approaches. </p></div><div><p> </p></div><div><p>First, we present BenchIoT, a benchmark suite of five realistic IoT applications and an evaluation framework that enables automated and extensible evaluation of 14 metrics covering security, performance, memory usage, and energy. BenchIoT enables evaluating and comparing security mechanisms. Using BenchIoT, we show that even if two security mechanisms have similarly modest runtime overhead, one can have undesired consequences on security such as a large portion of privileged user execution.</p></div><div><p> </p></div><div><p>Second, we introduce Return Address Integrity (RAI), a novel security mechanism to prevent all control-flow hijacking attacks targeting return edges, without requiring special hardware. We design and implement μRAI to enforce the RAI property. Our results show μRAI has a low runtime overhead of 0.1% on average, and therefore is a</p></div><div><p>practical solution for IoT systems. </p></div><div><p> </p></div><div><p>This thesis enables measuring the security IoT systems through standardized benchmarks and metrics. Using static analysis and runtime monitors, it prevents control-flow hijacking attacks on return edges with low runtime overhead. Combined, this thesis advances the state-of-the-art of protecting IoT systems and benchmarking its security.</p></div></div>
74

FLEXPOOL: A DISTRIBUTED MODEL-FREE DEEP REINFORCEMENT LEARNING ALGORITHM FOR JOINT PASSENGERS & GOODS TRANSPORTATION

Kaushik Bharadwaj Manchella (9706697) 15 December 2020 (has links)
<div>The growth in online goods delivery is causing a dramatic surge in urban vehicle traffic from last-mile deliveries. On the other hand, ride-sharing has been on the rise with the success of ride-sharing platforms and increased research on using autonomous vehicle technologies for routing and matching. The future of urban mobility for passengers and goods relies on leveraging new methods that minimize operational costs and environmental footprints of transportation systems. </div><div><br></div><div>This paper considers combining passenger transportation with goods delivery to improve vehicle-based transportation. Even though the problem has been studied with model-based approaches where the dynamic model of the transportation system environment is defined, model-free approaches where the dynamics of the environment are learned by interaction have been demonstrated to be adaptable to new or erratic environment dynamics. </div><div><br></div><div>FlexPool is a distributed model-free deep reinforcement learning algorithm that jointly serves passengers \& goods workloads by learning optimal dispatch policies from its interaction with the environment. The model-free algorithm (as opposed to a model-based one) is an algorithm which does not use the transition probability distribution (and the reward function) associated with the Markov decision process (MDP).</div><div> The proposed algorithm pools passengers for a ride-sharing service and delivers goods using a multi-hop routing method. These flexibilities decrease the fleet's operational cost and environmental footprint while maintaining service levels for passengers and goods. The dispatching algorithm based on deep reinforcement learning is integrated with an efficient matching algorithm for passengers and goods. Through simulations on a realistic urban mobility platform, we demonstrate that FlexPool outperforms other model-free settings in serving the demands from passengers \& goods. FlexPool achieves 30\% higher fleet utilization and 35\% higher fuel efficiency in comparison to (i) model-free approaches where vehicles transport a combination of passengers \& goods without the use of multi-hop transit, and (ii) model-free approaches where vehicles exclusively transport either passengers or goods. </div>
75

HIGHER ORDER OPTIMIZATION TECHNIQUES FOR MACHINE LEARNING

Sudhir B. Kylasa (5929916) 09 December 2019 (has links)
<div> <div> <div> <p>First-order methods such as Stochastic Gradient Descent are methods of choice for solving non-convex optimization problems in machine learning. These methods primarily rely on the gradient of the loss function to estimate descent direction. However, they have a number of drawbacks, including converging to saddle points (as opposed to minima), slow convergence, and sensitivity to parameter tuning. In contrast, second order methods that use curvature information in addition to the gradient, have been shown to achieve faster convergence rates, theoretically. When used in the context of machine learning applications, they offer faster (quadratic) convergence, stability to parameter tuning, and robustness to problem conditioning. In spite of these advantages, first order methods are commonly used because of their simplicity of implementation and low per-iteration cost. The need to generate and use curvature information in the form of a dense Hessian matrix makes each iteration of second order methods more expensive. </p><p><br></p> <p>In this work, we address three key problems associated with second order methods – (i) what is the best way to incorporate curvature information into the optimization procedure; (ii) how do we reduce the operation count of each iteration in a second order method, while maintaining its superior convergence property; and (iii) how do we leverage high-performance computing platforms to significant accelerate second order methods. To answer the first question, we propose and validate the use of Fisher information matrices in second order methods to significantly accelerate convergence. The second question is answered through the use of statistical sampling techniques that suitably sample matrices to reduce per-iteration cost without impacting convergence. The third question is addressed through the use of graphics processing units (GPUs) in distributed platforms to deliver state of the art solvers.</p></div></div></div><div><div><div> <p>Through our work, we show that our solvers are capable of significant improvement over state of the art optimization techniques for training machine learning models. We demonstrate improvements in terms of training time (over an order of magnitude in wall-clock time), generalization properties of learned models, and robustness to problem conditioning. </p> </div> </div> </div>
76

Anomaly Detection and Security Deep Learning Methods Under Adversarial Situation

Miguel Villarreal-Vasquez (9034049) 27 June 2020 (has links)
<p>Advances in Artificial Intelligence (AI), or more precisely on Neural Networks (NNs), and fast processing technologies (e.g. Graphic Processing Units or GPUs) in recent years have positioned NNs as one of the main machine learning algorithms used to solved a diversity of problems in both academia and the industry. While they have been proved to be effective in solving many tasks, the lack of security guarantees and understanding of their internal processing disrupts their wide adoption in general and cybersecurity-related applications. In this dissertation, we present the findings of a comprehensive study aimed to enable the absorption of state-of-the-art NN algorithms in the development of enterprise solutions. Specifically, this dissertation focuses on (1) the development of defensive mechanisms to protect NNs against adversarial attacks and (2) application of NN models for anomaly detection in enterprise networks.</p><p>In this state of affairs, this work makes the following contributions. First, we performed a thorough study of the different adversarial attacks against NNs. We concentrate on the attacks referred to as trojan attacks and introduce a novel model hardening method that removes any trojan (i.e. misbehavior) inserted to the NN models at training time. We carefully evaluate our method and establish the correct metrics to test the efficiency of defensive methods against these types of attacks: (1) accuracy with benign data, (2) attack success rate, and (3) accuracy with adversarial data. Prior work evaluates their solutions using the first two metrics only, which do not suffice to guarantee robustness against untargeted attacks. Our method is compared with the state-of-the-art. The obtained results show our method outperforms it. Second, we proposed a novel approach to detect anomalies using LSTM-based models. Our method analyzes at runtime the event sequences generated by the Endpoint Detection and Response (EDR) system of a renowned security company running and efficiently detects uncommon patterns. The new detecting method is compared with the EDR system. The results show that our method achieves a higher detection rate. Finally, we present a Moving Target Defense technique that smartly reacts upon the detection of anomalies so as to also mitigate the detected attacks. The technique efficiently replaces the entire stack of virtual nodes, making ongoing attacks in the system ineffective.</p><p> </p>
77

Community Detection of Anomaly in Large-Scale Network Dissertation - Adefolarin Bolaji .pdf

Adefolarin Alaba Bolaji (10723926) 29 April 2021 (has links)
<p>The detection of anomalies in real-world networks is applicable in different domains; the application includes, but is not limited to, credit card fraud detection, malware identification and classification, cancer detection from diagnostic reports, abnormal traffic detection, identification of fake media posts, and the like. Many ongoing and current researches are providing tools for analyzing labeled and unlabeled data; however, the challenges of finding anomalies and patterns in large-scale datasets still exist because of rapid changes in the threat landscape. </p><p>In this study, I implemented a novel and robust solution that combines data science and cybersecurity to solve complex network security problems. I used Long Short-Term Memory (LSTM) model, Louvain algorithm, and PageRank algorithm to identify and group anomalies in large-scale real-world networks. The network has billions of packets. The developed model used different visualization techniques to provide further insight into how the anomalies in the network are related. </p><p>Mean absolute error (MAE) and root mean square error (RMSE) was used to validate the anomaly detection models, the results obtained for both are 5.1813e-04 and 1e-03 respectively. The low loss from the training phase confirmed the low RMSE at loss: 5.1812e-04, mean absolute error: 5.1813e-04, validation loss: 3.9858e-04, validation mean absolute error: 3.9858e-04. The result from the community detection shows an overall modularity value of 0.914 which is proof of the existence of very strong communities among the anomalies. The largest sub-community of the anomalies connects 10.42% of the total nodes of the anomalies. </p><p>The broader aim and impact of this study was to provide sophisticated, AI-assisted countermeasures to cyber-threats in large-scale networks. To close the existing gaps created by the shortage of skilled and experienced cybersecurity specialists and analysts in the cybersecurity field, solutions based on out-of-the-box thinking are inevitable; this research was aimed at yielding one of such solutions. It was built to detect specific and collaborating threat actors in large networks and to help speed up how the activities of anomalies in any given large-scale network can be curtailed in time.</p><div><div><div> </div> </div> </div> <br>
78

UAV DETECTION AND LOCALIZATION SYSTEM USING AN INTERCONNECTED ARRAY OF ACOUSTIC SENSORS AND MACHINE LEARNING ALGORITHMS

Facundo Ramiro Esquivel Fagiani (10716747) 06 May 2021 (has links)
<div> The Unmanned Aerial Vehicles (UAV) technology has evolved exponentially in recent years. Smaller and less expensive devices allow a world of new applications in different areas, but as this progress can be beneficial, the use of UAVs with malicious intentions also poses a threat. UAVs can carry weapons or explosives and access restricted zones passing undetected, representing a real threat for civilians and institutions. Acoustic detection in combination with machine learning models emerges as a viable solution since, despite its limitations related with environmental noise, it has provided promising results on classifying UAV sounds, it is adaptable to multiple environments, and especially, it can be a cost-effective solution, something much needed in the counter UAV market with high projections for the coming years. The problem addressed by this project is the need for a real-world adaptable solution which can show that an array of acoustic sensors can be implemented for the detection and localization of UAVs with minimal cost and competitive performance.<br><br></div><div> In this research, a low-cost acoustic detection system that can detect, in real time, about the presence and direction of arrival of a UAV approaching a target was engineered and validated. The model developed includes an array of acoustic sensors remotely connected to a central server, which uses the sound signals to estimate the direction of arrival of the UAV. This model works with a single microphone per node which calculates the position based on the acoustic intensity change produced by the UAV, reducing the implementation costs and being able to work asynchronously. The development of the project included collecting data from UAVs flying both indoors and outdoors, and a performance analysis under realistic conditions. <br><br></div><div> The results demonstrated that the solution provides real time UAV detection and localization information to protect a target from an attacking UAV, and that it can be applied in real world scenarios. </div><div><br></div>
79

Evaluation of Archetypal Analysis and Manifold Learning for Phenotyping of Acute Kidney Injury

Dylan M Rodriquez (10695618) 07 May 2021 (has links)
Disease subtyping has been a critical aim of precision and personalized medicine. With the potential to improve patient outcomes, unsupervised and semi-supervised methods for determining phenotypes of subtypes have emerged with a recent focus on matrix and tensor factorization. However, interpretability of proposed models is debatable. Principal component analysis (PCA), a traditional method of dimensionality reduction, does not impose non-negativity constraints. Thus coefficients of the principal components are, in cases, difficult to translate to real physical units. Non-negative matrix factorization (NMF) constrains the factorization to positive numbers such that representative types resulting from the factorization are additive. Archetypal analysis (AA) extends this idea and seeks to identify pure types, archetypes, at the extremes of the data from which all other data can be expressed as a convex combination, or by proportion, of the archetypes. Using AA, this study sought to evaluate the sufficiency of AKI staging criteria through unsupervised subtyping. Archetype analysis failed to find a direct 1:1 mapping of archetypes to physician staging and also did not provide additional insight into patient outcomes. Several factors of the analysis such as quality of the data source and the difficulty in selecting features contributed to the outcome. Additionally, after performing feature selection with lasso across data subsets, it was determined that current staging criteria is sufficient to determine patient phenotype with serum creatinine at time of diagnosis to be a necessary factor.
80

Emprego de computadores em elucidação estrutural de alcalóides / Use of computers in structural elucidation of alkaloids

Rufino, Alessandra Rodrigues 12 May 2005 (has links)
O Sistema Especialista SISTEMAT foi construído com o objetivo de auxiliar os pesquisadores da área de produtos naturais na tarefa de determinação estrutural, estendendo-se também ao químico orgânico sintético. Seus programas aplicativos fornecem propostas de esqueletos fazendo uso dos dados de diversas técnicas espectrométricas, sendo que a espectrometria de ressonância magnética nuclear de 13C tem um papel de destaque entre as demais. Este trabalho descreve a utilização do SISTEMAT como uma ferramenta auxiliar na determinação estrutural de substâncias pertencentes às subclasses dos alcalóides quinolínicos, quinolizidínicos, aporfínicos, benzilisoquinolínicos, isoquinolínicos, pirrolizidínicos, acridônicos e indólicos. Para a realização deste trabalho foi construído um banco de dados contendo 1182 alcalóides, sendo todos coletados da literatura. Nestes 1182 alcalóides, estão presentes 1156 espectros de RMN 13C, 354 espectros de RMN 1H, 320 espectros de massas e as substâncias de origem vegetal estão distribuídos em 49 Famílias, 164 Gêneros e 260 Espécies. Os testes realizados forneceram bons percentuais de acertos para o reconhecimento de esqueletos. Outro programa utilizado neste trabalho foi o de redes neurais artificiais. As redes foram treinadas para auxiliar na determinação estrutural dos alcalóides aporfínicos, fornecendo a probabilidade de uma determinada substância pertencer ao esqueleto pesquisado. Para utilização das redes neurais foi construída uma planilha com os deslocamentos químicos de RMN 13C, de 165 alcalóides aporfínicos, pertencentes a 12 esqueletos diferentes. A rede forneceu ótimos resultados, classificando os esqueletos com alto grau de confiabilidade. / The Expert System SISTEMAT was built with the objective of aiding the researchers of the area of natural products in the task of structural determination, also extending to the synthetic organic chemist. Their applications programs supply proposed of skeletons making use of the data of several techniques spectrometrics, and the 13C NMR has a main paper among the others. This work describes the use of SISTEMAT as an auxiliary tool in the structural determination of substances belonging to the underclass of the alkaloids quinoline, quinolizidine, aporphine, benzylisoquinoline, isoquinoline, pyrrolizidine, acridone and indoles. For the accomplishment of this work a database was built containing 1182 alkaloids, being all collected of the literature. In these 1182 alkaloids, are present 1156 spectra of 13C NMR, 354 spectra of RMN 1:00, 320 spectra of masses and the substances of botanical origin are distributed in 49 Families, 164 Genders and 260 Species. They were accomplished around 100 tests, of which 30 are presented in this thesis. These tests supplied good percentile of the successes for the recognition of skeletons. Another program used in this work the one of nets artificial neurais, in which the nets were trained to aid in the structural determination of the aporphine alkaloids was, supplying the probability of a certain substance to belong to the researched skeleton. For use of the nets neurais a spreadsheet was built with the chemical displacements of 13C NMR, of 165 aporphine alkaloids, belonging to 12 different skeletons. The net supplied great results, classifying the skeletons with high reliability degree.

Page generated in 0.2508 seconds