• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 2
  • Tagged with
  • 7
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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.
1

Numerical solution of the stationary FPK equation using Shannon wavelets

Knappett, Daniel January 2001 (has links)
No description available.
2

Geometry of actions, expanders and warped cones

Vigolo, Federico January 2018 (has links)
In this thesis we introduce a notion of graphs approximating actions of finitely generated groups on metric and measure spaces. We systematically investigate expansion properties of said graphs and we prove that a sequence of graphs approximating a fixed action ρ forms a family of expanders if and only if ρ is expanding in measure. This enables us to rely on a number of known results to construct numerous new families of expander (and superexpander) graphs. Proceeding in our investigation, we show that the graphs approximating an action are uniformly quasi-isometric to the level sets of the associated warped cone. The existence of such a relation between approximating graphs and warped cones has twofold advantages: on the one hand it implies that warped cones arising from actions that are expanding in measure coarsely contain families of expanders, on the other hand it provides a geometric model for the approximating graphs allowing us to study the geometry of the expander thus obtained. The rest of the work is devoted to the study of the coarse geometry of warped cones (and approximating graphs). We do so in order to prove rigidity results which allow us to prove that our construction is flexible enough to produce a number of non coarsely equivalent new families of expanders. As a by-product, we also show that some of these expanders enjoy some rather peculiar geometric properties, e.g. we can construct expanders that are coarsely simply connected.
3

Essays on Gaussian Probability Laws with Stochastic Means and Variances : With Applications to Financial Economics

Eriksson, Anders January 2005 (has links)
<p>This work consists of four articles concerning Gaussian probability laws with stochastic means and variances. The first paper introduces a new way of approximating the probability distribution of a function of random variables. This is done with a Gaussian probability law with stochastic mean and variance. In the second paper an extension of the Generalized Hyperbolic class of probability distributions is presented. The third paper introduces, using a Gaussian probability law with stochastic mean and variance, a GARCH type stochastic process with skewed innovations. </p><p>In the fourth paper a Lévy process with second order stochastic volatility is presented, option pricing under such a process is also considered.</p>
4

Essays on Gaussian Probability Laws with Stochastic Means and Variances : With Applications to Financial Economics

Eriksson, Anders January 2005 (has links)
This work consists of four articles concerning Gaussian probability laws with stochastic means and variances. The first paper introduces a new way of approximating the probability distribution of a function of random variables. This is done with a Gaussian probability law with stochastic mean and variance. In the second paper an extension of the Generalized Hyperbolic class of probability distributions is presented. The third paper introduces, using a Gaussian probability law with stochastic mean and variance, a GARCH type stochastic process with skewed innovations. In the fourth paper a Lévy process with second order stochastic volatility is presented, option pricing under such a process is also considered.
5

Operating System Management of Shared Caches on Multicore Processors

Tam, David Kar Fai 01 September 2010 (has links)
Our thesis is that operating systems should manage the on-chip shared caches of multicore processors for the purposes of achieving performance gains. Consequently, this dissertation demonstrates how the operating system can profitably manage these shared caches. Two shared-cache management principles are investigated: (1) promoting shared use of the shared cache, demonstrated by an automated online thread clustering technique, and (2) providing cache space isolation, demonstrated by a software-based cache partitioning technique. In support of providing isolation, cache provisioning is also investigated, demonstrated by an automated online technique called RapidMRC. We show how these software-based techniques are feasible on existing multicore systems with the help of their hardware performance monitoring units and their associated hardware performance counters. On a 2-chip IBM POWER5 multicore system, promoting sharing reduced processor pipeline stalls caused by cross-chip cache accesses by up to 70%, resulting in performance improvements of up to 7%. On a larger 8-chip IBM POWER5+ multicore system, the potential for up to 14% performance improvement was measured. Providing isolation improved performance by up to 50%, using an exhaustive offline search method to determine optimal partition size. On the other hand, up to 27% performance improvement was extracted from the corresponding workload using an automated online approximation technique, made possible by RapidMRC.
6

Operating System Management of Shared Caches on Multicore Processors

Tam, David Kar Fai 01 September 2010 (has links)
Our thesis is that operating systems should manage the on-chip shared caches of multicore processors for the purposes of achieving performance gains. Consequently, this dissertation demonstrates how the operating system can profitably manage these shared caches. Two shared-cache management principles are investigated: (1) promoting shared use of the shared cache, demonstrated by an automated online thread clustering technique, and (2) providing cache space isolation, demonstrated by a software-based cache partitioning technique. In support of providing isolation, cache provisioning is also investigated, demonstrated by an automated online technique called RapidMRC. We show how these software-based techniques are feasible on existing multicore systems with the help of their hardware performance monitoring units and their associated hardware performance counters. On a 2-chip IBM POWER5 multicore system, promoting sharing reduced processor pipeline stalls caused by cross-chip cache accesses by up to 70%, resulting in performance improvements of up to 7%. On a larger 8-chip IBM POWER5+ multicore system, the potential for up to 14% performance improvement was measured. Providing isolation improved performance by up to 50%, using an exhaustive offline search method to determine optimal partition size. On the other hand, up to 27% performance improvement was extracted from the corresponding workload using an automated online approximation technique, made possible by RapidMRC.
7

Multi-level Decoupled Optimization of Wind Turbine Structures Using Coefficients of Approximating Functions as Design Variables

Lee, Jin Woo January 2017 (has links)
No description available.

Page generated in 0.0614 seconds