Search Constraints

Start Over
Filtering by: Creator Schlax, M. G. Remove constraint Creator: Schlax, M. G. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

    Creator:
    Dodge, Jonathan E.
    Abstract:
    Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . 159 F Log Appendix - Computing a target tensor with CNN Agent . . . . . . . . 162 G How to

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    Methods for Reinforcement Learning. Abstract approved: Thomas G Dietterich The thesis focuses on model

  • Improving automated email tagging with implicit feedback

    Creator:
    Sorower, Mohammad Shahed
    Abstract:
    Machine learning systems are generally trained offline using ground truth data that has been labeled by experts. However, these batch training methods are not a good fit for many applications, especially in the cases where complete ground truth data is not available for offline training. In addition, batch methods do...
    Resource Type:
    Dissertation
    Full Text:
    : Improving Automated Email Tagging with Implicit Feedback Abstract approved: Thomas G. Dietterich Machine

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    , 2008. Title: Learning MDP Action Models via Discrete Mixture Trees Abstract approved: Thomas G

  • Shrunken learning rates do not improve AdaBoost on benchmark datasets

    Creator:
    Forrest, Daniel L. K.
    Abstract:
    Recent work has shown that AdaBoost can be viewed as an algorithm that maximizes the margin on the training data via functional gradient descent. Under this interpretation, the weight computed by AdaBoost, for each hypothesis generated, can be viewed as a step size parameter in a gradient descent search. Friedman...
    Resource Type:
    Masters Thesis
    Full Text:
    Learning Rates Do Not Improve AdaBoost On Benchmark Datasets. Abstract approved: Thomas G. Dietterich

  • Simulator-Defined MDP Planning with Applications in Natural Resource Management

    Creator:
    Alkaee Taleghan, Majid
    Abstract:
    This work is inspired by problems in natural resource management centered on the challenge of invasive species. Computing optimal management policies for maintaining ecosystem sustainable is challenging. Many ecosystem management problems can be formulated as MDP (Markov Decision Process) planning problems. In a simulator-defined MDP, the Markovian dynamics and rewards...
    Resource Type:
    Dissertation
    Full Text:
    G. Dietterich This work is inspired by problems in natural resource management centered on the

  • Image features and learning algorithms for biological, generic and social object recognition

    Creator:
    Zhang, Wei
    Abstract:
    Automated recognition of object categories in images is a critical step for many real-world computer vision applications. Interest region detectors and region descriptors have been widely employed to tackle the variability of objects in pose, scale, lighting, texture, color, and so on. Different types of object recognition problems usually require...
    Resource Type:
    Dissertation
    Full Text:
    : ______________________________________________________ Thomas G. Dietterich Automated recognition of object categories in images is a critical

  • Applying machine learning for prediction, recommendation, and integration

    Creator:
    Bao, Xinlong
    Abstract:
    This dissertation explores the idea of applying machine learning technologies to help computer users find information and better organize electronic resources, by presenting the research work conducted in the following three applications: FolderPredictor, Stacking Recommendation Engines, and Integrating Learning and Reasoning. FolderPredictor is an intelligent desktop software tool that helps...
    Resource Type:
    Dissertation
    Full Text:
    approved: Thomas G. Dietterich This dissertation explores the idea of applying machine learning

  • Reinforcement learning for job-shop scheduling

    Creator:
    Zhang, Wei, 1960-
    Resource Type:
    Dissertation
    Full Text:
    Learning for Job-Shop Scheduling Abstract approved: Thomas G. Dietterich This dissertation studies

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    i s i n g s t u d e n t s h e n p r o j e c t T a s k T r a c e r c o m m e n t s o n t h e s i

  • A Benchmarking Study of Unsupervised Anomaly Detection Algorithms

    Creator:
    Emmott, Andrew F.
    Abstract:
    It is common practice in the unsupervised anomaly detection literature to create experimental benchmarks by sampling from existing supervised learning datasets. We seek to improve this practice by identifying four dimensions important to real-world anomaly detection applications --- point difficulty, clusteredness of anomalies, relevance of features, and relative frequency of...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . 111 G Supplemental Tables for Chapter 7 . . . . . . . . . . . . . . . . . . . 116 LIST OF TABLES

  • Protein secondary structure prediction using conditional random fields and profiles

    Creator:
    Shen, Rongkun
    Abstract:
    Protein secondary structure prediction plays a pivotal role in predicting protein folding in three-dimensions. Its task is to assign each residue one of the three secondary structure classes helix, strand, or random coil. This is an instance of the problem of sequential supervised learning in machine learning. This thesis describes...
    Resource Type:
    Masters Thesis
    Full Text:
    Fields and Profiles Abstract approved: Thomas G. Dietterich

  • Correct abstraction in counter-planning : a knowledge compilation approach

    Creator:
    Flann, Nicholas S.
    Abstract:
    Knowledge compilation improves search-intensive problem-solvers that are easily specified but inefficient. One promising approach improves efficiency by constructing a database of problem-instance/best-action pairs that replace problem-solving search with efficient lookup. The database is constructed by reverse enumeration- expanding the complete search space backwards, from the terminal problem instances. This approach...
    Resource Type:
    Dissertation
    Full Text:
    : A Knowledge Compilation Approach Redacted for Privacy Abstract approved. Tom G. Dietterich

  • Machine learning methods for public policy : simulation, optimization, and visualization

    Creator:
    McGregor, Sean
    Abstract:
    Society faces many complex management problems, particularly in the area of shared public resources such as ecosystems. Existing decision making processes are often guided by personal experience and political ideology rather than state-of-the-art scientific understanding. This dissertation envisions a future in which multiple stakeholders are provided with computational tools for...
    Resource Type:
    Dissertation
    Full Text:
    Methods for Public Policy: Simulation, Optimization, and Visualization Abstract approved: Thomas G

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    : Techniques to Speed Up Numerical Optimization Redacted for Privacy Abstract approved. Thomas G. Dietterich

  • Evaluation functions in aerial image segmentation

    Creator:
    Langford, William T.
    Abstract:
    Remote sensing is the most practical way to acquire large amounts of land cover data for monitoring and understanding environmental change, so it is important to be able to map land cover from imagery. Maps defining land cover patches as polygons rather than pixels greatly improve processing efficiency in models...
    Resource Type:
    Dissertation
    Full Text:
    Abstract approved: Thomas G. Dietterich Warren Cohen Remote sensing is the most practical way to acquire

  • Auxiliary Tasks for Efficient Learning of Point-Goal Navigation

    Creator:
    Desai, Saurabh Satish
    Abstract:
    Top-performing approaches to embodied AI tasks like point-goal navigation often rely on training agents via reinforcement learning over tens of millions (or even billions) of experiential steps – learning neural agents that map directly from visual observations to actions. In this work, we question whether these extreme training durations are...
    Resource Type:
    Masters Thesis
    Full Text:
    for Efficient Learning of Point-Goal Navigation Abstract approved: Stefan M. Lee Top-performing

  • Learning greedy policies for the easy-first framework

    Creator:
    Xie, Jun
    Abstract:
    Easy-first, a search-based structured prediction approach, has been applied to many NLP tasks including dependency parsing and coreference resolution. This approach employs a learned greedy policy (action scoring function) to make easy decisions first, which constrains the remaining decisions and makes them easier. This thesis studies the problem of learning...
    Resource Type:
    Masters Thesis
    Full Text:
    my thesis committee: Prof. Thomas G. Dietterich and Prof. Prasad Tadepalli, for their encouragement

  • Heuristic search in symbolic probability inference

    Creator:
    Pan, Yonghong
    Abstract:
    I present a new heuristic search approach to compute approximate answers for the probability query in belief nets. This approach can compute the 'best' bounds for a query in a period of any given time (if time permitted, it will get an exact value). It inherits the essence of Symbolic...
    Resource Type:
    Capstone Project
    Full Text:
    , Professors Theodore G. Lewis and Prasad Tadepalli, for their assistance. Thanks to my friend Zhaoyu Li for

  • Interactive fault localization techniques to empower the debugging efforts of end-user programmers

    Creator:
    Ruthruff, Joseph Ronald
    Abstract:
    End users develop more software than any other group of programmers, using software authoring devices such as e-mail filtering editors, by-demonstration macro builders, and spreadsheet environments. Despite this, there has been only a little research on finding ways to help these programmers with the dependability of the software they create....
    Resource Type:
    Masters Thesis
    Full Text:
    : Margaret M. Burnett End users develop more software than any other group of programmers, using software

  • Software for configuration of a video server

    Creator:
    Venkataraman, Saumya
    Abstract:
    A video server is the multimedia equivalent of a data file server. As video goes digital video servers that support digital media are required for production and broadcasting in television companies. Grass Valley Group provides comprehensive digital video solutions through a range of video servers called Profiles. The Profile Media...
    Resource Type:
    Capstone Project
    Full Text:
    !der MPEG Player M PEG Pia er/Recorder Video Quality: Jor~ (4 Mb/s) I i I J Video 0utput

  • Inclusive Software Design and Its Methods for Beyond-WIMP User Interfaces

    Creator:
    Fallatah, Abrar
    Abstract:
    While digital inclusivity researchers and software practitioners have been trying to address exclusion biases in Windows, Icons, Menus, and Pointers (WIMP) user interfaces (UIs) for a long time, little has been done to investigate if and how inclusive software design and its methods that have been devised for WIMP UIs...
    Resource Type:
    Dissertation

  • Monte Carlo Tree Search with Fixed and Adaptive Abstractions

    Creator:
    Hostetler, Jesse A.
    Abstract:
    Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
    Resource Type:
    Dissertation
    Full Text:
    Carlo Tree Search with Fixed and Adaptive Abstractions Abstract approved: Thomas G. Dietterich Alan P

  • Learning and Improving Policies for Probabilistic Planning Problems

    Creator:
    Issakkimuthu, Murugeswari
    Abstract:
    In this work, we study the problem of learning and improving policies for probabilistic planning problems. In the first part, we train neural network policies for probabilistic planning problems modeled as factored Markov decision problems. The objective is to train problem-specific neural networks via supervised learning to imitate the action...
    Resource Type:
    Dissertation
    Full Text:
    . The output layer ZL = {zL0 , zL1 , zL2 , . . . , zLm} contains m + 1 nodes, where zL1 , . . . , zLm

  • A collaborative filtering algorithm and evaluation metric that accurately model the user experience

    Creator:
    McLaughlin, Matthew
    Abstract:
    "Collaborative filtering algorithms’ performances have been evaluated using a variety of metrics. These metrics, such as Mean Absolute Error and Precision, have often ignored recommendations for which they do not have data. Ignoring these recommendations has provided numbers which do not accurately represent the user experience. Qualitatively we have seen...
    Resource Type:
    Capstone Project
    Full Text:
    . ACM Press, New York. (pp. 175-186). 7. Sarwar, B. M., Karypis, G., Konstan, J. A., Riedl, J

  • WebGD : Framework for web-based GIS/database applications

    Creator:
    Wangmutitakul, Paphun
    Abstract:
    We have developed a framework for Web-based GIS/database applications which allow users to insert, update, delete, and query data with a map interface displayed by Web browsers. The framework was designed so that a Web-based GIS application that uses ArcIMS as a map server can be easily created, customized, and...
    Resource Type:
    Capstone Project
    Full Text:
    : M:lp Tool bar c Ql a. 0 :i: v A 1.2: SubnitForm()➔ rrap: Frame 1-----t_~Oil_:m _L:~F

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Jeffrey M. Young for

  • Physical activity recognition of free-living data using change-point detection algorithms and hidden Markov models

    Creator:
    Anderson, Michael M.
    Abstract:
    Physical activity recognition using accelerometer data is a rapidly emerging field with many real-world applications. Much of the previous work in this area has assumed that the accelerometer data has already been segmented into pure activities, and the activity recognition task has been to classify these segments. In reality, activity...
    Resource Type:
    Masters Thesis
    Full Text:
    Change-Point Detection Algorithms and Hidden Markov Models AN ABSTRACT OF THE THESIS OF Michael M

  • Anomaly Detection: Theory, Explanation and User Feedback

    Creator:
    Siddiqui, Md Amran
    Abstract:
    Anomaly detection has been used in variety of applications in practice, including cyber-security, fraud detection and detecting faults in safety critical systems, etc. Anomaly detectors produce a ranked list of statistical anomalies, which are typically examined by human analysts in order to extract the actual anomalies of interest. Unfortunately, most...
    Resource Type:
    Dissertation

  • New learning modes for sequential decision making

    Creator:
    Judah, Kshitij
    Abstract:
    This thesis considers the problem in which a teacher is interested in teaching action policies to computer agents for sequential decision making. The vast majority of policy learning algorithms o er teachers little flexibility in how policies are taught. In particular, one of two learning modes is typically considered: 1)...
    Resource Type:
    Dissertation
    Full Text:
    a critique data set: C = { (s1, c + 1 , c − 1 ), ..., (sM , c + M , c − M ) } , where si is a

  • Learning ranking functions for efficient search

    Creator:
    Xu, Yuehua
    Abstract:
    This dissertation explores algorithms for learning ranking functions to efficiently solve search problems, with application to automated planning. Specifically, we consider the frameworks of beam search, greedy search, and randomized search, which all aim to maintain tractability at the cost of not guaranteeing completeness nor optimality. Our learning objective for...
    Resource Type:
    Dissertation
    Full Text:
    nodes to m-dimensional real-valued vectors, and < is a total preference ordering on search nodes. We

  • Sliding-mode control of the super maneuverable aircraft

    Creator:
    Koo, Chang Sul
    Abstract:
    In this thesis, A nonlinear methodology for the control of the highly maneuverable, high performance aircraft HARV (F-18) is studied by using sliding-mode control (SMC). This control law, which takes a continuous function when the input constraints are not considered, satisfies the reachability condition by which concerned states are driven...
    Resource Type:
    Dissertation
    Full Text:
    {>0 for si <0 = 4F(x,t)+G(x,t)u) i= 1, ,m (2.5.1) ' ax <0 for si> 0 Let g, be the i-th column

  • High-speed implementation of the RSA cryptosystem

    Creator:
    Peng, Yanqun
    Abstract:
    A public key cryptosystem allows two or more parties to securely communicate over an insecure channel without establishing a physically secure channel for key exchange. The RSA cryptosystem is the most popular public key cryptosystem ever invented. It is based on the difficulty of factoring large composite numbers. Once the...
    Resource Type:
    Masters Thesis
    Full Text:
    for modular exponentiation are presented, including the binary method and the m-ary method. We give a

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    or k B ea m 1 0 C h a rt P a rs in g Figure 2.3: Runtime plot of decoding the discourse

  • Nanoparticle-assisted diffusion brazing of metal microchannel arrays : nanoparticle synthesis, deposition, and characterization

    Creator:
    Eluri, Ravindranadh T.
    Abstract:
    Microchannel process technology (MPT) offers several advantages to the field of nanomanufacturing: 1) improved process control over very short time intervals owing to shorter diffusional distances; and 2) reduced reactor size due to high surface area to volume ratios and enhanced heat and mass transfer. The objective of this thesis...
    Resource Type:
    Dissertation
    Full Text:
    approximately 7 µm. Further suppression of the brazing temperature to 500ºC was achieved by sputtering a 1 !m

  • Separabilities for a new class of gray codes

    Creator:
    Park, Jung Pil
    Resource Type:
    Capstone Project
    Full Text:
    Gray codewords g(i) and g(j); if DH(g(i),g(j)) = m, m ~ 1, then Ii - j I > 2; and Ii - j I < 2n - 2

  • Advancing Power Grid Computing: Analysis and Synthesis of Wide-Area Data, Distributed Real-Time Hardware-In-the-Loop Simulations, and Machine Learning for Event Detection

    Creator:
    Hagan, Travis
    Abstract:
    Global Positioning Systems have allowed for precise timing of power system measurements over wide areas. This newly found capability has the potential to provide much greater insight into the operation of the power system and its response to contingencies, but few analytical techniques currently exist that provide enough robustness and...
    Resource Type:
    Dissertation
    Full Text:
    ?%''"*3(#'3"#-*09' &,)'"#(%')'*+#+%'"):M!(#3-G'%'*+ &,)'"#(%')'*+# %'#(9+'3-*3-G'%'*+)$3'#3('+$+!'3-G

  • Update programming -- a safe approach to software maintenance

    Creator:
    Ren, Deling
    Abstract:
    Software maintenance accounts for a large portion of the software development cost, particularly the process of updating programs either to adapt for requirement change or to enhance design or efficiency. Currently, program updates are generally performed manually by programmers using text editors. This is an unreliable method because syntax and...
    Resource Type:
    Dissertation
    Full Text:
    $/9;(x581Z3NE/\ ]^7;(DE.()E.cZ*�M;*;3N$'&)()cZo;&D$UL�$'587,1@9�ob$/?/cZM;E<$�E<G@*i5jc|}�cZ*;9

  • Nonuniform Sampling Of Band-limited Functions

    Creator:
    Al-Hammali, Hussain Y.
    Abstract:
    In this thesis, we will study certain generalizations of the classical Shannon Sampling Theorem, which allows for the reconstruction of a pi-band-limited, square-integrable function from its samples on the integers. J. R. Higgins provided a generalization where the integers can be perturbed by less than 1/4, which includes nonuniform and...
    Resource Type:
    Dissertation
    Full Text:
    . It follows that Z ⇡ �⇡ h n (x)ei� ⇤ mxdx = D ei� ⇤ m(.), g n E = � mn . We define the

  • Seismic performance of a pile-supported container wharf structures in rockfill

    Creator:
    Kawamata, Yohsuke
    Abstract:
    Recently, the concept of performance based design has become popular for many types of structures, including port facilities under seismic loading. For the case of pile-supported wharves, the level of performance is generally estimated using the displacement capacity of the structure. Therefore, understanding soil-pile interaction is one of the most...
    Resource Type:
    Dissertation

  • ThreshKnot: Thresholded ProbKnot for Improved RNA Secondary Structure Prediction

    Creator:
    Zhang, Liang
    Abstract:
    RNA structure prediction is a challenging problem, especially with pseudoknots. Recently, there has been a shift from the classical minimum free energy-based methods (MFE) to partition function-based ones that assemble structures based on base-pairing probabilities. Two typical examples of the latter group are the popular maximum expected accuracy (MEA) method...
    Resource Type:
    Masters Thesis
    Full Text:
    . Kappel, W. Kladwang, A. Krokhotin, G. E. Łach, F. Major, T. H. Mann, M. Mag- nus, K. Pachulska-Wieczorek

  • Reinforcement learning-based off-equilibrium incentives to approximate the VCG mechanism

    Creator:
    Moissinac, Béatrice
    Abstract:
    Auctions are used to solve resource allocation problem between many agents and many items in real-world settings. Unfortunately, in most cases, it is possible for selfish agents to manipulate the system for their own interest at the expense of the social welfare. Such manipulation can be prevented using the Vickrey-Clarke-Groves...
    Resource Type:
    Masters Thesis
    Full Text:
    objective (G) is the sum of every night ’s utility given the attendance each night. G = |M |∑ m=1 xm.e

  • Adiabatic Markov Decision Process : convergence of value iteration algorithm

    Creator:
    Duong, Thai
    Abstract:
    Markov Decision Process (MDP) is a well-known framework for devising the optimal decision making strategies under uncertainty. Typically, the decision maker assumes a stationary environment which is characterized by a time-invariant transition probability matrix. However, in many real-world scenarios, this assumption is not justified, thus the optimal strategy might not...
    Resource Type:
    Masters Thesis
    Full Text:
    )) = g ∗ which is the optimal average reward [5]. Therefore, g ∗ ≤ Y M ∑∞ sp(v j)|ΔΦ j−1| +(vi+1(xi

  • Approximation Schemes in Planar Graphs

    Creator:
    Zheng, Baigong
    Abstract:
    There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...
    Resource Type:
    Dissertation
    Full Text:
    graphs runs in O(mn) time by combining the algorithms of King et al. [85] and Orlin [104], where m and n

  • Reaction Pathways of Oxo-Hydroxo Group 5 Clusters to Metal Oxide Thin Films

    Creator:
    Mansergh, Ryan H.
    Abstract:
    Oxo-hydroxo Group 5 metal clusters are an untapped resource to study and advance aqueous solution processing of metal oxide thin films. The tetramethylammonium (TMA) hexatantalate salt (TMA6[H2Ta6O19]) yields dense Ta2O5 films (~95% of the bulk ß-Ta2O5 density) with atomically smooth surfaces (<4 Å root mean square surface roughness). This same...
    Resource Type:
    Dissertation
    Full Text:
    . Technol. A Vacuum, Surfaces, Film. 2008, 26, 494. (19) Alers, G. B.; Fleming, R. M.; Wong, Y. H

  • Interpretable Machine Learning: Applications in Biology and Genomics

    Creator:
    Danaee, Padideh
    Abstract:
    Machine learning (ML) and deep learning (DL) models impact our daily lives with applications in natural language modeling, image analysis, healthcare, genomics, and bioinformatics. The exponential growth of biological sequence data necessitates accompanying advances in computational methods. Although deep learning is highly effective for detecting and classifying biological sequences, challenges...
    Resource Type:
    Dissertation
    Full Text:
    -branch multiloops for C:G and G:C closing base pairs. G. The length distribution for multiloop branches

  • A Study of Temporal Convolutional Neural Networks for Music Language Modeling as Applied to Automatic Music Transcription

    Creator:
    Meyn, Matthew
    Abstract:
    Automatic music transcription (AMT) is the task, given an acoustic representation of music, to recover a symbolic notation of the written notes expressed by the sound. Transcribing music with multiple notes sounding simultaneously is difficult for both humans and machines. Much existing work on AMT has focused on suitable acoustic...
    Resource Type:
    Capstone Project
    Full Text:
    requirement. For a kernel k of dimensions m by n, the kernel weights in every position that does not precede

  • Computational Approaches for RNA Structure Prediction with Dynamic Programming and Deep Neural Networks

    Creator:
    Deng, Dezhong
    Abstract:
    Our goal is to build a system to model the RNA sequences that reveals their structural information by using efficient dynamic programming algorithms and deep learning approaches. We aim to 1) achieve linear-time for RNA secondary structure prediction based on existing minimum free energy models; 2) utilize deep neural networks...
    Resource Type:
    Dissertation
    Full Text:
    ) time with Idea 2. G: further improving to O(n) time (but with approximate search) with Idea 3. In B, F

  • Improving and Understanding Deep Models for Natural Language Comprehension

    Creator:
    Ghaeini, Reza
    Abstract:
    Natural Language Comprehension is a challenging domain of Natural Language Processing. To improve a model’s language comprehension/understanding, one approach would be to enrich the structure of the model to enhance its capability in learning the latent rules of the language. In this dissertation, we will first introduce several deep models...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172 A Source Code for Gated BERT (G-BERT) . . . . . . . . . . . . . . . . . . 173 LIST OF FIGURES

  • Coordination for Scalable Multiple Robot Planning Under Temporal Uncertainty

    Creator:
    Marcon dos Santos, Gilberto
    Abstract:
    This dissertation incorporates coalition formation and probabilistic planning towards a domain-independent automated planning solution scalable to multiple heterogeneous robots in complex domains. The first research direction investigates the effectiveness of Task Fusion and introduces heuristics that improve task allocation and result in better quality plans, while requiring lower computational cost...
    Resource Type:
    Dissertation