Over the last two decades, chip design has been conducted at the register transfer (RT) Level using Hardware Descriptive Languages (HDL), such as VHDL and Verilog. The modeling at the behavioral level not only allows for better representation and understanding of the design, but also allows for encapsulation of the sub-modules as well, thus increasing productivity. Despite these benefits, validating a RTL design is not necessarily easier. Today, design validation is considered one of the most time and resource consuming aspects of hardware design. The high costs associated with late detection of bugs can be enormous. Together with stringent time to market factors, the need to guarantee the correct functionality of the design is more critical than ever. The work done in this thesis tackles the problem of RTL design validation and presents new frameworks for functional test generation. We use branch coverage as our metric to evaluate the quality of the generated test stimuli. The initial effort for test generation utilized simulation based techniques because of their scalability with design size and ease of use. However, simulation based methods work on input spaces rather than the DUT's state space and often fail to traverse very narrow search paths in large input spaces. To encounter this problem and enhance the ability of test generation framework, in the following work in this thesis, certain design semantics are statically extracted and recurrence relationships between different variables are mined. Information such as relations among variables and loops can be extremely valuable from test generation point of view. The simulation based method is hybridized with Z3 based symbolic backward execution engine with feedback among different stages. The hybridized method performs loop abstraction and is able to traverse narrow design paths without performing costly circuit analysis or explicit loop unrolling. Also structural and functional unreachable branches are identified during the process of test generation. Experimental results show that the proposed techniques are able to achieve high branch coverage on several ITC'99 benchmark circuits and their modified variants, with significant speed up and reduction in the sequence length. / Master of Science

Este trabalho descreve uma abordagem do método primal-dual barreira logarítmica (MPDBL) associado ao método de Newton modificado para a resolução do problema de fluxo de potência para sistemas de distribuição radial. Também foi realizado um estudo comparativo com duas técnicas clássicas de solução do problema de fluxo potência para redes de distribuição radial. São os métodos: Backward/Forward Sweep e o método proposto por M. Baran e F. Wu, que é baseado na técnica de Newton-Raphson. Este método utiliza uma matriz Jacobiana modificada que atende a característica radial dos sistemas de distribuição. Nos testes comparativos serão considerados todos os parâmetros do sistema. Os algoritmos de solução serão analisados em suas propriedades de convergência e será realizado um teste de robustez. Os resultados dos testes realizados em 4 sistemas (4, 10, 34 e 70 barras) e o teste comparativo entre os métodos evidenciam a melhor metodologia na solução do problema de fluxo de potência para sistemas radiais / This work describes an approach on primal-dual logarithmic barrier method (PDLBM) associate to the method of Newton modified for the resolution of the problem of power flow for radial distribution systems. Also a comparative study with two classic techniques of solution of the flow problem was carried through power for nets of radial distribution. They are the methods: Backward/Forward Sweep and the method considered for M. Baran and F. Wu, that is based on the technique of Newton-Raphson. This method uses modified Jacobiana matrix that takes care of the radial characteristic of the distribution systems. In the comparative tests all will be considered the parameters of the system. The solution algorithms will be analyzed in its properties of convergence and will be carried through a robustness test. The results of the tests carried through in 4 systems (4, 10, 34 and 70 bus) and the comparative test between the methods evidence the best methodology in the solution of the problem of power flow for radial systems

In this thesis we study two probabilistic models defined on graphs: the Stochastic Block model and the Exponential Random Graph. Therefore, this thesis is divided in two parts. In the first part, we introduce the Krichevsky-Trofimov estimator for the number of communities in the Stochastic Block Model and prove its eventual almost sure convergence to the underlying number of communities, without assuming a known upper bound on that quantity. In the second part of this thesis we address the perfect simulation problem for the Exponential random graph model. We propose an algorithm based on the Coupling From The Past algorithm using a Glauber dynamics. This algorithm is efficient in the case of monotone models. We prove that this is the case for a subset of the parametric space. We also propose an algorithm based on the Backward and Forward algorithm that can be applied for monotone and non monotone models. We prove the existence of an upper bound for the expected running time of both algorithms. / Nessa tese estudamos dois modelos probabilísticos definidos em grafos: o modelo estocástico por blocos e o modelo de grafos exponenciais. Dessa forma, essa tese está dividida em duas partes. Na primeira parte nós propomos um estimador penalizado baseado na mistura de Krichevsky-Trofimov para o número de comunidades do modelo estocástico por blocos e provamos sua convergência quase certa sem considerar um limitante conhecido para o número de comunidades. Na segunda parte dessa tese nós abordamos o problema de simulação perfeita para o modelo de grafos aleatórios Exponenciais. Nós propomos um algoritmo de simulação perfeita baseado no algoritmo Coupling From the Past usando a dinâmica de Glauber. Esse algoritmo é eficiente apenas no caso em que o modelo é monotóno e nós provamos que esse é o caso para um subconjunto do espaço paramétrico. Nós também propomos um algoritmo de simulação perfeita baseado no algoritmo Backward and Forward que pode ser aplicado à modelos monótonos e não monótonos. Nós provamos a existência de um limitante superior para o número esperado de passos de ambos os algoritmos.

Cette thèse aborde deux sujets de recherches, le premier est sur l’existence et l’unicité des solutions des Équations Différentielles Doublement Stochastiques Rétrogrades (EDDSRs) et les Équations aux Dérivées partielles Stochastiques (EDPSs) multidimensionnelles à croissance surlinéaire. Le deuxième établit l’existence d’un contrôle optimal strict pour un système controlé dirigé par des équations différentielles stochastiques progressives rétrogrades (EDSPRs) couplées dans deux cas de diffusions dégénérée et non dégénérée.• Existence et unicité des solutions des EDDSRs multidimensionnels :Nous considérons EDDSR avec un générateur de croissance surlinéaire et une donnée terminale de carré intégrable. Nous introduisons une nouvelle condition locale sur le générateur et nous montrons qu’elle assure l’existence, l’unicité et la stabilité des solutions. Même si notre intérêt porte sur le cas multidimensionnel, notre résultat est également nouveau en dimension un. Comme application, nous établissons l’existence et l’unicité des solutions des EDPS semi-linéaires.• Contrôle des EDSPR couplées :Nous étudions un problème de contrôle avec une fonctionnelle coût non linéaire dont le système contrôlé est dirigé par une EDSPR couplée. L’objective de ce travail est d’établir l’existence d’un contrôle optimal dans la classe des contrôle stricts, donc on montre que ce contrôle vérifie notre équation et qu’il minimise la fonctionnelle coût. La méthode consiste à approcher notre système par une suite de systèmes réguliers et on montre la convergence. En passant à la limite, sous des hypothèses de convexité, on obtient l’existence d’un contrôle optimal strict. on suit cette méthode théorique pour deux cas différents de diffusions dégénérée et non dégénérée. / In this Phd thesis, we considers two parts. The first one establish the existence and the uniquness of the solutions of multidimensional backward doubly stochastic differential equations (BDSDEs in short) and the stochastic partial differential equations (SPDEs in short) in the superlinear growth generators. In the second part, we study the stochastic controls problems driven by a coupled Forward-Backward stochastic differentialequations (FBSDEs in short).• BDSDEs and SPDEs with a superlinear growth generators :We deal with multidimensional BDSDE with a superlinear growth generator and a square integrable terminal datum. We introduce new local conditions on the generator then we show that they ensure the existence and uniqueness as well as the stability of solutions. Our work go beyond the previous results on the subject. Although we are focused on multidimensional case, the uniqueness result we establish is new in one dimensional too. As application, we establish the existence and uniqueness of probabilistic solutions tosome semilinear SPDEs with superlinear growth generator. By probabilistic solution, we mean a solution which is representable throughout a BDSDEs.• Controlled coupled FBSDEs :We establish the existence of an optimal control for a system driven by a coupled FBDSE. The cost functional is defined as the initial value of the backward component of the solution. We construct a sequence of approximating controlled systems, for which we show the existence of a sequence of feedback optimal controls. By passing to the limit, we get the existence of a feedback optimal control. The convexity condition is used to ensure that the optimal control is strict. In this part, we study two cases of diffusions : degenerate and non-degenerate.

Cette thèse est consacrée à la recherche des zéros d'un opérateur maximal monotone structuré, à l'aide de systèmes dynamiques dissipatifs continus et discrets. Les solutions sont obtenues comme limites des trajectoires lorsque le temps t tend vers l'infini. On s'intéressera principalement aux dynamiques obtenues par régularisation de type Levenberg-Marquardt de la méthode de Newton. On décrira aussi les approches basées sur des dynamiques voisines.Dans un cadre Hilbertien, on s'intéresse à la recherche des zéros de l'opérateur maximal monotone structuré M = A + B, où A est un opérateur maximal monotone général et B est un opérateur monotone Lipschitzien. Nous introduisons des dynamiques continues et discrètes de type Newton régularisé faisant intervenir d'une façon séparée les résolvantes de l'opérateur A (implicites), et des évaluations de B (explicites). A l'aide de la représentation de Minty de l'opérateur A comme une variété Lipschitzienne, nous reformulons ces dynamiques sous une forme relevant du théorème de Cauchy-Lipschitz. Nous nous intéressons au cas particulier où A est le sous différentiel d'une fonction convexe, semi-continue inférieurement, et propre, et B est le gradient d'une fonction convexe, différentiable. Nous étudions le comportement asymptotique des trajectoires. Lorsque le terme de régularisation ne tend pas trop vite vers zéro, et en s'appuyant sur une analyse asymptotique de type Lyapunov, nous montrons la convergence des trajectoires. Par ailleurs, nous montrons la dépendance Lipschitzienne des trajectoires par rapport au terme de régularisation.Puis nous élargissons notre étude en considérant différentes classes de systèmes dynamiques visant à résoudre les inclusions monotones gouvernées par un opérateur maximal monotone structuré M = $partialPhi$+ B, où $partialPhi$ désigne le sous différentiel d'une fonction convexe, semicontinue inférieurement, et propre, et B est un opérateur monotone cocoercif. En s'appuyant sur une analyse asymptotique de type Lyapunov, nous étudions le comportement asymptotique des trajectoires de ces systèmes. La discrétisation temporelle de ces dynamiques fournit desalgorithmes forward-backward (certains nouveaux ).Finalement, nous nous intéressons à l'étude du comportement asymptotique des trajectoires de systèmes dynamiques de type Newton régularisé, dans lesquels on introduit un terme supplémentaire de viscosité évanescente de type Tikhonov. On obtient ainsi la sélection asymptotique d'une solution de norme minimale. / This thesis is devoted to finding zeroes of structured maximal monotone operators, by using discrete and continuous dissipative dynamical systems. The solutions are obtained as the limits of trajectories when the time t tends towards infinity.We pay special attention to the dynamics that are obtained by Levenberg-Marquardt regularization of Newton's method. We also revisit the approaches based on some related dynamical systems.In a Hilbert framework, we are interested in finding zeroes of a structured maximal monotone operator M = A + B, where A is a general maximal monotone operator, and B is monotone and locally Lipschitz continuous. We introduce discrete and continuous dynamical systems which are linked to Newton's method. They involve separately B and the resolvents of A, and are designed to splitting methods. Based on the Minty representation of A as a Lipschitz manifold, we show that these dynamics can be formulated as differential systems, which are relevant to the Cauchy-Lipschitz theorem. We focus on the particular case where A is the subdifferential of a convex lower semicontinuous proper function, and B is the gradient of a convex, continuously differentiable function. We study the asymptotic behavior of trajectories. When the regularization parameter does not tend to zero too rapidly, and by using Lyapunov asymptotic analysis, we show the convergence of trajectories. Besides, we show the Lipschitz continuous dependence of the solution with respect to the regularization term.Then we extend our study by considering various classes of dynamical systems which aim at solving inclusions governed by structured monotone operators M = $partialPhi$+ B, where $partialPhi$ is the subdifferential of a convex lower semicontinuous function, and B is a monotone cocoercive operator. By a Lyapunov analysis, we show the convergence properties of the orbits of these systems. The time discretization of these dynamics gives various forward-backward splittingmethods (some new).Finally, we focus on the study of the asymptotic behavior of trajectories of the regularized Newton dynamics, in which we introduce an additional vanishing Tikhonov-like viscosity term.We thus obtain the asymptotic selection of the solution of minimal norm.

Självskattningsformulär utgör ett viktigt kliniskt redskap för både utredning och intervention av röstproblem men i nuläget är tillgången till olika formulär i Sverige begränsad då antalet validerade svenska översättningar är få. Syfte med studien var att översätta och preliminärt validera The Voice Symptom Scale (VoiSS) som består av 30 frågor tilldelade komponenterna Nedsättning, Emotionellt och Fysiskt. Den svenska versionen av VoiSS framtogs genom ”Forward-backward Translation” med en efterföljande pilotstudie. Sammanlagt deltog 203 vuxna individer som rekryterades via webb- och pappersenkät. Av dessa uppgav 86 deltagare att de upplevde röstbesvär. Resultaten visade på tydliga gruppskillnader där gruppen Med upplevda röstproblem genererade högre genomsnittliga svarspoäng än gruppen Utan upplevda röstproblem. Inga överlappningar kunde konstateras. En principalkomponentanalys (PCA) var i stort sett förenlig med en trekomponentstruktur som tillsammans med gruppseparationen visade på hög konstruktvaliditet. Vidare noterades samstämmighet mellan den svenska versionen och VoiSS-originalet. Sensitivitets- och specificitetsvärden bekräftade en hög diagnostisk validitet. Slutsatsen drogs att formuläret med god validitet förmår att diagnosticera upplevelse av röstproblem. Den preliminära valideringen visade således att den svenska versionen av VoiSS kan användas som ett instrument vid utredning av röstproblem men att ytterligare forskning behövs för att säkerställa formulärets användbarhet i klinisk verksamhet. / Self-assessment questionnaires are important clinical instruments for both investigation and intervention of voice problems but at date access to various questionnaires in Sweden is limited due to few validated translations. The objective of this study was to translate and preliminary validate the Voice Symptom Scale (VoiSS) consisting of 30 questions assigned Impairment, Emotional and Physical. The Swedish version of VoiSS was developed through ”Forward-backward Translation” followed by a pilot study. The questionnaire was completed by a total of 203 adults who were recruited by web and paper survey. Out of these, 86 participants experienced voice problems. Obvious group differences were observed in that the group With experienced voice problems generated higher mean scores than the group Without experienced voice problems. No overlaps were observed. A principal component analysis (PCA) was largely consistent with a three component structure that, combined with the group separation, affirmed high construct validity. Moreover, concurrence between the Swedish version and the VoiSS-original was found. Calculated values of sensitivity and specificity confirmed a high diagnostic validity. The conclusion was made that the self-assessment questionnaire with good validity was able to diagnose experience of voice problems. In conclusion, preliminary validation showed that the Swedish version of VoiSS can be used as a diagnostic tool in assessing voice problems. However, more research needs to be done to ensure the questionnaires adaptation to clinical context.

Este trabalho descreve uma abordagem do método primal-dual barreira logarítmica (MPDBL) associado ao método de Newton modificado para a resolução do problema de fluxo de potência para sistemas de distribuição radial. Também foi realizado um estudo comparativo com duas técnicas clássicas de solução do problema de fluxo potência para redes de distribuição radial. São os métodos: Backward/Forward Sweep e o método proposto por M. Baran e F. Wu, que é baseado na técnica de Newton-Raphson. Este método utiliza uma matriz Jacobiana modificada que atende a característica radial dos sistemas de distribuição. Nos testes comparativos serão considerados todos os parâmetros do sistema. Os algoritmos de solução serão analisados em suas propriedades de convergência e será realizado um teste de robustez. Os resultados dos testes realizados em 4 sistemas (4, 10, 34 e 70 barras) e o teste comparativo entre os métodos evidenciam a melhor metodologia na solução do problema de fluxo de potência para sistemas radiais / This work describes an approach on primal-dual logarithmic barrier method (PDLBM) associate to the method of Newton modified for the resolution of the problem of power flow for radial distribution systems. Also a comparative study with two classic techniques of solution of the flow problem was carried through power for nets of radial distribution. They are the methods: Backward/Forward Sweep and the method considered for M. Baran and F. Wu, that is based on the technique of Newton-Raphson. This method uses modified Jacobiana matrix that takes care of the radial characteristic of the distribution systems. In the comparative tests all will be considered the parameters of the system. The solution algorithms will be analyzed in its properties of convergence and will be carried through a robustness test. The results of the tests carried through in 4 systems (4, 10, 34 and 70 bus) and the comparative test between the methods evidence the best methodology in the solution of the problem of power flow for radial systems

In this thesis we study two probabilistic models defined on graphs: the Stochastic Block model and the Exponential Random Graph. Therefore, this thesis is divided in two parts. In the first part, we introduce the Krichevsky-Trofimov estimator for the number of communities in the Stochastic Block Model and prove its eventual almost sure convergence to the underlying number of communities, without assuming a known upper bound on that quantity. In the second part of this thesis we address the perfect simulation problem for the Exponential random graph model. We propose an algorithm based on the Coupling From The Past algorithm using a Glauber dynamics. This algorithm is efficient in the case of monotone models. We prove that this is the case for a subset of the parametric space. We also propose an algorithm based on the Backward and Forward algorithm that can be applied for monotone and non monotone models. We prove the existence of an upper bound for the expected running time of both algorithms. / Nessa tese estudamos dois modelos probabilísticos definidos em grafos: o modelo estocástico por blocos e o modelo de grafos exponenciais. Dessa forma, essa tese está dividida em duas partes. Na primeira parte nós propomos um estimador penalizado baseado na mistura de Krichevsky-Trofimov para o número de comunidades do modelo estocástico por blocos e provamos sua convergência quase certa sem considerar um limitante conhecido para o número de comunidades. Na segunda parte dessa tese nós abordamos o problema de simulação perfeita para o modelo de grafos aleatórios Exponenciais. Nós propomos um algoritmo de simulação perfeita baseado no algoritmo Coupling From the Past usando a dinâmica de Glauber. Esse algoritmo é eficiente apenas no caso em que o modelo é monotóno e nós provamos que esse é o caso para um subconjunto do espaço paramétrico. Nós também propomos um algoritmo de simulação perfeita baseado no algoritmo Backward and Forward que pode ser aplicado à modelos monótonos e não monótonos. Nós provamos a existência de um limitante superior para o número esperado de passos de ambos os algoritmos.

No description available.

This thesis explored the possibilities of using a Hidden Markov Model approach for multi-target localisation in an urban environment, with observations generated from Wi-Fi sensors. The area is modelled as a network of nodes and arcs, where the arcs represent sidewalks in the area and constitutes the hidden states in the model. The output of the model is the expected amount of people at each road segment throughout the day. In addition to this, two methods for analyzing the impact of events in the area are proposed. The first method is based on a time series analysis, and the second one is based on the updated transition matrix using the Baum-Welch algorithm. Both methods reveal which road segments are most heavily affected by a surge of traffic in the area, as well as potential bottleneck areas where congestion is likely to have occurred. / I det här examensarbetet har lokalisering av gångtrafikanter med hjälp av Hidden Markov Models utförts. Lokaliseringen är byggd på data från Wi-Fi sensorer i ett område i Stockholm. Området är modellerat som ett graf-baserat nätverk där linjerna mellan noderna representerar möjliga vägar för en person att befinna sig på. Resultatet för varje individ är aggregerat för att visa förväntat antal personer på varje segment över en hel dag. Två metoder för att analysera hur event påverkar området introduceras och beskrivs. Den första är baserad på tidsserieanalys och den andra är en maskinlärningsmetod som bygger på Baum-Welch algoritmen. Båda metoderna visar vilka segment som drabbas mest av en snabb ökning av trafik i området och var trängsel är troligt att förekomma.