| Chapter | |
Section | |
Subsection | |
Assistant | |
Q&A | |
Q | |
|
| Nonlinear Least Squares | |
| |
| |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Nonlinear Least Squares | |
Introduction | |
| |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Nonlinear Least Squares | |
Building the LS equation | |
| |
w3r@inf.ethz.ch | |
3 | |
0 | |
|
| Nonlinear Least Squares | |
Solving the Nonlinear System | |
Interactive Calculation | |
w3r@inf.ethz.ch | |
2 | |
1 | |
|
| Nonlinear Least Squares | |
Methods of function
minimization | |
Parabolic interpolation | |
w3r@inf.ethz.ch | |
1 | |
4 | |
|
| Phylogenetic tree construction | |
A model of evolution | |
Sequence alignment using Dayhoff matrices and maximum likelihood | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Stock market prediction | |
Simulation | |
Optimization of simulation
parameters | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Nonlinear Least Squares | |
Building the LS equation | |
Quiz Milky Way (Exam 2002, Question 1) | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market prediction | |
Simulation | |
Optimization of simulation
parameters | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nonlinear Least Squares | |
Methods of function
minimization | |
Parabolic interpolation | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nonlinear | |
| |
| |
| |
0 | |
0 | |
|
| Phylogenetic | |
| |
| |
| |
0 | |
0 | |
|
| Stock | |
| |
| |
| |
0 | |
0 | |
|
| Molecular | |
| |
| |
| |
0 | |
0 | |
|
| Minimization | |
Quiz | |
| |
| |
0 | |
0 | |
|
| Normal | |
| |
| |
| |
0 | |
0 | |
|
| Nearest | |
| |
| |
| |
0 | |
0 | |
|
| SVD | |
| |
| |
| |
1 | |
0 | |
|
| Simplex | |
| |
| |
| |
0 | |
0 | |
|
| Best | |
| |
| |
| |
0 | |
0 | |
|
| Optimal | |
| |
| |
| |
0 | |
0 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
Quiz minimization (Exam 2000, Question 6) | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| -1' | |
examples of dynamic programming | |
optimal binary search tree | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| stock market | |
-1' | |
optimal binary search tree | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| stock market | |
examples of dynamic programming | |
-1' | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nonlinear Least Squares | |
Solving the Nonlinear System | |
Airplane exercise | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Nonlinear Least Squares | |
Methods of function minimization | |
Golden section search | |
w3r@inf.ethz.ch | |
4 | |
6 | |
|
| Nonlinear Least Squares | |
Methods of function minimization | |
Brent s exponential search | |
w3r@inf.ethz.ch | |
1 | |
3 | |
|
| Nonlinear Least Squares | |
Methods of function minimization | |
Parabolic interpolation | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nonlinear Least Squares | |
Methods of function minimization | |
A further improvement | |
w3r@inf.ethz.ch | |
0 | |
3 | |
|
| Nonlinear Least Squares | |
Methods of function minimization | |
Steepest descent | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Nonlinear Least Squares | |
Methods of function minimization | |
Random directions | |
w3r@inf.ethz.ch | |
2 | |
1 | |
|
| Nonlinear Least Squares | |
Error analysis/confidence analysis | |
| |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Nonlinear Least Squares | |
Error analysis/confidence analysis | |
Interactive exercise | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nonlinear Least Squares | |
Error analysis/confidence analysis | |
An approximation for a complicated S | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Nonlinear Least Squares | |
Solving the Nonlinear System | |
The analytical method of function minimization | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Nonlinear Least Squares | |
Building the LS equation | |
Solving mixed problems | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Secondary structure prediction | |
Introduction to protein biochemistry | |
| |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Secondary structure prediction | |
Introduction to protein biochemistry | |
The mathematical formulation of the problem | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Secondary structure prediction | |
Least squares - SVD | |
Modelling the problem with least squares | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Secondary structure prediction | |
Least squares - SVD | |
Singular value decomposition and eigenvalue decomposition | |
w3r@inf.ethz.ch | |
3 | |
9 | |
|
| Secondary structure prediction | |
Least squares - SVD | |
Criteria for discarding singular values | |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Secondary structure prediction | |
Least squares - SVD | |
Interpretation of the results | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Least squares - Best basis | |
Definition of best basis | |
w3r@inf.ethz.ch | |
3 | |
2 | |
|
| Secondary structure prediction | |
Least squares - Best basis | |
Stepwise regression | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Secondary structure prediction | |
Least squares - Best basis | |
Difficulty of the problem | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Secondary structure prediction | |
Least squares - Best basis | |
Formulation of the minimization-problem | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Least squares - Best basis | |
Algorithms for finding local minima | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Least squares - Best basis | |
The confidence interval | |
w3r@inf.ethz.ch | |
4 | |
2 | |
|
| Secondary structure prediction | |
Least squares - Best basis | |
Final observations | |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Mathematical formulation of the problem | |
w3r@inf.ethz.ch | |
2 | |
1 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Sequential search | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Range searching | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Quad Trees | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Searching the NN tree | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Building a NN tree | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Searching the k nearest neighbours | |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Concluding a value from its neighbours | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Practical considerations - Bucketing | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Practical considerations - Normalizing dimensions | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Practical considerations - Using random directions | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
NN trees used for clustering | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Linear programming | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Linear programming | |
Notation/Terminology | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Linear programming | |
Fundamental theorem | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Linear programming | |
Solving the helix-problem with the simplex algorithm | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Secondary structure prediction | |
Linear programming | |
Inconsistent data | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Linear programming | |
Slack variables | |
w3r@inf.ethz.ch | |
1 | |
4 | |
|
| Secondary structure prediction | |
Linear programming | |
Prediction | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
k-dTrees | |
w3r@inf.ethz.ch | |
3 | |
1 | |
|
| Secondary structure prediction | |
Linear classification/discrimination | |
| |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Secondary structure prediction | |
Linear programming | |
Comparision of LP and LS | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary structure prediction | |
Neural networks | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Introduction | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Simulation | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Two approaches to MD | |
Decisions in the construction of a model | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Two approaches | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Two approaches to MD | |
Simulation packages | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
| |
w3r@inf.ethz.ch | |
2 | |
2 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
Minimization strategies | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
A toy problem | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Two approaches to MD | |
Energy minimization for a protein structure | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
Optimization | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
Conclusions | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Molecular Dynamics | |
Code Generation | |
Code-Generation Exercise | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Two approaches to MD | |
Challengesl | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
The spectral method | |
w3r@inf.ethz.ch | |
2 | |
2 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
Final comments | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
Comparision of minimization methods | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Molecular dynamics | |
The program code | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market | |
Introduction | |
| |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Stock market | |
Introduction | |
Definitions | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Stock market | |
Introduction | |
Examples of information available online | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market | |
Optimal transaction sequence | |
| |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Stock market | |
Optimal transaction sequence | |
Defining the problem | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Stock market | |
Dynamic programming | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market | |
Optimal transaction sequence | |
part 2 | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market prediction | |
Simulation | |
Optimization of simulation parameters | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Stock market prediction | |
Simulation | |
Confidence analysis | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market | |
Examples of Dynamic Programming | |
Optimal binary search tree | |
w3r@inf.ethz.ch | |
2 | |
32 | |
|
| Stock market | |
Dynamic programming | |
The idea of Dynamic programming in more detail | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market | |
Examples of Dynamic Programming | |
Interactive Exercise Optimal binary search tree | |
w3r@inf.ethz.ch | |
1 | |
16 | |
|
| Phylogenetic tree construction | |
Introduction | |
| |
w3r@inf.ethz.ch | |
0 | |
5 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
| |
w3r@inf.ethz.ch | |
4 | |
1 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Distance and variance matrices | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
How to score deletions | |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
String matching | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Creating an Initial topology through Neighbour Joining | |
w3r@inf.ethz.ch | |
2 | |
2 | |
|
| Stock market prediction | |
Confidence Analysis | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Phylogenetic tree construction | |
A model of evolution | |
Dayhoff matrices | |
w3r@inf.ethz.ch | |
3 | |
0 | |
|
| Stock market | |
Examples of Dynamic Programming | |
String Matching | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Phylogenetic tree construction | |
Character based methods | |
Interactive exercise | |
w3r@inf.ethz.ch | |
3 | |
0 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Interactive exercise (String matching) | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nonlinear Least Squares | |
Measurement-Quiz | |
| |
w3r@inf.ethz.ch | |
0 | |
3 | |
|
| Nonlinear Least Squares | |
Approximation-Quiz | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nonlinear Least Squares | |
Himalaya-Quiz | |
| |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Nonlinear Least Square | |
Least Square-Quiz | |
| |
w3r@inf.ethz.ch | |
2 | |
1 | |
|
| Approximate | |
Approximate-Quiz | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Minimization | |
Quiz Brent s Method | |
| |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Normal Distribution | |
Normal Distribution-Quiz | |
(Serie 1.1) | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Nearest Neighbours | |
Nearest Neighbours-Quiz | |
(Neu) | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market | |
Examples of Dynamic Programming | |
Optimal Order of Matrix Multiplications | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Phylogenetic tree construction | |
A model of evolution | |
| |
w3r@inf.ethz.ch | |
3 | |
1 | |
|
| Stock market prediction | |
Approximating the optimal transaction sequence | |
Decisions versus Numerical approach | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Stock market prediction | |
Approximating the optimal transaction sequence | |
Computing good (optimal) parameters | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Stock market prediction | |
Approximating the OTS | |
Other functionals to optimize | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market prediction | |
Simulation | |
Two simple policies | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Phylogenetic tree construction | |
Phylogenies with protein sequences | |
| |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Estimating distances between Sequences by Maximum Likelihood | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Phylogenetic tree construction | |
A model of evolution | |
Local alignment | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Phylogenetic tree construction | |
A model of evolution | |
Cost free end alignment | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Least squares fit | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Swapping Heuristics | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Phylogenetic tree construction | |
Character based methods | |
Parsimony | |
w3r@inf.ethz.ch | |
2 | |
1 | |
|
| Phylogenetic tree construction | |
Genetic algorithms | |
| |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Phylogenetic tree construction | |
Character based methods | |
Strict character compatibility | |
w3r@inf.ethz.ch | |
2 | |
2 | |
|
| Molecular dynamics | |
Minimization strategies | |
Quiz | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Quiz | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Nonlinear Least Squares | |
| |
Quiz Quality Control (Exam 2001, Question 1) | |
w3r@inf.ethz.ch | |
2 | |
4 | |
|
| Secondary structure prediction | |
Least squares - SVD | |
Quiz | |
w3r@inf.ethz.ch | |
1 | |
0 | |
|
| SVD a concrete example | |
SVD-Quiz | |
(New) | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Simplex Method | |
| |
Quiz Simplex Method | |
w3r@inf.ethz.ch | |
1 | |
7 | |
|
| Secondary structure prediction | |
Least squares - Best Basis | |
Quiz Population | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Best Basis | |
Best Basis-Quiz | |
Neu | |
w3r@inf.ethz.ch | |
2 | |
0 | |
|
| Stock market prediction | |
Approximating the OTS | |
Quiz Prediction (Exam 2001, Question 1) | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Quiz Language (Exam 2000, Question 2) | |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Molecular dynamics | |
Energy minimization for a protein structure | |
Quiz | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Optimal Route Plan | |
Optimal Route Plan Quiz | |
WS 1999/2000, Serie 5.1 | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock Market | |
Dynamic Programming | |
Quiz Optimal Routing | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Phylogenetic Trees | |
Phylogenetic Trees-Quiz | |
(Spring 98, Question 5) | |
w3r@inf.ethz.ch | |
1 | |
2 | |
|
| Phylogenetic tree construction | |
Character based methods | |
Quiz Parsimony (Exam 98, Question 6) | |
w3r@inf.ethz.ch | |
1 | |
1 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Quiz Counting (Exam 1999, Question 2) | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Secondary structure prediction | |
Learning methods - Nearest neighbours | |
Quiz Nearest Neighbors Search | |
w3r@inf.ethz.ch | |
1 | |
3 | |
|
| Secondary structure prediction | |
Linear programming | |
The Simplex Method | |
w3r@inf.ethz.ch | |
0 | |
2 | |
|
| Nonlinear Least Squares | |
Methods of function minimization | |
Brent's exponential search | |
w3r@inf.ethz.ch | |
1 | |
2 | |
|
| Nonlinear Least Squares | |
Methods of functionminimization | |
Parabolic interpolation | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Stock market | |
Optimal transaction sequence | |
Rationale for Stock Market Prediction | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|
| Stock market prediction | |
Simulation | |
Optimization of simulationparameters | |
w3r@inf.ethz.ch | |
0 | |
0 | |
|
| Secondary | |
| |
| |
| |
0 | |
0 | |
|
| Phylogenetic tree construction | |
Distance based methods | |
Using Dynamic Programming for Sequence Alignment (Global Alignment) | |
w3r@inf.ethz.ch | |
0 | |
1 | |
|