Search Constraints

Start Over
Filtering by: Creator Duringer, J. M. Remove constraint Creator: Duringer, J. M. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Degree Name Doctor of Philosophy (Ph.D.) Remove constraint Degree Name: Doctor of Philosophy (Ph.D.)

Search Results

  • 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

  • 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:
    #��,����%�%��������������������� *2 *��*7������6�+�+�& �,�L�%���&��6����&����&%���%�$M�7&���/���%%��8�� �����&������%�$(�����,N

  • 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

  • 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:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172 I Log Appendix - Moving with Heuristic Agents . . . . . . . . . . . . . . . . 174 J Data

  • 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:
    , - m each term of t(x) satisfies the following inequality: qi(x)ui*+ < E s1; (x) for si(x) > 0 J-1

  • 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:
    , 105–121. (2) López, X.; Carbó, J. J.; Bo, C.; Poblet, J. M. Structure, Properties and Reactivity

  • 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:
    that maps each state to an action. The set of policies for an MDP M is denoted Π(M). An episode

  • Analytical Methods for Improving Causal Inference

    Creator:
    Sinha, Meghamala
    Abstract:
    Causal inference is an important analytical tool to bridge the gap between prediction and decision-making. However, learning a causal network solely from data is a challenging task. In this work, various techniques have been explored for a better and improved causal network learning from data. Firstly, the problem of learning...
    Resource Type:
    Dissertation
    Full Text:
    distribution of p after intervention is: p(V1, ..., Vn) = ∏ Vi∈Oe pi(Vi | Pa(Vi)) · ∏ Vj∈Ie p′j(Vj | Pa(Vj

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    this type and a binary vector of length b m with weight b; in a given configuration, if the j-th box

  • 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:
    ⌘ and thus b|z|�Dc M  6 6 6 4 |z| cos ⇣ tan�1 ⇣ 1 xn ⌘⌘ �D 7 7 7 5 j p x2 n + y2 �D k

  • 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

  • Weakly Supervised Learning for Activity Recognition from Time Series Data

    Creator:
    Guan, Xinze
    Abstract:
    The thesis focuses on activity recognition from sensor data, which has spurred a great deal of interest due to its impact on health care and security. Previous work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort...
    Resource Type:
    Dissertation
    Full Text:
    |zt = j,λ). (3.3) Specifically, the forward procedure calculates α1(j) = πjBjx1 and αt(j) = m∑ i=2 α

  • 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:
    &DEN1�581yF;3<1qp@()9,$ c�9,$'5jc=()&)$'9Ý(D*H5N3N1@9;M;?A58(D14*�581�587;$�*;$'?/$/EjH

  • 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:
    Lipschitz Continuity of ∇M ∞ θk J(θk) . . . . . . . . . 199 LIST OF FIGURES Figure Page 2.1 Performance

  • 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
    Full Text:
    Port of Los Angeles, and Omar Jaradat and Max Weismair of PBS&J, were greatly helpful to the success

  • 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

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    = tj;1 + tj;2 + : : :+ tj;m Then, ei�j = l=1;2;::: ;mX k=1;2;::: ;n tk;l tk;l = ti;k � tj;l 8i

  • An Information Modeling Framework for Support of Sustainable Manufacturing System Design Decision Making

    Creator:
    Shankar Raman, Arvind
    Abstract:
    Manufacturing technology has continuously evolved and advanced over the past century; this has led to an increase in the production of consumer and industrial goods driven by simultaneous growth in population and wealth. Despite the resulting economic and labor growth, environmental impacts of manufacturing have increased dramatically due to the...
    Resource Type:
    Dissertation

  • Machine learning for improving the quality of citizen science data

    Creator:
    Yu, Jun
    Abstract:
    Citizen Science is a paradigm in which volunteers from the general public participate in scientific studies, often by performing data collection. This paradigm is especially useful if the scope of the study is too broad to be performed by a limited number of trained scientists. Although citizen scientists can contribute...
    Resource Type:
    Dissertation
    Full Text:
    |X,U ,W )] =EP (Z|Y ,E) [ M∑ j=1 logP (Ej |Uj ;γ) + N∑ i=1 [ logP (Zi|Xi;α) Ti∑ t=1 logP (Yit|Zi

  • Topics in toroidal interconnection networks

    Creator:
    Broeg, Robert Richard
    Resource Type:
    Dissertation
    Full Text:
    , 1, while y, = 0. This means that m-i B= E x; is even and j=i+1 = E y j = O. j=i+i