- 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.
Search results
Showing 321 to 330 of 7160 (0.058 seconds)Spelling suggestions: "subject:": imatematik"" "subject:": avmatematik""
| 321 |
Monte Carlo Methods in American Put Option PricingAhmady Phoulady, Hady January 2011 (has links)
No description available.
|
| 322 |
Pricing Barrier Options using Monte Carlo MethodsWang, Bing, Wang, Ling January 2011 (has links)
No description available.
|
| 323 |
Ett pedagogisk-matematiskt dataspels inverkan på elevinteraktionTorgeby, Maria January 2011 (has links)
Undersökningen syftar till att söka svar på hur elevers interaktion kan se ut när de spelar ett pedagogiskt matematiskt dataspel och vilken roll datorn spelar i denna interaktion. Interaktionen har studerats ur ett sociokulturellt perspektiv. Metoderna som använts är intervjuer av pedagoger, videofilmning av elever som spelar ett pedagogiskt matematiskt dataspel samt Stimulated Recall där eleverna fått videoinspelningen av sig själva och reflekterat över denna. Fyra pedagoger deltog i intervjuerna och fyra elevpar deltog vid videoinspelningarna. Undersökningen visar att elevinteraktionen tar sig uttryck i kroppsspråk, turtagning och muntlig kommunikation. Datorn har i sin roll som medierande artefakt initierat uppgifter, tillhandahållit bildstöd och ökat motivationen hos eleverna.
|
| 324 |
Modeling of Market Volatility with APARCH ModelDing, Ding January 2011 (has links)
No description available.
|
| 325 |
The VIX Volatility IndexXin, Mao January 2011 (has links)
No description available.
|
| 326 |
Shortest paths through a reinforced random walkLi, Dan January 2011 (has links)
No description available.
|
| 327 |
Factorization Algorithms for Polynomials over Finite FieldsHanif, Sajid, Imran, Muhammad January 2011 (has links)
Integer factorization is a dicult task. Some cryptosystem such asRSA (which stands for Rivest, Shamir and Adleman ) are in fact designedaround the diculty of integer factorization.For factorization of polynomials in a given nite eld Fp we can useBerlekamp's and Zassenhaus algorithms. In this project we will see howBerlekamp's and Zassenhaus algorithms work for factorization of polyno-mials in a nite eld Fp. This project is aimed toward those with interestsin computational algebra, nite elds, and linear algebra.
|
| 328 |
On L-induced Tn -modulesKastberg, Robin January 2011 (has links)
No description available.
|
| 329 |
An Introduction to Lefschetz Coincidence Theory with an Application to Differential EquationsWenzel, Ansgar January 2011 (has links)
No description available.
|
| 330 |
Calculation of Expected Shortfall via Filtered Historical SimulationYuan, Huang January 2011 (has links)
No description available.
|
Page generated in 0.0646 seconds