Thèses sur le sujet « Sensitivy analysis »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Sensitivy analysis ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Fruth, Jana. « Sensitivy analysis and graph-based methods for black-box functions with on application to sheet metal forming ». Thesis, Saint-Etienne, EMSE, 2015. http://www.theses.fr/2015EMSE0779/document.
Texte intégralThe general field of the thesis is the sensitivity analysis of black-box functions. Sensitivity analysis studies how the variation of the output can be apportioned to the variation of input sources. It is an important tool in the construction, analysis, and optimization of computer experiments.The total interaction index is presented, which can be used for the screening of interactions. Several variance-based estimation methods are suggested. Their properties are analyzed theoretically as well as on simulations.A further chapter concerns the sensitivity analysis for models that can take functions as input variables and return a scalar value as output. A very economical sequential approach is presented, which not only discovers the sensitivity of those functional variables as a whole but identifies relevant regions in the functional domain.As a third concept, support index functions, functions of sensitivity indices over the input distribution support, are suggested.Finally, all three methods are successfully applied in the sensitivity analysis of sheet metal forming models
Nilsson, Martina. « Mitochondrial DNA in Sensitive Forensic Analysis ». Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7458.
Texte intégralGalanopoulos, Aristides. « Analysis of frequency sensitive competitive learning / ». The Ohio State University, 1996. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487941504294837.
Texte intégralWan, Din Wan Ibrahim. « Sensitivity analysis intolerance allocation ». Thesis, Queen's University Belfast, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.675480.
Texte intégralMunster, Drayton William. « Sensitivity Enhanced Model Reduction ». Thesis, Virginia Tech, 2013. http://hdl.handle.net/10919/23169.
Texte intégralMaster of Science
Edlund, Hanna. « Sensitive Identification Tools in Forensic DNA Analysis ». Doctoral thesis, Uppsala universitet, Institutionen för genetik och patologi, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-131904.
Texte intégralMazanec, Josef. « Exploratory market structure analysis. Topology-sensitive methodology ». SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1999. http://epub.wu.ac.at/928/1/document.pdf.
Texte intégralSeries: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
Boccardo, Davidson Rodrigo [UNESP]. « Context-sensitive analysis of x86 obfuscated executables ». Universidade Estadual Paulista (UNESP), 2009. http://hdl.handle.net/11449/100286.
Texte intégralCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Ofusca c~ao de c odigo tem por nalidade di cultar a detec c~ao de propriedades intr nsecas de um algoritmo atrav es de altera c~oes em sua sintaxe, entretanto preservando sua sem antica. Desenvolvedores de software usam ofusca c~ao de c odigo para defender seus programas contra ataques de propriedade intelectual e para aumentar a seguran ca do c odigo. Por outro lado, programadores maliciosos geralmente ofuscam seus c odigos para esconder comportamento malicioso e para evitar detec c~ao pelos anti-v rus. Nesta tese, e introduzido um m etodo para realizar an alise com sensitividade ao contexto em bin arios com ofuscamento de chamada e retorno de procedimento. Para obter sem antica equivalente, estes bin arios utilizam opera c~oes diretamente na pilha ao inv es de instru c~oes convencionais de chamada e retorno de procedimento. No estado da arte atual, a de ni c~ao de sensitividade ao contexto est a associada com opera c~oes de chamada e retorno de procedimento, assim, an alises interprocedurais cl assicas n~ao s~ao con aveis para analisar bin arios cujas opera c~oes n~ao podem ser determinadas. Uma nova de ni c~ao de sensitividade ao contexto e introduzida, baseada no estado da pilha em qualquer instru c~ao. Enquanto mudan cas em contextos a chamada de procedimento s~ao intrinsicamente relacionadas com transfer encia de controle, assim, podendo ser obtidas em termos de caminhos em um grafo de controle de uxo interprocedural, o mesmo n~ao e aplic avel para mudan cas em contextos a pilha. Um framework baseado em interpreta c~ao abstrata e desenvolvido para avaliar contexto baseado no estado da pilha e para derivar m etodos baseado em contextos a chamada de procedimento para uso com contextos baseado no estado da pilha. O metodo proposto n~ao requer o uso expl cito de instru c~oes de chamada e retorno de procedimento, por em depende do...
A code obfuscation intends to confuse a program in order to make it more di cult to understand while preserving its functionality. Programs may be obfuscated to protect intellectual property and to increase security of code. Programs may also be obfuscated to hide malicious behavior and to evade detection by anti-virus scanners. We introduce a method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations. These binaries may use direct stack operators instead of the native call and ret instructions to achieve equivalent behavior. Since de nition of context-sensitivity and algorithms for context-sensitive analysis has thus far been based on the speci c semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in calling-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control ow graph (ICFG), the same is not true for changes in stackcontext. An abstract interpretation based framework is developed to reason about stackcontext and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. This analysis requires the knowledge of how the stack, rather the stack pointer, is represented and on the knowledge of operators that manipulate the stack pointer. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the contextsensitive version of the algorithm generates more precise results and is also computationally more e cient than its context-insensitive counterpart.
Boccardo, Davidson Rodrigo. « Context-Sensitive Analysis of x86 Obfuscated Executables ». Ilha Solteira : [s.n.], 2009. http://hdl.handle.net/11449/100286.
Texte intégralBanca: Sergio Azevedo de Oliveira
Banca: Francisco Villarreal Alvarado
Banca: Rodolfo Jardim Azevedo
Banca: André Luiz Moura dos Santos
Resumo: Ofusca c~ao de c odigo tem por nalidade di cultar a detec c~ao de propriedades intr nsecas de um algoritmo atrav es de altera c~oes em sua sintaxe, entretanto preservando sua sem^antica. Desenvolvedores de software usam ofusca c~ao de c odigo para defender seus programas contra ataques de propriedade intelectual e para aumentar a seguran ca do c odigo. Por outro lado, programadores maliciosos geralmente ofuscam seus c odigos para esconder comportamento malicioso e para evitar detec c~ao pelos anti-v rus. Nesta tese, e introduzido um m etodo para realizar an alise com sensitividade ao contexto em bin arios com ofuscamento de chamada e retorno de procedimento. Para obter sem^antica equivalente, estes bin arios utilizam opera c~oes diretamente na pilha ao inv es de instru c~oes convencionais de chamada e retorno de procedimento. No estado da arte atual, a de ni c~ao de sensitividade ao contexto est a associada com opera c~oes de chamada e retorno de procedimento, assim, an alises interprocedurais cl assicas n~ao s~ao con aveis para analisar bin arios cujas opera c~oes n~ao podem ser determinadas. Uma nova de ni c~ao de sensitividade ao contexto e introduzida, baseada no estado da pilha em qualquer instru c~ao. Enquanto mudan cas em contextos a chamada de procedimento s~ao intrinsicamente relacionadas com transfer^encia de controle, assim, podendo ser obtidas em termos de caminhos em um grafo de controle de uxo interprocedural, o mesmo n~ao e aplic avel para mudan cas em contextos a pilha. Um framework baseado em interpreta c~ao abstrata e desenvolvido para avaliar contexto baseado no estado da pilha e para derivar m etodos baseado em contextos a chamada de procedimento para uso com contextos baseado no estado da pilha. O metodo proposto n~ao requer o uso expl cito de instru c~oes de chamada e retorno de procedimento, por em depende do... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: A code obfuscation intends to confuse a program in order to make it more di cult to understand while preserving its functionality. Programs may be obfuscated to protect intellectual property and to increase security of code. Programs may also be obfuscated to hide malicious behavior and to evade detection by anti-virus scanners. We introduce a method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations. These binaries may use direct stack operators instead of the native call and ret instructions to achieve equivalent behavior. Since de nition of context-sensitivity and algorithms for context-sensitive analysis has thus far been based on the speci c semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in calling-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control ow graph (ICFG), the same is not true for changes in stackcontext. An abstract interpretation based framework is developed to reason about stackcontext and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. This analysis requires the knowledge of how the stack, rather the stack pointer, is represented and on the knowledge of operators that manipulate the stack pointer. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the contextsensitive version of the algorithm generates more precise results and is also computationally more e cient than its context-insensitive counterpart.
Doutor
Gasparini, Luca. « Severity sensitive norm analysis and decision making ». Thesis, University of Aberdeen, 2017. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=231873.
Texte intégralPoveda, David. « Sensitivity analysis of capital projects ». Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/27990.
Texte intégralApplied Science, Faculty of
Civil Engineering, Department of
Graduate
Faria, Jairo Rocha de. « Second order topological sensitivity analysis ». Laboratório Nacional de Computação Científica, 2008. http://www.lncc.br/tdmc/tde_busca/arquivo.php?codArquivo=141.
Texte intégralA derivada topológica fornece a sensibilidade de uma dada função custo quando uma pertubação não suave e infinitesimal (furo ou inclusão, por exemplo) é introduzida. Classicamente, esta derivada vem do segundo termo da expansão assintótica topológica considerando-se apenas pertubações infinitesimais. No entanto, em aplicações práticas, é necessário considerar pertubação de tamanho finito. Motivado por este fato, o presente trabalho tem como objetivo fundamental introduzir o conceito de derivadas topológicas de ordem superiores, o que permite considerar mais termos na expansão assintótica topológica. Em particular, observa-se que o topological-shape sensitivity method pode ser naturalmente estendido para o cálculo destes novos termos, resultando em uma metodologia sistemática de análise de sensibilidade topológica de ordem superior. Para se apresentar essas idéias, inicialmente essa técnica é verificada através de alguns problemas que admitem solução exata, onde se calcula explicitamente a expansão assintótica topológica até terceira ordem. Posteriormente, considera-se a equação de Laplace bidimensional, cujo domínio é topologicamente pertubado pela introdução de um furo com condição de contorno de Neumann ou de Dirichlet homogêneas, ou ainda de uma inclusão com propriedade física distinta do meio. Nesse caso, são calculadas explicitamente as derivadas topológicas de primeira e segunda ordens. Com os resultados obtidos em todos os casos, estuda-se a influência dos termos de ordem superiores na expansão assintótica topológica, através de experimentos numéricos. Em particular, observa-se que esses novos termos, além de permitir considerar pertubações de tamanho finito, desempenham ainda um importante papel tanto como fator de correção da expansão assintótica topológica, quanto como direção de descida em processos de otimização. Finalmente, cabe mencionar que a metodologia desenvolvida neste trabalho apresenta um grande potencial para aplicação na otimização e em algoritimos de reconstrução.
Witzgall, Zachary F. « Parametric sensitivity analysis of microscrews ». Morgantown, W. Va. : [West Virginia University Libraries], 2006. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=4892.
Texte intégralTitle from document title page. Document formatted into pages; contains xi, 73 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 52-53).
鄧國良 et Kwok-leong Tang. « Sensitivity analysis of bootstrap methods ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1993. http://hub.hku.hk/bib/B31977479.
Texte intégralFang, Xinding S. M. Massachusetts Institute of Technology. « Sensitivity analysis of fracture scattering ». Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/59789.
Texte intégralCataloged from PDF version of thesis.
Includes bibliographical references (p. 40-42).
We use a 2-D finite difference method to numerically calculate the seismic response of a single finite fracture in a homogeneous media. In our experiments, we use a point explosive source and ignore the free surface effect, so the fracture scattering wave field contains two parts: P-to-P scattering and P-to-S scattering. We vary the fracture compliance within a range considered appropriate for field observations, 10-12 m/Pa to 10-9 m/Pa, and investigate the variation of the scattering pattern of a single fracture as a function of normal and tangential fracture compliance. We show that P-to-P and P-to-S fracture scattering patterns are sensitive to the ratio of normal to tangential fracture compliance and different incident angle, while radiation pattern amplitudes scale as the square of the compliance. We find that, for a vertical fracture system, if the source is located at the surface, most of the energy scattered by a fracture propagates downwards, specifically, the P-to-P scattering energy propagates down and forward while the P-to-S scattering energy propagates down and backward. Therefore, most of the fracture scattered waves observed on the surface are, first scattered by fractures, and then reflected back to the surface by reflectors below the fracture zone, so the fracture scattered waves have complex ray paths and are contaminated by the reflectivity of matrix reflectors.
by Xinding Fang.
S.M.
Masinde, Brian. « Birds' Flight Range. : Sensitivity Analysis ». Thesis, Linköpings universitet, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-166248.
Texte intégralTang, Kwok-leong. « Sensitivity analysis of bootstrap methods ». [Hong Kong] : University of Hong Kong, 1993. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13793792.
Texte intégralCedrini, Luca. « Time Sensitive Networks : analysis, testing, scheduling and simulation ». Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22305/.
Texte intégralWang, Ruhuai. « Frequency domain fatigue analysis of dynamically sensitive structures ». Thesis, University College London (University of London), 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.264193.
Texte intégralWhaley, John. « Context-sensitive pointer analysis using binary decision diagrams / ». May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Texte intégralMuminovic, Mia, et Haris Suljic. « Performance Study and Analysis of Time Sensitive Networking ». Thesis, Mälardalens högskola, Inbyggda system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-44085.
Texte intégralDusastre, Vincent Jean-Marie. « Semiconducting oxide gas-sensitive resistors ». Thesis, University College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300516.
Texte intégralKennedy, Christopher Brandon. « GPT-Free Sensitivity Analysis for Reactor Depletion and Analysis ». Thesis, North Carolina State University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3710730.
Texte intégralIntroduced in this dissertation is a novel approach that forms a reduced-order model (ROM), based on subspace methods, that allows for the generation of response sensitivity profiles without the need to set up or solve the generalized inhomogeneous perturbation theory (GPT) equations. The new approach, denoted hereinafter as the generalized perturbation theory free (GPT-Free) approach, computes response sensitivity profiles in a manner that is independent of the number or type of responses, allowing for an efficient computation of sensitivities when many responses are required. Moreover, the reduction error associated with the ROM is quantified by means of a Wilks’ order statistics error metric denoted by the κ-metric.
Traditional GPT has been recognized as the most computationally efficient approach for performing sensitivity analyses of models with many input parameters, e.g. when forward sensitivity analyses are computationally overwhelming. However, most neutronics codes that can solve the fundamental (homogenous) adjoint eigenvalue problem do not have GPT (inhomogenous) capabilities unless envisioned during code development. Additionally, codes that use a stochastic algorithm, i.e. Monte Carlo methods, may have difficult or undefined GPT equations. When GPT calculations are available through software, the aforementioned efficiency gained from the GPT approach diminishes when the model has both many output responses and many input parameters. The GPT-Free approach addresses these limitations, first by only requiring the ability to compute the fundamental adjoint from perturbation theory, and second by constructing a ROM from fundamental adjoint calculations, constraining input parameters to a subspace. This approach bypasses the requirement to perform GPT calculations while simultaneously reducing the number of simulations required.
In addition to the reduction of simulations, a major benefit of the GPT-Free approach is explicit control of the reduced order model (ROM) error. When building a subspace using the GPT-Free approach, the reduction error can be selected based on an error tolerance for generic flux response-integrals. The GPT-Free approach then solves the fundamental adjoint equation with randomly generated sets of input parameters. Using properties from linear algebra, the fundamental k-eigenvalue sensitivities, spanned by the various randomly generated models, can be related to response sensitivity profiles by a change of basis. These sensitivity profiles are the first-order derivatives of responses to input parameters. The quality of the basis is evaluated using the κ-metric, developed from Wilks’ order statistics, on the user-defined response functionals that involve the flux state-space. Because the κ-metric is formed from Wilks’ order statistics, a probability-confidence interval can be established around the reduction error based on user-defined responses such as fuel-flux, max-flux error, or other generic inner products requiring the flux. In general, The GPT-Free approach will produce a ROM with a quantifiable, user-specified reduction error.
This dissertation demonstrates the GPT-Free approach for steady state and depletion reactor calculations modeled by SCALE6, an analysis tool developed by Oak Ridge National Laboratory. Future work includes the development of GPT-Free for new Monte Carlo methods where the fundamental adjoint is available. Additionally, the approach in this dissertation examines only the first derivatives of responses, the response sensitivity profile; extension and/or generalization of the GPT-Free approach to higher order response sensitivity profiles is natural area for future research.
Guo, Jia. « Uncertainty analysis and sensitivity analysis for multidisciplinary systems design ». Diss., Rolla, Mo. : Missouri University of Science and Technology, 2008. http://scholarsmine.mst.edu/thesis/pdf/Guo_09007dcc8066e905.pdf.
Texte intégralVita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed May 28, 2009) Includes bibliographical references.
Konarski, Roman. « Sensitivity analysis for structural equation models ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq22893.pdf.
Texte intégralSulieman, Hana. « Parametric sensitivity analysis in nonlinear regression ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0004/NQ27858.pdf.
Texte intégralYu, Jianbin. « Flexible reinforced pavement structure-sensitivity analysis ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0015/MQ52682.pdf.
Texte intégralKolen, A. W. J., Kan A. H. G. Rinnooy, Hoesel C. P. M. Van et Albert Wagelmans. « Sensitivity Analysis of List Scheduling Heuristics ». Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5268.
Texte intégralMaginot, Jeremy. « Sensitivity analysis for multidisciplinary design optmization ». Thesis, Cranfield University, 2007. http://dspace.lib.cranfield.ac.uk/handle/1826/5667.
Texte intégralNorth, Simon John. « High sensitivity mass spectrometric glycoprotein analysis ». Thesis, Imperial College London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.404993.
Texte intégralMaginot, Jeremy. « Sensitivity analysis for multidisciplinary design optimization ». Thesis, Cranfield University, 2007. http://dspace.lib.cranfield.ac.uk/handle/1826/5667.
Texte intégralJohnson, Timothy J. « Sensitivity analysis of transputer workfarm topologies ». Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/27258.
Texte intégralKhan, Kamil Ahmad. « Sensitivity analysis for nonsmooth dynamic systems ». Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/98156.
Texte intégralCataloged from PDF version of thesis.
Includes bibliographical references (pages 369-377).
Nonsmoothness in dynamic process models can hinder conventional methods for simulation, sensitivity analysis, and optimization, and can be introduced, for example, by transitions in flow regime or thermodynamic phase, or through discrete changes in the operating mode of a process. While dedicated numerical methods exist for nonsmooth problems, these methods require generalized derivative information that can be difficult to furnish. This thesis presents some of the first automatable methods for computing these generalized derivatives. Firstly, Nesterov's lexicographic derivatives are shown to be elements of the plenary hull of Clarke's generalized Jacobian whenever they exist. Lexicographic derivatives thus provide useful local sensitivity information for use in numerical methods for nonsmooth problems. A vector forward mode of automatic differentiation is developed and implemented to evaluate lexicographic derivatives for finite compositions of simple lexicographically smooth functions, including the standard arithmetic operations, trigonometric functions, exp / log, piecewise differentiable functions such as the absolute-value function, and other nonsmooth functions such as the Euclidean norm. This method is accurate, automatable, and computationally inexpensive. Next, given a parametric ordinary differential equation (ODE) with a lexicographically smooth right-hand side function, parametric lexicographic derivatives of a solution trajectory are described in terms of the unique solution of a certain auxiliary ODE. A numerical method is developed and implemented to solve this auxiliary ODE, when the right-hand side function for the original ODE is a composition of absolute-value functions and analytic functions. Computationally tractable sufficient conditions are also presented for differentiability of the original ODE solution with respect to system parameters. Sufficient conditions are developed under which local inverse and implicit functions are lexicographically smooth. These conditions are combined with the results above to describe parametric lexicographic derivatives for certain hybrid discrete/ continuous systems, including some systems whose discrete mode trajectories change when parameters are perturbed. Lastly, to eliminate a particular source of nonsmoothness, a variant of McCormick's convex relaxation scheme is developed and implemented for use in global optimization methods. This variant produces twice-continuously differentiable convex underestimators for composite functions, while retaining the advantageous computational properties of McCormick's original scheme. Gradients are readily computed for these underestimators using automatic differentiation.
by Kamil Ahmad Khan.
Ph. D.
Saxena, Vibhu Prakash. « Sensitivity analysis of oscillating hybrid systems ». Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/61899.
Texte intégralCataloged from PDF version of thesis.
Includes bibliographical references (p. 137-140).
Many models of physical systems oscillate periodically and exhibit both discrete-state and continuous-state dynamics. These systems are called oscillating hybrid systems and find applications in diverse areas of science and engineering, including robotics, power systems, systems biology, and so on. A useful tool that can provide valuable insights into the influence of parameters on the dynamic behavior of such systems is sensitivity analysis. A theory for sensitivity analysis with respect to the initial conditions and/or parameters of oscillating hybrid systems is developed and discussed. Boundary-value formulations are presented for initial conditions, period, period sensitivity and initial conditions for the sensitivities. A difference equation analysis of general homogeneous equations and parametric sensitivity equations with linear periodic piecewise continuous coefficients is presented. It is noted that the monodromy matrix for these systems is not a fundamental matrix evaluated after one period, but depends on one. A three part decomposition of the sensitivities is presented based on the analysis. These three parts classify the influence of the parameters on the period, amplitude and relative phase of the limit-cycles of hybrid systems, respectively. The theory developed is then applied to the computation of sensitivity information for some examples of oscillating hybrid systems using existing numerical techniques and methods. The relevant information given by the sensitivity trajectory and its parts can be used in algorithms for different applications such as parameter estimation, control system design, stability analysis and dynamic optimization.
by Vibhu Prakash Saxena.
S.M.
Siannis, Fotios. « Sensitivity analysis for correlated survival models ». Thesis, University of Warwick, 2001. http://wrap.warwick.ac.uk/78861/.
Texte intégralSantos, Miguel Duque. « UK pension funds : liability sensitivity analysis ». Master's thesis, Instituto Superior de Economia e Gestão, 2019. http://hdl.handle.net/10400.5/19509.
Texte intégralNo Reino Unido, muitos empregadores oferecem aos seus empregados algum tipo de regime de pensões profissionais. Um destes tipos é o regime de pensões de benefício definido, isto é, quando um empregador promete pagar uma certa quantidade (definida) de benefícios de pensão ao empregado baseado no salário final e nos anos de serviço. Deste modo, neste tipo de regime de pensão profissional, o empregador suporta todo o risco, porque tem de garantir o pagamento dos benefícios de reforma aos membros quando eles vencem. Os atuários conseguem estimar os pagamentos futuros e descontá-los para a data atual. Este valor atual dos pagamentos futuros é chamado de responsabilidade e pode ser comparado com o montante de ativos para verificar se há dinheiro suficiente no presente para pagar os benefícios futuros prometidos. Contudo, a responsabilidade está sujeita a variações ao longo do tempo porque está exposta ao risco de juros e inflação. Tendo isto em conta, a Mercer desenvolveu uma estratégia de investimento sofisticada chamada "Liability Benchmark Portfolio" ou LBP que é uma carteira de investimentos de baixo risco composta por obrigações do governo de cupão zero que vão igualar aproximadamente as sensibilidades das responsabilidades a mudanças da taxa de inflação e de juro. A minha tarefa no estágio era calcular estas sensibilidades das responsabilidades, que são necessárias para que a equipa de investimentos consiga construir um LBP. Sendo assim, o risco vai ser reduzido e estamos mais perto de assegurar que os membros do fundo recebam os seus benefícios de pensão.
In the United Kingdom, most employers offer their employees some type of occupational pension scheme. One of these types is a Defined Benefit pension plan, this is when an employer promises to pay a certain (defined) amount of pension benefit to the employee based on the final salary and years of service. So, in this type of occupational pension scheme, the employers bear all the risk, as they have to ensure the payment of the retirement benefits to the members when they fall due. The Actuaries are able to estimate the future payments and discount them to a current date. This present value of the future payments is called the liability and can be compared with the amount of assets to check there is enough money in the present to pay the promised future benefits. However, the liability is subject to variation over time because it is exposed to interest and inflation risk. Taking this into account, Mercer developed a sophisticated investment strategy called the Liability Benchmark Portfolio or LBP which is a low risk investment portfolio composed by zero coupon government bonds that will closely match the sensitivities of the liabilities to shifts in the inflation and interest rate. My task in the internship was to calculate these sensitivities of the liabilities that are required by the investment team to be able to build an LBP. Therefore, the risk will be reduced and we are closer to ensure that the members of the fund will receive their pension benefits.
info:eu-repo/semantics/publishedVersion
Sen, Sharma Pradeep Kumar. « Sensitivity analysis of ship longitudinal strength ». Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/45183.
Texte intégralMaster of Science
DeBrunner, Victor Earl. « Sensitivity analysis of digital filter structures ». Thesis, Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/104319.
Texte intégralWycoff, Nathan Benjamin. « Gradient-Based Sensitivity Analysis with Kernels ». Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/104683.
Texte intégralDoctor of Philosophy
Increasingly, scientists and engineers developing new understanding or products rely on computers to simulate complex phenomena. Sometimes, these computer programs are so detailed that the amount of time they take to run becomes a serious issue. Surrogate modeling is the problem of trying to predict a computer experiment's result without having to actually run it, on the basis of having observed the behavior of similar simulations. Typically, computer experiments have different settings which induce different behavior. When there are many different settings to tweak, typical surrogate modeling approaches can struggle. In this dissertation, we develop a technique for deciding which input settings, or even which combinations of input settings, we should focus our attention on when trying to predict the output of the computer experiment. We then deploy this technique both to prediction of computer experiment outputs as well as to trying to find which of the input settings yields a particular desired result.
Kern, Simon. « Sensitivity Analysis in 3D Turbine CFD ». Thesis, KTH, Mekanik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210821.
Texte intégralIssac, Jason Cherian. « Sensitivity analysis of wing aeroelastic responses ». Diss., This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-06062008-164301/.
Texte intégralKovalov, Ievgen. « Context-sensitive Points-To Analysis : Comparing precision and scalability ». Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-18225.
Texte intégralWang, Mengchao. « Sensitivity analysis and evolutionary optimization for building design ». Thesis, Loughborough University, 2014. https://dspace.lboro.ac.uk/2134/16282.
Texte intégralSchmidt, Dirk. « Call path sensitive interprocedural alias analysis of C programs ». [S.l. : s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=957595891.
Texte intégralBallew, Nicholas D. « Development of a sensitive [delta]¹⁵ N analysis for photopigments / ». Electronic version (PDF), 2007. http://dl.uncw.edu/etd/2007-2/ballewn/nicholasballew.pdf.
Texte intégralSheehy, Noreen. « Analysis of AZT sensitive and resistant HIV-1 strains ». Thesis, University of Warwick, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308439.
Texte intégralFlory, Long Mrs. « A WEB PERSONALIZATION ARTIFACT FOR UTILITY-SENSITIVE REVIEW ANALYSIS ». VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3739.
Texte intégralCapozzi, Marco G. F. « FINITE ELEMENT ANALYSIS AND SENSITIVITY ANALYSIS FOR THE POTENTIAL EQUATION ». MSSTATE, 2004. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04222004-131403/.
Texte intégralRapadamnaba, Robert. « Uncertainty analysis, sensitivity analysis, and machine learning in cardiovascular biomechanics ». Thesis, Montpellier, 2020. http://www.theses.fr/2020MONTS058.
Texte intégralThis thesis follows on from a recent study conducted by a few researchers from University of Montpellier, with the aim of proposing to the scientific community an inversion procedure capable of noninvasively estimating patient-specific blood pressure in cerebral arteries. Its first objective is, on the one hand, to examine the accuracy and robustness of the inversion procedure proposed by these researchers with respect to various sources of uncertainty related to the models used, formulated assumptions and patient-specific clinical data, and on the other hand, to set a stopping criterion for the ensemble Kalman filter based algorithm used in their inversion procedure. For this purpose, uncertainty analysis and several sensitivity analyses are carried out. The second objective is to illustrate how machine learning, mainly focusing on convolutional neural networks, can be a very good alternative to the time-consuming and costly inversion procedure implemented by these researchers for cerebral blood pressure estimation.An approach taking into account the uncertainties related to the patient-specific medical images processing and the blood flow model assumptions, such as assumptions about boundary conditions, physical and physiological parameters, is first presented to quantify uncertainties in the inversion procedure outcomes. Uncertainties related to medical images segmentation are modelled using a Gaussian distribution and uncertainties related to modeling assumptions choice are analyzed by considering several possible hypothesis choice scenarii. From this approach, it emerges that the uncertainties on the procedure results are of the same order of magnitude as those related to segmentation errors. Furthermore, this analysis shows that the procedure outcomes are very sensitive to the assumptions made about the model boundary conditions. In particular, the choice of the symmetrical Windkessel boundary conditions for the model proves to be the most relevant for the case of the patient under study.Next, an approach for ranking the parameters estimated during the inversion procedure in order of importance and setting a stopping criterion for the algorithm used in the inversion procedure is presented. The results of this strategy show, on the one hand, that most of the model proximal resistances are the most important parameters for blood flow estimation in the internal carotid arteries and, on the other hand, that the inversion algorithm can be stopped as soon as a certain reasonable convergence threshold for the most influential parameter is reached.Finally, a new numerical platform, based on machine learning and allowing to estimate the patient-specific blood pressure in the cerebral arteries much faster than with the inversion procedure but with the same accuracy, is presented. The application of this platform to the patient-specific data used in the inversion procedure provides noninvasive and real-time estimate of patient-specific cerebral pressure consistent with the inversion procedure estimation
Counsil, Tyler I. « Real-time RNA-based amplification allows for sensitive forensic blood evidence analysis ». Virtual Press, 2008. http://liblink.bsu.edu/uhtbin/catkey/1391475.
Texte intégralDepartment of Biology