Sökning: "discrete time"
Visar resultat 16 - 20 av 577 avhandlingar innehållade orden discrete time.
16. Time-domain modelling of high-frequency wheel/rail interaction
Sammanfattning : The interaction between wheel and rail is the predominant source of noise emission from railway operations in a wide range of conventional speeds. On the one hand, this wheel/rail noise concerns rolling noise and impact noise caused by the vertical interaction excited by roughness and discrete irregularities of the wheel/rail running surfaces, respectively. LÄS MER
17. On Hardware Implementation of Discrete-Time Cellular Neural Networks
Sammanfattning : Cellular Neural Networks are characterized by simplicity of operation. The network consists of a large number of nonlinear processing units; called cells; that are equally spread in the space. LÄS MER
18. Modelling of wheel/rail interaction considering roughness and discrete irregularities
Sammanfattning : The interaction between wheel and rail is the predominant source of noise emission from railway operations in a wide range of conventional speeds. On the one hand, this wheel/rail noise concerns rolling noise and impact noise caused by the vertical interaction excited by roughness and discrete irregularities of the wheel/rail running surfaces, respectively. LÄS MER
19. On Modeling and Nonlinear Model Reduction in Automotive Systems
Sammanfattning : The current control design development process in automotive industry and elsewhere involves many expensive experiments and hand-tuning of control parameters. Model based control design is a promising approach to reduce costs and development time. In this process low complexity models are essential and model reduction methods are very useful tools. LÄS MER
20. On linear graph invariants related to Ramsey and edge numbers : or how I learned to stop worrying and love the alien invasion
Sammanfattning : In this thesis we study the Ramsey numbers, R(l,k), the edge numbers, e(l,k;n) and graphs that are related to these. The edge number e(l,k;n) may be defined as the least natural number m for which all graphs on n vertices and less than m edges either contains a complete subgraph of size l or an independent set of size k. LÄS MER