Search Constraints

Start Over
Filtering by: Creator Oster, E. A. Remove constraint Creator: Oster, E. A. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • 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:
    specifies. E-value is the probability that a score or group of scores is observed as high as the observed

  • 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:
    sequence of {(s, a)} until the goal is reached or until infinity. E denotes the statistical expectation

  • 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:
    ;$'3 M,F„1Z*�3<$/zHM;$'E<5w\ #%$'&)()*,+�-.$/*rWdQRM,587,143 �� �¶�����·�¸ �!��¹�� ª �!�e

  • Designing and understanding information retrieval systems using collaborative filtering in an academic library environment

    Creator:
    Jung, Seikyung
    Abstract:
    Accessing information on the Web has become ingrained into our daily lives, and we seek information from many different sources, including conference and journal publications, personal web pages, and others. Increasingly, web-based information retrieval systems such as web-based search engines, library on-line catalog systems, and subscription-based federated search systems are...
    Resource Type:
    Dissertation
    Full Text:
    articles presenting a broad set of results with the goal of helping people find interesting information

  • Image feature detection and matching for biological object recognition

    Creator:
    Deng, Hongli
    Abstract:
    Image feature detection and matching are two critical processes for many computer vision tasks. Currently, intensity-based local interest region detectors and local feature-based matching methods are used widely in computer vision applications. But in some applications, such as biological object recognition tasks, within-class changes in pose, lighting, color, and texture...
    Resource Type:
    Dissertation
    Full Text:
    bins for θ. (d), (e),and(f) Example shape contexts for reference samples marketed by ◦ ⋄ ⊳ in (a) and

  • Scale effects on reinforced concrete beams strengthened for shear with discrete externally bonded carbon fiber-reinforced polymer U-wraps

    Creator:
    Dawson, Matthew Ryan
    Abstract:
    Current ACI design provisions for shear in reinforced concrete (RC) beams strengthened with externally bonded carbon fiber-reinforced polymer (CFRP) U-wraps may not adequately account for the effect of scale. This paper describes tests of 6 geometrically scaled beams to identify possible scale effects of such beams. Results indicated that effective...
    Resource Type:
    Masters Thesis
    Full Text:
    = (10-4) [8] fe fe ff Eε= (10-5) [9] (sin cos )fv fe f f f A f d V s α α+ = (10-3

  • 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:
    (examples: E, treenode: T , real: �) 2: E is the set of training examples 3: T is a tree node (initially a

  • 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:
    networks is now a well-established approach for reasoning under uncertainty. Among many e�ciency-driven

  • 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:
    MarkPlaced algorithm in Figure 3.2 is simply a depth-first search, and therefore hasO(p + e) runtime

  • UCT for tactical assault battles in real-time strategy games

    Creator:
    Balla, Radha-Krishna
    Abstract:
    We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics...
    Resource Type:
    Masters Thesis
    Full Text:
    health. 2) Attack(f,e): where f is a friendly group and e is an enemy group, causes f to move toward