• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 173
  • 67
  • 15
  • 13
  • 10
  • 8
  • 4
  • 4
  • 4
  • 4
  • 3
  • 2
  • 1
  • Tagged with
  • 378
  • 378
  • 123
  • 93
  • 69
  • 66
  • 62
  • 52
  • 52
  • 48
  • 44
  • 40
  • 38
  • 34
  • 33
  • 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.
291

Necessary and Sufficient Conditions on State Transformations That Preserve the Causal Structure of LTI Dynamical Networks

Leung, Chi Ho 01 May 2019 (has links)
Linear time-invariant (LTI) dynamic networks are described by their dynamical structure function, and generally, they have many possible state space realizations. This work characterizes the necessary and sufficient conditions on a state transformation that preserves the dynamical structure function, thereby generating the entire set of realizations of a given order for a specific dynamic network.
292

Necessary and Sufficient Conditions on State Transformations That Preserve the Causal Structure of LTI Dynamical Networks

Leung, Chi Ho 01 May 2019 (has links)
Linear time-invariant (LTI) dynamic networks are described by their dynamical structure function, and generally, they have many possible state space realizations. This work characterizes the necessary and sufficient conditions on a state transformation that preserves the dynamical structure function, thereby generating the entire set of realizations of a given order for a specific dynamic network.
293

Representation and Reconstruction of Linear, Time-Invariant Networks

Woodbury, Nathan Scott 01 April 2019 (has links)
Network reconstruction is the process of recovering a unique structured representation of some dynamic system using input-output data and some additional knowledge about the structure of the system. Many network reconstruction algorithms have been proposed in recent years, most dealing with the reconstruction of strictly proper networks (i.e., networks that require delays in all dynamics between measured variables). However, no reconstruction technique presently exists capable of recovering both the structure and dynamics of networks where links are proper (delays in dynamics are not required) and not necessarily strictly proper.The ultimate objective of this dissertation is to develop algorithms capable of reconstructing proper networks, and this objective will be addressed in three parts. The first part lays the foundation for the theory of mathematical representations of proper networks, including an exposition on when such networks are well-posed (i.e., physically realizable). The second part studies the notions of abstractions of a network, which are other networks that preserve certain properties of the original network but contain less structural information. As such, abstractions require less a priori information to reconstruct from data than the original network, which allows previously-unsolvable problems to become solvable. The third part addresses our original objective and presents reconstruction algorithms to recover proper networks in both the time domain and in the frequency domain.
294

Aspects of bivariate time series

Seeletse, Solly Matshonisa 11 1900 (has links)
Exponential smoothing algorithms are very attractive for the practical world such as in industry. When considering bivariate exponential smoothing methods, in addition to the properties of univariate methods, additional properties give insight to relationships between the two components of a process, and also to the overall structure of the model. It is important to study these properties, but even with the merits the bivariate exponential smoothing algorithms have, exponential smoothing algorithms are nonstatistical/nonstochastic and to study the properties within exponential smoothing may be worthless. As an alternative approach, the (bivariate) ARIMA and the structural models which are classes of statistical models, are shown to generalize the exponential smoothing algorithms. We study these properties within these classes as they will have implications on exponential smoothing algorithms. Forecast properties are studied using the state space model and the Kalman filter. Comparison of ARIMA and structural model completes the study. / Mathematical Sciences / M. Sc. (Statistics)
295

台北市房價泡沫知多少?-房價vs.租金與房價vs.所得

鄧筱蓉 Unknown Date (has links)
過去雖有文獻探討國內房地產市場泡沫化問題,卻僅從租金收益的單一角度衡量房價基值,對於自有住宅比例較高的台灣而言,家戶所得不僅代表購屋者的負擔能力,更是構成房價基值的重要因素。有鑑於此,本研究分別從租金收益及家戶所得兩者不同角度下,透過資產市場現值模型,分別建立房價基值模型分析泡沫化現象。此外,過去文獻僅從檢定價格波動穩定性與否或將殘差項視為泡沫來研究泡沫化問題,然泡沫為不可觀察之變數,故本文使用具有可估計不可觀察變數特質的狀態空間模型(STATE-SPACE MODEL),推估泡沫價格,分析在不同時期下泡沫的規模大小。 在實證方面,本研究使用台北市1973Q2至2008Q1共140筆住宅價格資料,發現由租金與所得所計算之房價泡沫規模略為一致。在1988~1990年房市泡沫化時期,所得推估之泡沫規模達到高峰,泡沫價格占市價約47%;而由租金面亦計算出泡沫價格占市價約54%的高比例。而在2008年房價持續上漲的情況下,兩者泡沫價格亦呈現相同上升之走勢,泡沫價格近市價38%,租金推估泡沫價格占市價27%;此結果表示出目前房市有泡沫化之跡象,現階段欲購屋自住者不宜進入市場,宜審慎等待時機。而本文認為房價所得比或是房價租金比皆是作為衡量台北市房地產市場泡沫化現象之重要指標,另外就總體因素分析而言,房價上漲率、貨幣供給額、貸款利率與大盤股價指數皆為影響泡沫之重要因素,且經由實證發現所得所推估之泡沫價格較具有市場代表性。 / The past literatures about Taipei housing price bubble has only been measured the fundamental price by rent. However, the housing owner ratio is so high in Taiwan that housing income is not only regarded as affordability but also an important fundamental factor of housing price. According to the above, we focus on different fundamental models that define market fundamental price to analyses the bubble price from expected present value of both rent and permanent housing income. On the other hand, different from lots of literature testing the housing price volatility or residual to measure bubble prices, because housing bubble is an unobservable variable, we apply State-Space Model which is good for testing an invisible factor to estimate bubble in the housing markets of Taipei. This paper tries to test whether there was a housing price bubble using Taipei housing price index ranged from 1973Q1 to 2008Q1. The findings indicate that there appeared bubble ratio from 1988 to 1990, 47% of the housing price based on housing income and 54 % of the housing price based on rent. In 2008 when housing price continually keeps rising, bubble price ratios are close to 38% and 27% respectively. Those results show that Taipei seems to have sign of a bubble in this moment and housing buyers should concern it with more caution. Secondly, both price-income ratio and price-rent ratio are good indicators to measure housing bubble prices. Beside, we find macro economic factors change, such as the growth rate of housing price, M2, mortgage rate, and stock price index, are important to influence the size of housing bubble. Thirdly, bubble price estimated by housing income has a better performance than rent.
296

聯合系統與獨特風險下之信用違約交換評價 / Joint pricing of CDS spreads with Idiosyncratic and systematic risks

王聖文, Wang, Sheng-Wen Unknown Date (has links)
本研究透過聯合系統與獨特風險綜合評估違約的強度,假設市場上經濟變數或資訊影響系統之違約強度,然若直接考慮所有經濟變數到模型中將可能會有共線性或維度過高之疑慮,因此透過狀態空間模型來設定狀態變數以及經濟變數之關係並將萃取三大狀態變數分別用以描述市場實質活動面、通貨膨脹以及信用環境。另外,將透過結構式模型來計算獨特性風險大小,當個別潛在的變數低於一定數值將導致個別的違約事件發生。而因布朗運動可能無法描述或校準市場上違約之鋒態以及偏態,將進一步考慮Variance Gamma過程用以更準確描述真實違約狀況。最後透過結合以上兩個風險綜合評估下,考慮一個聯合違約模型來評價信用違約交換之信用價差。 / Systematic and idiosyncratic risks are supposed to jointly trigger the default events. This paper identifies three fundamental risks to capture the systematic movement: real activity, inflation, and credit environment. Since most macroeconomic variables fluctuate together, the state-space model is imposed to extract the three variables from macroeconomic data series. In the idiosyncratic part, the structural model is applied. That is, idiosyncratic default is triggered by the crossing of a barrier. For improvement of the underlying lognormal distribution, we assume the process for the potential variable of the firm follows a Variance Gamma process, sufficient dimensions of which can fit the skewed and leptokurtic distributions. Under the specific setting of combinations of the two risks (the so-called joint default model), we price credit default swaps.
297

A Verification Framework for Component Based Modeling and Simulation : “Putting the pieces together”

Mahmood, Imran January 2013 (has links)
The discipline of component-based modeling and simulation offers promising gains including reduction in development cost, time, and system complexity. This paradigm is very profitable as it promotes the use and reuse of modular components and is auspicious for effective development of complex simulations. It however is confronted by a series of research challenges when it comes to actually practice this methodology. One of such important issue is Composability verification. In modeling and simulation (M&amp;S), composability is the capability to select and assemble components in various combinations to satisfy specific user requirements. Therefore to ensure the correctness of a composed model, it is verified with respect to its requirements specifications.There are different approaches and existing component modeling frameworks that support composability however in our observation most of the component modeling frameworks possess none or weak built-in support for the composability verification. One such framework is Base Object Model (BOM) which fundamentally poses a satisfactory potential for effective model composability and reuse. However it falls short of required semantics, necessary modeling characteristics and built-in evaluation techniques, which are essential for modeling complex system behavior and reasoning about the validity of the composability at different levels.In this thesis a comprehensive verification framework is proposed to contend with some important issues in composability verification and a verification process is suggested to verify composability of different kinds of systems models, such as reactive, real-time and probabilistic systems. With an assumption that all these systems are concurrent in nature in which different composed components interact with each other simultaneously, the requirements for the extensive techniques for the structural and behavioral analysis becomes increasingly challenging. The proposed verification framework provides methods, techniques and tool support for verifying composability at its different levels. These levels are defined as foundations of a consistent model composability. Each level is discussed in detail and an approach is presented to verify composability at that level. In particular we focus on theDynamic-Semantic Composability level due to its significance in the overallcomposability correctness and also due to the level of difficulty it poses in theprocess. In order to verify composability at this level we investigate the application ofthree different approaches namely (i) Petri Nets based Algebraic Analysis (ii) ColoredPetri Nets (CPN) based State-space Analysis and (iii) Communicating SequentialProcesses based Model Checking. All the three approaches attack the problem ofverifying dynamic-semantic composability in different ways however they all sharethe same aim i.e., to confirm the correctness of a composed model with respect to itsrequirement specifications. Beside the operative integration of these approaches inour framework, we also contributed in the improvement of each approach foreffective applicability in the composability verification. Such as applying algorithmsfor automating Petri Net algebraic computations, introducing a state-space reductiontechnique in CPN based state-space analysis, and introducing function libraries toperform verification tasks and help the molder with ease of use during thecomposability verification. We also provide detailed examples of using each approachwith different models to explain the verification process and their functionality.Lastly we provide a comparison of these approaches and suggest guidelines forchoosing the right one based on the nature of the model and the availableinformation. With a right choice of an approach and following the guidelines of ourcomponent-based M&amp;S life-cycle a modeler can easily construct and verify BOMbased composed models with respect to its requirement specifications. / <p>Overseas Scholarship for PHD in selected Studies Phase II Batch I</p><p>Higher Education Commision of Pakistan.</p><p>QC 20130224</p>
298

Minimality, input-output equivalence and identifiability of LPV systems in state-space and linear fractional representations / Minimalité, équivalence entrée-sortie et identifiabilité des systèmes LPV sous forme d’état et sous forme de représentations linéaires fractionaires

Alkhoury, Ziad 09 November 2017 (has links)
Dans cette thèse, plusieurs concepts importants liés à la théorie de la réalisation des modèles linéaires à paramètres variants (LPV) sont étudiés.Tout d’abord, nous abordons le problème de l’identifiabilité des modèles LPV affines (ALPV). Une nouvelle condition suffisante et nécessaire est introduite afin de garantir l’identifiabilité structurelle pour les paramétrages ALPV. L’identifiabilité de cette classe de paramétrages est liée à l’absence d’isomorphismes liant deux représentations d’état LPV lorsque deux modèles LPV correspondant à différentes valeurs des variables de séquencement sont considérés. Nous présentons ainsi une condition suffisante et nécessaire pour l’identifiabilité structurelle locale, et une condition suffisante pour l’identifiabilité structurelle (globale) qui sont toutes deux fonction du rang d’une matrice définie par l’utilisateur. Ces dernières conditions permettent la vérification de l’identifiabilité structurelle des modèles ALPV.Ensuite, étant donné que les techniques d’identification dites locales sont parfois inévitables, nous fournissons une expression analytique de la borne supérieure de l’erreur de comportements entrées-sorties de deux modèles LPV équivalents localement. Cette erreur se révèle être une fonction de (i) la vitesse de changement du signal de séquencement et (ii) l’écart entre les bases cohérentes de deux modèles LPV. En particulier, la différence entre les sorties des deux modèles peut être arbitrairement réduite en choisissant un signal de séquencement qui varie assez lentement.Enfin, nous présentons et étudions des propriétés importantes de la transformation des représentations d’état ALPV en Représentations Linéaires Fractionnelles (LFR). Plus précisément, nous montrons que (i) les représentations ALPV minimales conduisent à des LFR minimales, et vice versa, (ii) le comportement entrée-sortie de la représentation ALPV détermine de manière unique le comportement entrée-sortie de la LFR résultante, (iii) les modèles ALPV structurellement identifiables fournissent des LFRs structurellement identifiables et vice versa. Nous caractérisons ensuite les LFRs qui correspondent á des modèles ALPV équivalents basés sur leurs applications entrées-sorties. Comme illustré tout au long du manuscrit, ces résultats ont des conséquences importantes pour l’identification et la commande des systèmes LPV. / In this thesis, important concepts related to the identification of Linear Parameter-Varying (LPV) systems are studied.First, we tackle the problem of identifiability of Affine-LPV (ALPV) state-space parametrizations. A new sufficient and necessary condition is introduced in order to guarantee the structural identifiability for ALPV parameterizations. The identifiability of this class of parameterizations is related to the lack of state-space isomorphisms between any two models corresponding to different scheduling parameter values. In addition, we present a sufficient and necessary condition for local structural identifiability, and a sufficient condition for (global) structural identifiability which are both based on the rank of a model-based matrix. These latter conditions allow systematic verification of structural identifiability of ALPV models. Moreover, since local identification techniques are inevitable in certain applications, it is thus a priority to study the discrepancy between different LPV models obtained using different local techniques. We provide an analytic error bound on the difference between the input-output behaviors of any two LPV models which are frozen equivalent. This error bound turns out to be a function of both (i) the speed of the change of the scheduling signal and (ii) the discrepancy between the coherent bases of the two LPV models. In particular, the difference between the outputs of the two models can be made arbitrarily small by choosing a scheduling signal which changes slowly enough.Finally, we introduce and study important properties of the transformation of ALPV statespace representations into Linear Fractional Representations (LFRs). More precisely, we show that (i) state minimal ALPV representations yield minimal LFRs, and vice versa, (ii) the inputoutput behavior of the ALPV representation determines uniquely the input-output behavior of theresulting LFR, (iii) structurally identifiable ALPV models yield structurally identifiable LFRs, and vice versa. We then characterize LFRs which correspond to equivalent ALPV models based on their input-output maps. As illustrated all along the manuscript, these results have important consequences for identification and control of LPV systems.
299

[en] STATE SPACE MODELS WITH RESTRICTIONS IN COMPONENTS OF INTEREST: APPLICATIONS IN DYNAMIC STYLE ANALYSIS FOR BRAZILIAN INVESTMENT FUNDS / [pt] MODELOS EM ESPAÇO DE ESTADO COM RESTRIÇÕES NAS COMPONENTES DE INTERESSE: APLICAÇÕES EM ANÁLISE DINÂMICA DE ESTILO PARA FUNDOS DE INVESTIMENTO BRASILEIROS

ADRIAN HERINGER PIZZINGA 05 April 2004 (has links)
[pt] Esta Dissertação procura, sob um enfoque freqüentista, discutir tecnologias para que se imponham restrições no processo de estimação de componentes não observáveis associadas a um modelo em Espaço de Estado (EE) arbitrário. O escopo do texto abrange desde procedimentos propostos pioneiramente por Howard Doran para restrições de igualdade, lineares e/ou não lineares, invariantes ou variantes no tempo, em modelos em EE lineares, até a adoção e o ajuste de estruturas mais delicadas, como os modelos em EE não lineares. Entende-se que estes últimos se constituem em uma alternativa relevante, caso seja requerida, por exemplo, a imposição de restrições de desigualdade. Técnicas e estratégias de implementação são apresentadas, debatidas e comparadas, incluindo-se também o processo de estimação de parâmetros desconhecidos e a questão de diagnósticos. Ao final, são apresentados exercícios empíricos com base nas tecnologias discutidas. Os modelos propostos para esta ilustração visam à realização da análise dinâmica de estilo baseado no retorno para carteiras de investimento brasileiras (a versão estática desses modelos fora introduzida por William Sharpe, para carteiras norte-americanas), os quais devem, eventualmente, abranger dois tipos de restrições nas componentes de interesse, quais sejam, um de igualdade e outro de desigualdade. / [en] This Dissertation aims, in a frequentist way, to discuss technologies for imposing restrictions in non-observable components associated with an arbitrary State Space (SS) model. The text scope ranges from procedures proposed originally by Howard Doran for equality, linear or non- linear, time invariant or time varying restrictions in a linear SS model, to adoption and estimation of more complicated structures like non-linear SS models. It is understood that these last ones are a relevant alternative, in cases of, for instance, inequality restrictions requirement. Implementation techniques and strategies are given, debated and compared, also including unknown parameters estimation and diagnostics analysis. At the end, empirical exercises are presented based on discussed methodologies. The proposed models for this illustration aim at dynamic return based style analysis for Brazilian investment portfolios (the static version of these models had been introduced by William Sharpe, for American portfolios), which shall eventually satisfy two kinds of restrictions on components of interest, namely one of equality and other of inequality.
300

Les généralisations des récursivités de Kalman et leurs applications / Kalman recursion generalizations and their applications

Kadhim, Sadeq 20 April 2018 (has links)
Nous considérions des modèles à espace d'état où les observations sont multicatégorielles et longitudinales, et l'état est décrit par des modèles du type CHARN. Nous estimons l'état au moyen des récursivités de Kalman généralisées. Celles-ci reposent sur l'application d'une variété de filtres particulaires et de l’algorithme EM. Nos résultats sont appliqués à l'estimation du trait latent en qualité de vie. Ce qui fournit une alternative et une généralisation des méthodes existantes dans la littérature. Ces résultats sont illustrés par des simulations numériques et une application aux données réelles sur la qualité de vie des femmes ayant subi une opération pour cause de cancer du sein / We consider state space models where the observations are multicategorical and longitudinal, and the state is described by CHARN models. We estimate the state by generalized Kalman recursions, which rely on a variety of particle filters and EM algorithm. Our results are applied to estimating the latent trait in quality of life, and this furnishes an alternative and a generalization of existing methods. These results are illustrated by numerical simulations and an application to real data in the quality of life of patients surged for breast cancer

Page generated in 0.0664 seconds