• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1311
  • 444
  • 238
  • 177
  • 78
  • 38
  • 29
  • 25
  • 23
  • 19
  • 18
  • 14
  • 12
  • 11
  • 10
  • Tagged with
  • 3074
  • 540
  • 483
  • 471
  • 455
  • 427
  • 417
  • 372
  • 321
  • 301
  • 295
  • 282
  • 262
  • 242
  • 234
  • 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.
181

The Discrete 2D Fourier Transform In Polar Coordinates

Yao, Xueyang 14 May 2018 (has links)
The discrete Fourier transform in Cartesian coordinates has proved to be invaluable in many disciplines. However, less theory has been developed for functions that are best described in polar coordinates. In this thesis, a new discrete 2D-Fourier transform in polar coordinates is proposed and tested by numerical simulations. Guidelines for choosing sample size are developed. Furthermore, to be as useful as its Cartesian counterpart, improvements are made to reduce the computing time.
182

Discrete element simulation of particle crushing in one-dimensional compression

Liu, Si Kai January 2017 (has links)
University of Macau / Faculty of Science and Technology / Department of Civil and Environmental Engineering
183

On Minimal Non-(2, 1)-Colorable Graphs

Bosse, Ruth January 2017 (has links)
A graph is (2, 1)-colorable if it allows a partition of its vertices into two classes such that both induce graphs with maximum degree at most one. A non-(2, 1)-colorable graph is minimal if all proper subgraphs are (2, 1)-colorable. We prove that such graphs are 2-edge-connected and that every edge sits in an odd cycle. Furthermore, we show properties of edge cuts and particular graphs which are no induced subgraphs. We demonstrate that there are infinitely many minimal non-(2, 1)-colorable graphs, at least one of order n for all n ≥ 5. Moreover, we present all minimal non-(2, 1)- colorable graphs of order at most seven. We consider the maximum degree of minimal non-(2, 1)-colorable graphs and show that it is at least four but can be arbitrarily large. We prove that the average degree is greater than 8/3 and give sufficient properties for graphs with average degree greater than 14/5. We conjecture that all minimal non-(2, 1)-colorable graphs fulfill these properties.
184

A general discrete-time arbitrage theorem

Van Zyl, Augustinus Johannes 05 October 2005 (has links)
Please read the abstract in the front section of this document / Dissertation (MSc (Mathematics))--University of Pretoria, 2005. / Mathematics and Applied Mathematics / unrestricted
185

Numerical modelling of the roll damping of ships due to vortex shedding

Cozens, Paul Dennis January 1987 (has links)
No description available.
186

Statistical Analysis of Treatment Compliance for Clinical Trials using Electronic Compliance Monitoring

Sirois, Jean-Karl January 2015 (has links)
Compliance, the extent to which patients follow a medication regimen, has been recognized as one of the most serious problems facing medical practice today. Recent developments in assessing compliance include electronic compliance monitors (ECM), devices that record the date and time of the release of medication from its original container. This allows utilizing ECM compliance data in statistical analyses related to clinical trials. This thesis proposes ways of dealing with the time-varying nature of compliance. We examine the compliance behaviour from real ECM data through statistical analysis of compliance rate, followed by a time-to-event analysis with respect to first noncompliance event. Then, using discrete event simulation and proportional hazards models we compare analyses using a fixed treatment covariate and time-varying compliance covariate based on pharmacokinetic principles in estimating treatment effect. We observe a reduction of up to 40% in EMSE in favour of the latter model for treatment effect estimation.
187

Diskrétní simulace v MS Excel / Discrete event simulation in MS Excel

Charvát, Karel January 2009 (has links)
The topic of this thesis is discrete event simulation. The thesis introduces basic principles of discrete event simulation and Add-in SIMULANT for MS EXCEL 2007, which was created as a part of this thesis. Description of algorithms used in SIMULANT add-in and user guide are included in this thesis.
188

Convex methods for discrete-time constrained control

Ahmad, Nur Syazreen January 2012 (has links)
Feedback is used to control systems whose open-loop behaviour is uncertain. Over the last twenty years a mature theory of robust control has been developed for linear multivariable systems in continuous time. But most practical control systems have constraints such as saturation limits on the actuators, which render the closed-loop nonlinear. Most of the modern controllers are also implemented digitally using computers.The study of this research is divided in two directions: the stability analysis of discrete-time Lur’e systems and the synthesis of static discrete-time anti-windup schemes. With respect to stability analysis, the main contributions of this thesis are the derivations of new LMI-based stability criteria for the discrete-time Lur’e systems with monotonic, slope-restricted nonlinearities via the Lyapunov method. The criteria provide convex stability conditions via LMIs, which can be efficiently computed via convex optimization methods. They are also extended to the general case that includes the non-diagonal MIMO nonlinearities. The importance of extending them to the general case is that it can eventually be applied to the stability analysis of several optimization-based controllers such as an input-constrainedmodel predictive control (MPC), which is inherently discrete. With respect to synthesis, the contribution is the convex formulation of a static discrete-time anti-windup scheme via one of the Jury-Lee criteria (a discrete-time counterpart of Popov criterion), which was previously conjectured to be unachievable. The result is also in the form of LMI, and is extended to several existing static anti-windup schemes with open-loop stable plants.
189

Linear continuous-time system identification and state observer design by modal analysis

El-Shafey, Mohamed Hassan January 1987 (has links)
A new approach to the identification problem of linear continuous-time time-invariant systems from input-output measurements is presented. Both parametric and nonparametric system models are considered. The new approach is based on the use of continuous-time functions, the modal functions, defined in terms of the system output, the output derivatives and the state variables under the assumption that the order n of the observable system is known a priori. The modal functions are obtained by linear filtering operations of the system output, the output derivatives and the state variables so that the modal functions are independent of the system instantaneous state. In this case, the modal functions are linear functions of the input exponential modes, and they contain none of the system exponential modes unlike the system general response which contains modes from both the system and the input. The filters parameters, the modal parameters are estimated using linear regression techniques. The modal functions and the modal parameters of the output and its derivatives are used to identify parametric input-output and state models of the system. The coefficients of the system characteristic polynomial are obtained by solving n algebraic equations formed from the estimates of the modal parameters. Estimates of the parameters associated with the system zeros are obtained by solving another set of linear algebraic equation. The system frequency response and step response are estimated using the output modal function. The impulse response is obtained by filtering the estimated step response using the output first derivative modal parameters. A new method is presented to obtain the system poles as the eigenvalues of a data matrix formed from the system free response. The coefficients of the system characteristic polynomial are obtained from the data matrix through a simple recursive equation. This method has some important advantages over the well known Prony's method. The state modal functions are used to obtain a minimum-time observer that gives the continuous-time system state as a direct function of input-output samples in n sampling intervals. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate
190

A theory of discrete parametrized surfaces in R^3

Sageman-Furnas, Andrew O'Shea 19 October 2017 (has links)
No description available.

Page generated in 0.0599 seconds