Дисертації з теми "Combinatorial dynamical systems"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-39 дисертацій для дослідження на тему "Combinatorial dynamical systems".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Forrest, Alan Hunter. "Recurrence in dynamical systems : a combinatorial approach /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487682558446011.
Повний текст джерелаTiozzo, Giulio. "Entropy, Dimension and Combinatorial Moduli for One-Dimensional Dynamical Systems." Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:10891.
Повний текст джерелаMathematics
Ziegler, Caleb. "On Factors of Rank One Subshifts." Thesis, University of North Texas, 2018. https://digital.library.unt.edu/ark:/67531/metadc1157623/.
Повний текст джерелаRothlisberger, Matthew Samuel. "Ergodic and Combinatorial Proofs of van der Waerden's Theorem." Scholarship @ Claremont, 2010. http://scholarship.claremont.edu/cmc_theses/14.
Повний текст джерелаTastan, Mesut. "Analysis And Prediction Of Gene Expression Patterns By Dynamical Systems, And By A Combinatorial Algorithm." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606672/index.pdf.
Повний текст джерелаs method. Herewith, for stability analysis we apply modified Brayton and Tong algorithm to time-discrete dynamics in an extended space.
Paskauskas, Rytis. "Chaotic Scattering in Rydberg Atoms, Trapping in Molecules." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19809.
Повний текст джерелаLan, Yueheng. "Dynamical systems approach to one-dimensional spatiotemporal chaos -- A cyclist's view." Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-10282004-154606/unrestricted/lan%5Fyueheng%5F200412%5Fphd.pdf.
Повний текст джерелаJean Bellissard, Committee Member ; Turgay Uzer, Committee Member ; Roman Grigoriev, Committee Member ; Konstantin Mischaikow, Committee Member ; Predrag Cvitanovic, Committee Chair. Vita. Includes bibliographical references.
Demaeyer, Jonathan. "Escape rate theory for noisy dynamical systems." Doctoral thesis, Universite Libre de Bruxelles, 2013. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209440.
Повний текст джерелаIn many circumstances, escape is activated by the presence of noise, which may be of internal or external origin. This is the case for thermally activated escape over a potential energy barrier and, more generally, for noise-induced escape in continuous-time or discrete-time dynamics.
In the weak-noise limit, the escape rate is often observed to decrease exponentially with the inverse of the noise amplitude, a behaviour which is given by the van't Hoff-Arrhenius law of chemical kinetics. In particular, the two important quantities to determine in this case are the exponential dependence (the ``activation energy') and its prefactor.
The purpose of the present thesis is to develop an analytical method to determine these two quantities. We consider in particular one-dimensional continuous and discrete-time systems perturbed by Gaussian white noise and we focus on the escape from the basin of attraction of an attracting fixed point.
In both classes of systems, using path-integral methods, a formula is deduced for the noise-induced escape rate from the attracting fixed point across an unstable fixed point, which forms the boundary of the basin of attraction. The calculation starts from the trace formula for the eigenvalues of the operator ruling the time evolution of the probability density in noisy maps. The escape rate is determined by the loop formed by two heteroclinic orbits connecting back and forth the two fixed points in a two-dimensional auxiliary deterministic dynamical system. The escape rate is obtained, including the expression of the prefactor to van't Hoff-Arrhenius exponential factor./L'échappement des trajectoires est un phénomène omniprésent dans les systèmes dynamiques ouverts et les processus stochastiques. Si l'échappement se produit de façon répétitive pour un ensemble statistique de trajectoires, la population des trajectoires restantes subit souvent une décroissance exponentielle caractérisée par le taux d'échappement. L'inverse du taux d'échappement définit alors la durée de vie de l'état transitoire associé, ce qui représente une propriété intrinsèque du système. Ce paradigme est fondamental pour la théorie de la nucléation et, de manière générale, pour la théorie des taux de transitions en chimie, en physique et en biologie.
Dans de nombreux cas, l'échappement est induit par la présence de bruit, qui peut être d'origine interne ou externe. Ceci concerne en particulier l'échappement activé thermiquement à travers une barrière d'énergie potentielle, et plus généralement, l'échappement dû au bruit dans les systèmes dynamiques à temps continu ou à temps discret.
Dans la limite de faible bruit, on observe souvent une décroissance exponentielle du taux d'échappement en fonction de l'inverse de l'amplitude du bruit, un comportement qui est régi par la loi de van't Hoff-Arrhenius de la cinétique chimique. En particulier, les deux quantités importantes de cette loi sont le coefficient de la dépendance exponentielle (c'est-à-dire ``l'énergie d'activation') et son préfacteur.
L'objectif de cette thèse est de développer une théorie analytique pour déterminer ces deux quantités. La théorie que nous présentons concerne les systèmes unidimensionnels à temps continu ou discret perturbés par un bruit blanc gaussien et nous considérons le problème de l'échappement du bassin d'attraction d'un point fixe attractif. Pour s'échapper, les trajectoires du système bruité initialement contenues dans ce bassin d'attraction doivent alors traverser un point fixe instable qui forme la limite du bassin.
Dans le présent travail, et pour les deux types de systèmes, une formule est dérivée pour le taux d'échappement du point fixe attractif en utilisant des méthodes d'intégrales de chemin. Le calcul utilise la formule de trace pour les valeurs propres de l'opérateur gouvernant l'évolution temporelle de la densité de probabilité dans le système bruité. Le taux d'échappement est déterminé en considérant la boucle formée par deux orbites hétéroclines liant dans les deux sens les deux points fixes dans un système dynamique auxiliaire symplectique et bidimensionnel. On obtient alors le taux d'échappement, comprenant l'expression du préfacteur de l'exponentielle de la loi de van't Hoff-Arrhenius.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Nguyen, Rémi. "Dynamic combinatorial mesophases and self-replicating systems." Strasbourg, 2010. http://www.theses.fr/2010STRA6285.
Повний текст джерелаMy PhD work consisted in developing combinatorial dynamic systems of amphiphilic block copolymers to study their hierarchical self-organization processes in space and time. For this I combined reversible associations between hydrophobic and hydrophilic blocks, focusing on two possible kinds of control of these responsive systems: a) an external molecular control on the reversible covalent bonds between the blocks in order to favour the expression of a particular mesophase; and b) an internal supramolecular control driven by the preferential formation of a mesophase leading to spontaneous selection of its own composing blocks. During this work, I demonstrated for the first time the possibility to extend dynamic combinatorial chemistry to systems with phase micro-separation. For this, I developed a new type of dynamic molecules (Dynablocks) and I discovered some interesting behaviours from the mesophases I obtained, such as self-replication on a kinetic point of view, or selection/adaptation process within a mixture on a thermodynamic point of view. I also demonstrated that these to aspects could be coupled together in an auto-organization process. To characterize those complex mixtures, new analytical methods were developed for scattering techniques, based on linear combinations. This fundamental study opens a new field of investigation for dynamic combinatorial chemistry in relations with two important domains: a) material science and b) system chemistry – particularly minimal autonomous systems (i. E. Autopoietics systems)
Syzmczak, Andrzej. "Index pairs : from dynamics to combinatorics and back." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/28027.
Повний текст джерелаLudlow, Richard Frederick. "Molecular networks : from dynamic combinatorial libraries to complex systems." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611116.
Повний текст джерелаKwok, Terence 1973. "Neural networks with nonlinear system dynamics for combinatorial optimization." Monash University, School of Business Systems, 2001. http://arrow.monash.edu.au/hdl/1959.1/8928.
Повний текст джерелаAngelin, Marcus. "Discovery-Oriented Screening of Dynamic Systems: Combinatorial and Synthetic Applications." Doctoral thesis, KTH, Organisk kemi, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-12524.
Повний текст джерелаQC 20100628
Murfitt, Louise. "Discrete event dynamic systems in max-algebra : realisation and related combinatorial problems." Thesis, University of Birmingham, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368451.
Повний текст джерелаAtcher, Ubiergo Joan. "Disulfide-based dynamic combinatorial libraries of macrocyclic pseudopeptides as bio-inspired complex chemical systems." Doctoral thesis, Universitat de Barcelona, 2015. http://hdl.handle.net/10803/305491.
Повний текст джерелаLes quimioteques dinàmiques (DCLs de “dynamic combinatorial libraries”) estan formades per una mescla de compostos interconnectats per mitjà de processos químics reversibles. Aquests sistemes dinàmics presenten la capacitat d’adaptar la seva composició a la presència d’un estímul extern. L’objectiu principal d’aquesta tesi és utilitzar DCLs com a sistemes químics complexos pel modelatge experimental de diversos processos d’interès biològic. En el Capítol 1 es van dissenyar, sintetitzar i caracteritzar catorze ditiols amb informació estructural de tipus peptídic, cadenes laterals amb diferents càrregues i informació quiral. A continuació, en el Capítol 2, es van establir unes condicions experimentals adequades per a generar DCLs de disulfurs a partir de l’oxidació dels ditiols sintetitzats. En aquest sentit, l’ús de DMSO com a codissolvent orgànic va demostrar tenir una sèrie d’efectes beneficiosos. Seguidament, en el Capítol 3, es va utilitzar una DCL minimalista de disseny bioinspirat per a reproduir tendències adaptatives pròpies de processos evolutius biològics. Així, es va observar que els canvis que provoca l’increment de la salinitat en la composició d’una DCL de pseudopèptids macrocíclics, tenen una notable similitud amb l’evolució natural de les proteïnes dels microorganismes halòfils. En el Capítol 4 es va estudiar l’efecte del mateix estímul extern en la composició d’una DCL complexa formada per espècies amb diferents càrregues. S’evidencià que el comportament de cada membre de la quimioteca està determinat per la seva informació estructural i per les múltiples relacions coadaptatives que aquest estableix amb la resta de membres de la xarxa molecular. Finalment, en el Capítol 5, es va utilitzar una DCL minimalista formada per espècies estereoisomèriques per estudiar el fenomen d’autoordenació homoquiral.
Larsson, Rikard. "Dynamic Systems for Screening, Control and Identification of Protein-Ligand Interactions." Doctoral thesis, Stockholm : Kemi, Chemistry, Kungliga Tekniska högskolan, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4709.
Повний текст джерелаZhoroev, Tilekbek. "Controllability and Observability of Linear Nabla Discrete Fractional Systems." TopSCHOLAR®, 2019. https://digitalcommons.wku.edu/theses/3156.
Повний текст джерелаSchwarz, Felix Benjamin [Verfasser]. "Stimuli-Responsive Supramolecular Systems: From Dynamic Combinatorial Libraries to Photoswitchable Rotaxanes on Surfaces / Felix Benjamin Schwarz." Berlin : Freie Universität Berlin, 2017. http://d-nb.info/1125450347/34.
Повний текст джерелаRotondo, Pablo. "Probabilistic studies in number theory and word combinatorics : instances of dynamical analysis." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC213/document.
Повний текст джерелаDynamical Analysis incorporates tools from dynamical systems, namely theTransfer Operator, into the framework of Analytic Combinatorics, permitting the analysis of numerous algorithms and objects naturally associated with an underlying dynamical system.This dissertation presents, in the integrated framework of Dynamical Analysis, the probabilistic analysis of seemingly distinct problems in a unified way: the probabilistic study of the recurrence function of Sturmian words, and the probabilistic study of the Continued Logarithm algorithm.Sturmian words are a fundamental family of words in Word Combinatorics. They are in a precise sense the simplest infinite words that are not eventually periodic. Sturmian words have been well studied over the years, notably by Morse and Hedlund (1940) who demonstrated that they present a notable number theoretical characterization as discrete codings of lines with irrationalslope, relating them naturally to dynamical systems, in particular the Euclidean dynamical system. These words have never been studied from a probabilistic perspective. Here, we quantify the recurrence properties of a ``random'' Sturmian word, which are dictated by the so-called ``recurrence function''; we perform a complete asymptotic probabilistic study of this function, quantifying its mean and describing its distribution under two different probabilistic models, which present different virtues: one is a naturaly choice from an algorithmic point of view (but is innovative from the point of view of dynamical analysis), while the other allows a natural quantification of the worst-case growth of the recurrence function. We discuss the relation between these two distinct models and their respective techniques, explaining also how the two seemingly different techniques employed could be linked through the use of the Mellin transform. In this dissertation we also discuss our ongoing work regarding two special families of Sturmian words: those associated with a quadratic irrational slope, and those with a rational slope (not properly Sturmian). Our work seems to show the possibility of a unified study.The Continued Logarithm Algorithm, introduced by Gosper in Hakmem (1978) as a mutation of classical continued fractions, computes the greatest common divisor of two natural numbers by performing division-like steps involving only binary shifts and substractions. Its worst-case performance was studied recently by Shallit (2016), who showed a precise upper-bound for the number of steps and gave a family of inputs attaining this bound. In this dissertation we employ dynamical analysis to study the average running time of the algorithm, giving precise mathematical constants for the asymptotics, as well as other parameters of interest. The underlying dynamical system is akin to the Euclidean one, and was first studied by Chan (around 2005) from an ergodic, but the presence of powers of 2 in the quotients ingrains into the central parameters a dyadic flavour that cannot be grasped solely by studying this system. We thus introduce a dyadic component and deal with a two-component system. With this new mixed system at hand, we then provide a complete average-case analysis of the algorithm by Dynamical Analysis
Sakulsombat, Morakot. "Dynamic Systems: Evaluation, Screening and Synthetic Application." Doctoral thesis, KTH, Organisk kemi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-34100.
Повний текст джерелаQC 20110526
Zhao, Kun. "Mathematical Methods for Network Analysis, Proteomics and Disease Prevention." Digital Archive @ GSU, 2012. http://digitalarchive.gsu.edu/math_diss/6.
Повний текст джерелаEryuzlu, Menevse. "Two Generalizations of the Filippov Operation." TopSCHOLAR®, 2016. http://digitalcommons.wku.edu/theses/1593.
Повний текст джерелаDolce, Francesco. "Codes bifixes, combinatoire des mots et systèmes dynamiques symboliques." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1036/document.
Повний текст джерелаSets of words of linear complexity play an important role in combinatorics on words and symbolic dynamics.This family of sets includes set of factors of Sturmian and Arnoux-Rauzy words, interval exchange sets and primitive morphic sets, that is, sets of factors of fixed points of primitive morphisms.The leading issue of this thesis is the study of minimal dynamical systems, also defined equivalently as uniformly recurrent sets of words.As a main result, we consider a natural hierarchy of minimal systems containing neutral sets, tree sets and specular sets.Moreover, we connect the minimal systems to the free group using the notions of return words and basis of subroups of finite index.Symbolic dynamical systems arising from interval exchanges and linear involutions provide us geometrical examples of this kind of sets.One of the main tool used here is the study of possible extensions of a word in a set, that allows us to determine properties such as the factor complexity.In this manuscript we define the extension graph, an undirected graph associated to each word $w$ in a set $S$ which describes the possible extensions of $w$ in $S$ on the left and the right.In this thesis we present several classes of sets of words defined by the possible shapes that the graphs of elements in the set can have.One of the weakest condition that we will study is the neutrality condition: a word $w$ is neutral if the number of pairs $(a, b)$ of letters such that $awb in S$ is equal to the number of letters $a$ such that $aw in S$ plus the number of letters $b$ such that $wb in S$ minus 1.A set such that every nonempty word satisfies the neutrality condition is called a neutral set.A stronger condition is the tree condition: a word $w$ satisfies this condition if its extension graph is both acyclic and connected.A set is called a tree set if any nonempty word satisfies this condition.The family of recurrent tree sets appears as a the natural closure of two known families, namely the Arnoux-Rauzy sets and the interval exchange sets.We also introduce specular sets, a remarkable subfamily of the tree sets.These are subsets of groups which form a natural generalization of free groups.These sets of words are an abstract generalization of the natural codings of interval exchanges and of linear involutions.For each class of sets considered in this thesis, we prove several results concerning closure properties (under maximal bifix decoding or under taking derived words), cardinality of the bifix codes and set of return words in these sets, connection between return words and basis of the free groups, as well as between bifix codes and subgroup of the free group.Each of these results is proved under the weakest possible assumptions
Vongvilai, Pornrapee. "Dynamic Covalent Resolution: Applications in System Screening and Asymmetric Synthesis." Doctoral thesis, Stockholm : Skolan för kemivetenskap, Kungliga Tekniska högskolan, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-11200.
Повний текст джерелаKyriakoglou, Revekka. "Morphismes itérés, combinatoire des mots et systèmes dynamiques symboliques." Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC2050.
Повний текст джерелаThe current thesis focuses on the topic of combinatorics on words and symbolic dynamical systems. The symbolic dynamical systems are objects for encoding word trajectories in dynamic systems of transformations in topological spaces. Among these dynamical systems, well-known examples are given by Sturmial words and by exchange of intervals. The Sturmian words are related to discrete geometry algorithms and the exchange of intervals form an interesting class of dynamical systems. Furthermore, it should be mentioned that some exchange families provide promising generalizations of Sturmian words.The main subject of the thesis is the recognizability of words generated by primitive morphisms. The concept of recognizability of morphisms originates in the paper of Martin [1] under the term of determinization. The term was first used by Host in his paper on the Ergodic theory of Dynamical Systems[2]. The notion of recognizability came in full bloom after the interest shown by many scientists due to its various theoretical applications in various topics, from combinatorics on words to symbolic dynamics. A similar notion is that of circularity. The two terms are often, but not always used as synonymous. This lack of consistency along the literature could result in confusion. To the best of the author’s knowledge, there is not, as of yet, any study that collects those definitions and proves their equivalence or indicates the differences among them. This thesis provides a solid approach to this subject, using a coherent definition of recognizability and circularity.The notion of recognizability alongside a technique used in [3] were used in order to prove the decidability of different properties of extension graphs (defined in [4]) of elements of a language. Families of sets can be defined from properties of the extension graph of their elements, such as acyclic sets, tree sets, neutral sets, etc. More precisely, given a set of words S, one can associate with every word w ∈ S it's extension graph which describes the possible left and right extensions of w in S. We show how to use the recognizability to provide decidability of extension graphs. Furthermore, recognizability is used in is the subject of Profinite Semigroups. We describe the relationship between the recognizability of morphisms and properties of the free profinite semigroups [5].Bibliography[1] John C. Martin. Minimal flows arising from substitutions of non-constant length. Math. Systems Theory, 7:72–82, 1973.[2] B. Host. Valeurs propres des systèmes dynamiques définis par des substitu-tions de longueur variable. Ergodic Theory Dynam. Systems, 6(4):529–540,1986.[3] Klouda, K. and Starosta, Š. "Characterization of circular D0L systems.", arXiv preprint arXiv:1401.0038 (2013).[4] Berthé, V., De Felice, C., Dolce, F. et al. Monatsh Math (2015) 176: 521. https://doi.org/10.1007/s00605-014-0721-4[5]Kyriakoglou ,R., Perrin ,D. "Profinite semigroups", arXiv:1703.10088 (2017)[6]Almeida, J., "Profinite semigroups and applications" In Structural theory of automata, semigroups, and universal algebra, volume 207 of NATO Sci.43 Ser. II Math. Phys. Chem., pages 1–45. Springer, Dordrecht, 2005. Notes taken by Alfredo Costa
França, Fabricio Olivetti de. "Algoritmos bio-inspirados aplicados a otimização dinamica." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259091.
Повний текст джерелаDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-14T19:14:33Z (GMT). No. of bitstreams: 1 Franca_FabricioOlivettide_M.pdf: 2824607 bytes, checksum: 3de6277fbb2c8c3460d62b4d81d14f73 (MD5) Previous issue date: 2005
Resumo: Esta dissertação propõe algoritmos bio-inspirados para a solução de problemas de otimização dinâmica, ou seja, problemas em que a superfície de otimização no espaço de busca sofre variações diversas ao longo do tempo. Com a variação, no tempo, de número, posição e qualidade dos ótimos locais, as técnicas de programação matemática tendem a apresentar uma acentuada degradação de desempenho, pois geralmente foram concebidas para tratar do caso estático. Algoritmos populacionais, controle dinâmico do número de indivíduos na população, estratégias de busca local e uso eficaz de memória são requisitos desejados para o sucesso da otimização dinâmica, sendo contemplados nas propostas de solução implementadas nesta dissertação. Os algoritmos a serem apresentados e comparados com alternativas competitivas presentes na literatura são baseados em funcionalidades e estruturas de processamento de sistemas imunológicos e de colônias de formigas. Pelo fato de considerarem todos os requisitos para uma busca eficaz em ambientes dinâmicos, o desempenho dos algoritmos imuno-inspirados se mostrou superior em todos os critérios considerados para comparação dos resultados dos experimentos.
Abstract: This dissertation proposes bio-inspired algorithms to solve dynamic optimization problems, i.e., problems for which the optimization surface on the search space suffers several changes over time. With such variation of number, position and quality of local optima, mathematical programming techniques may present degradation of performance, because they were usually conceived to deal with static problems. Population-based algorithms, dynamic control of the population size, local search strategies and an efficient memory usage are desirable requirements to a proper treatment of dynamic optimization problems, thus being incorporated into the solution strategies implemented here. The algorithms to be presented, and compared with competitive alternatives available in the literature, are based on functionalities and processing structures of immune systems and ant colonies. Due to the capability of incorporating all the requirements for an efficient search on dynamic environments, the immune-inspired approaches overcome the others in all the performance criteria adopted to evaluate the experimental results.
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
Vizcaino, González José Federico. "Estratégias para redução de perdas técnicas e melhoria nas condições de operação de redes de distribuição de energia elétrica." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260382.
Повний текст джерелаTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-18T02:44:14Z (GMT). No. of bitstreams: 1 VizcainoGonzalez_JoseFederico_D.pdf: 9526841 bytes, checksum: 9fc3b73df592526f56693f9b329fc70c (MD5) Previous issue date: 2011
Resumo: O trabalho desenvolve alternativas de otimização combinatória para a redução de perdas técnicas e melhoria das condições de operação de sistemas de distribuição de energia elétrica. Sua principal contribuição é na área de redução dos fluxos de reativos através da instalação e controle de bancos de capacitores. Duas alternativas de otimização são desenvolvidas. A primeira, propõe um algoritmo genético híbrido com buscas locais nas representações fenotípicas e genotípicas das soluções. A segunda alternativa utiliza conceitos de programação dinâmica no projeto de algoritmos que encontram soluções ótimas globais para o problema de localização, dimensionamento e controle de capacitores. Outro algoritmo genético híbrido, para a instalação de reguladores de tensão, complementa a possibilidade de melhoria nos perfis de tensão proporcionada pelos capacitores. Os algoritmos baseados em programação dinâmica são de complexidade polinomial; adicionalmente, suas complexidades são lineares para instâncias reais. As características desses algoritmos estabelecem novas referências para a área de localização e controle de capacitores em sistemas de distribuição de energia elétrica, hoje povoada por métodos heurísticos
Abstract: This work develops combinatorial optimization alternatives for technical loss reduction and improvements on operational conditions of power distribution networks. Its main contribution is in the area of loss reduction by decreasing reactive flows, through allocation and control of shunt capacitors banks. Two optimization strategies are proposed. The first one develops a hybrid genetic algorithm with local searches in both genotypical and fenotypical representations of solutions. The second alternative uses dynamic programming concepts in the design of algorithms that unveil global optimal solutions for capacitor location, sizing and control. Another hybrid genetic algorithm for allocation of voltage regulators complements the improvement in voltage profiles obtained with the allocation of capacitors. The algorithms based on dynamic programming concepts have polynomial-time complexity; further, they have linear-time complexity for practical applications. Therefore, these algorithms establish a new reference for the area of shunt capacitors allocation and control on power distribution systems, which is today populated by heuristic methods
Doutorado
Energia Eletrica
Doutor em Engenharia Elétrica
Voshell, Sharon M. Gagné Michel R. "Molecular recognition in synthetic systems I. Rigidified dendritic systems for imparting enantioselective molecular recognition to platinum-containing molecularly imprinted polymers II. Using laser polarimetry to identify an enantioselective receptor for (-)-adenosine from a racemic dynamic combinatorial library /." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2006. http://dc.lib.unc.edu/u?/etd,618.
Повний текст джерелаTitle from electronic title page (viewed Oct. 10, 2007). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Chemistry." Discipline: Chemistry; Department/School: Chemistry.
Emme, Jordan. "Systèmes dynamiques substitutifs et renormalisation." Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4738.
Повний текст джерелаIn the present work we study substitutive dynamical systems. Historically, substitutions have been introduced in order to describe the sequence of the sum-of-digits mod 2 in base 2. We study some properties of densities of sets defined by sum-of-digits functions, sets which are linked with autocorrelations of some arithmétic functions. We prove that these densities are usually normally distributed. We also study the regularity of the pressure function in the framework of the thermodynamics formalism, introduced by Bowen, Ruelle and Sinaï, for a family of potentials defined in terms of distance to the attractor of the k-bonacci substitution. We also show that the iterations of the renormalisation operator defined by Baraviera, Leplaideur and Lopes converges towards a fixed point of this operator. Finally we study the regularity of some spectral measures associated to self-similar tilings using mostly works from Bufetov and Solomyak on the deviations of ergodic sums for the action of translations by vectors in R^d on self-similar tilings of R^d. We prove that, afeter renormalisation, these spectral measures behave like Radon measures around
Giscard, Pierre-Louis. "A graph theoretic approach to matrix functions and quantum dynamics." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:ceef15b0-eed2-4615-a9f2-f9efbef470c9.
Повний текст джерелаNguyen, Van Thé Lionel. "Théorie de Ramsey structurale et applications en dynamique topologique via la correspondance de Kechris-Pestov-Todorcevic." Habilitation à diriger des recherches, Aix-Marseille Université, 2013. http://tel.archives-ouvertes.fr/tel-00924106.
Повний текст джерелаVacher, Blandine. "Techniques d'optimisation appliquées au pilotage de la solution GTP X-PTS pour la préparation de commandes intégrant un ASRS." Thesis, Compiègne, 2020. http://www.theses.fr/2020COMP2566.
Повний текст джерелаThe work presented in this PhD thesis deals with optimization problems in the context of internal warehouse logistics. The field is subject to strong competition and extensive growth, driven by the growing needs of the market and favored by automation. SAVOYE builds warehouse storage handling equipment and offers its own GTP (Goods-To-Person) solution for order picking. The solution uses an Automated Storage and Retrieval System (ASRS) called X-Picking Tray System (X-PTS) and automatically routes loads to workstations via carousels to perform sequenced operations. It is a highly complex system of systems with many applications for operational research techniques. All this defines the applicative and theoretical scope of the work carried out in this thesis. In this thesis, we have first dealt with a specific scheduling Job Shop problem with precedence constraints. The particular context of this problem allowed us to solve it in polynomial time with exact algorithms. These algorithms made it possible to calculate the injection schedule of the loads coming from the different storage output streams to aggregate on a carousel in a given order. Thus, the inter-aisle management of the X-PTS storage was improved and the throughput of the load flow was maximized, from the storage to a station. In the sequel of this work, the radix sort LSD (Least Significant Digit) algorithm was studied and a dedicated online sorting algorithm was developed. The second one is used to drive autonomous sorting systems called Buffers Sequencers (BS), which are placed upstream of each workstation in the GTP solution. Finally, a sequencing problem was considered, consisting of finding a linear extension of a partial order minimizing a distance with a given order. An integer linear programming approach, different variants of dynamic programming and greedy algorithms were proposed to solve it. An efficient heuristic was developed based on iterative calls of dynamic programming routines, allowing to reach a solution close or equal to the optimum in a very short time. The application of this problem to the unordered output streams of X-PTS storage allows pre-sorting at the carousel level. The various solutions developed have been validated by simulation and some have been patented and/or already implemented in warehouses
Al-Hasani, Firas Ali Jawad. "Multiple Constant Multiplication Optimization Using Common Subexpression Elimination and Redundant Numbers." Thesis, University of Canterbury. Electrical and Computer Engineering, 2014. http://hdl.handle.net/10092/9054.
Повний текст джерелаWaserhole, Ariel. "Optimisation des systèmes de véhicules en libre service par la tarification." Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM049/document.
Повний текст джерелаOne way Vehicle Sharing Systems (VSS), in which users pick-up and return a vehicle in different places is a new type of transportation system that presents many advantages. However, even if advertising promotes an image of flexibility and price accessibility, in reality customers might not find a vehicle at the original station (which may be considered as an infinite price), or worse, a parking spot at destination. Since the first Bike Sharing Systems (BSS), problems of vehicles and parking spots availability have appeared crucial. We define the system performance as the number of trips sold (to be maximized). BSS performance is currently improved by vehicle relocation with trucks. Our scope is to focus on self regulating systems through pricing incentives, avoiding physical station balancing. The question we are investigating in this thesis is the following: Can a management of the incentives increases significantly the performance of the vehicle sharing systems?
"ANALYSIS AND PREDICTION OF GENE EXPRESSION PATTERNS BY DYNAMICAL SYSTEMS, AND BY A COMBINATORIAL ALGORITHM." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606672/index.pdf.
Повний текст джерела(8422929), Ivan Chio. "Some Connections Between Complex Dynamics and Statistical Mechanics." Thesis, 2020.
Знайти повний текст джерела"A genetic algorithm + dynamic programming solution for unit commitment problem." Chinese University of Hong Kong, 1996. http://library.cuhk.edu.hk/record=b5888990.
Повний текст джерелаThesis (M.Phil.)--Chinese University of Hong Kong, 1996.
Includes bibliographical references (leaves 107-111).
Chapter 1 --- Introduction --- p.7
Chapter 1.1 --- The Goal --- p.8
Chapter 1.2 --- The Work of the Thesis --- p.9
Chapter 1.3 --- Layout of Thesis --- p.9
Chapter 2 --- The Unit Commitment Problem --- p.11
Chapter 2.1 --- What is UCP? --- p.11
Chapter 2.1.1 --- Why is UCP difficult? --- p.12
Chapter 2.1.2 --- Costs --- p.12
Chapter 2.1.3 --- Constraints --- p.13
Chapter 2.2 --- Mathematical Formulation --- p.15
Chapter 2.3 --- Literature Review --- p.19
Chapter 2.3.1 --- Exhaustive Enumeration --- p.19
Chapter 2.3.2 --- Priority List --- p.20
Chapter 2.3.3 --- Langragian Relaxation --- p.21
Chapter 2.3.4 --- Neural Network --- p.21
Chapter 2.3.5 --- Genetic Algorithms --- p.22
Chapter 2.3.6 --- Dynamic Programming --- p.22
Chapter 3 --- Genetic Algorithms --- p.24
Chapter 3.1 --- Introduction --- p.24
Chapter 3.1.1 --- Outline of Traditional GA --- p.25
Chapter 3.2 --- Basic elements --- p.26
Chapter 3.2.1 --- Coding --- p.26
Chapter 3.2.2 --- Fitness Function --- p.26
Chapter 3.2.3 --- Selection and Reproduction --- p.26
Chapter 3.2.4 --- Mutation --- p.28
Chapter 3.2.5 --- Replacement --- p.29
Chapter 3.2.6 --- Epistasis --- p.29
Chapter 3.2.7 --- A Simple Example --- p.30
Chapter 3.3 --- Exploration vs Exploitation --- p.33
Chapter 3.4 --- Constraints Handlings --- p.34
Chapter 3.4.1 --- Penalty Function --- p.35
Chapter 3.4.2 --- Proper Encoding --- p.36
Chapter 3.4.3 --- Repair Algorithms --- p.36
Chapter 4 --- Dynamic Programming --- p.37
Chapter 4.1 --- Introduction --- p.37
Chapter 4.1.1 --- Decomposition --- p.38
Chapter 4.2 --- Mathematical Formulation --- p.43
Chapter 4.3 --- A Simple Example --- p.44
Chapter 5 --- DP Crossover Operator (DPX) --- p.50
Chapter 5.1 --- Why DP is chosen as the crossover operator --- p.50
Chapter 5.2 --- What is DPX? --- p.51
Chapter 5.2.1 --- A Simple Example --- p.51
Chapter 5.2.2 --- Mechanism of DPX --- p.58
Chapter 5.3 --- Properties of DPX --- p.63
Chapter 5.3.1 --- Number of parents --- p.63
Chapter 5.3.2 --- Crossover Sites --- p.65
Chapter 5.3.3 --- Perservation of Feasibility --- p.66
Chapter 6 --- Implementation --- p.69
Chapter 6.1 --- GA Construction --- p.69
Chapter 6.1.1 --- Coding --- p.69
Chapter 6.1.2 --- Fitness Function --- p.70
Chapter 6.1.3 --- Selection --- p.72
Chapter 6.1.4 --- Crossover --- p.76
Chapter 6.1.5 --- Mutation Rate --- p.76
Chapter 6.1.6 --- Replacement --- p.77
Chapter 6.2 --- Algorithm --- p.77
Chapter 6.3 --- Optimal Power Generations for Fuel Costs --- p.80
Chapter 6.3.1 --- The Simple Scheduling Method --- p.80
Chapter 7 --- Experimental Results --- p.84
Chapter 7.1 --- Experiment Details --- p.84
Chapter 7.2 --- Problem A --- p.86
Chapter 7.2.1 --- Data Results --- p.86
Chapter 7.2.2 --- Graphical Results --- p.90
Chapter 7.2.3 --- Analysis --- p.90
Chapter 7.3 --- Problem B --- p.92
Chapter 7.3.1 --- Data Results --- p.92
Chapter 7.3.2 --- Graphical Results --- p.94
Chapter 7.3.3 --- Analysis --- p.96
Chapter 8 --- Conclusion and Future Work --- p.97
Chapter 8.1 --- Conclusion --- p.97
Chapter 8.2 --- Future Work --- p.98
Chapter A --- Problems Parameters --- p.100
Chapter A.1 --- Problem A --- p.100
Chapter A.1.1 --- Parameters of Generating Units --- p.101
Chapter A.2 --- Problem B --- p.103
Chapter A.2. --- 1 Parameters of Generating Units --- p.104
Terekhov, Daria. "Integrating Combinatorial Scheduling with Inventory Management and Queueing Theory." Thesis, 2013. http://hdl.handle.net/1807/36017.
Повний текст джерелаAramon, Bajestani Maliheh. "Integrating Maintenance Planning and Production Scheduling: Making Operational Decisions with a Strategic Perspective." Thesis, 2014. http://hdl.handle.net/1807/65637.
Повний текст джерела