Dissertations / Theses on the topic 'Branching'
To see the other types of publications on this topic, follow the link: Branching.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Branching.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Zhu, Qingsan. "Critical branching random walks, branching capacity and branching interlacements." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/62928.
Full textAbstract:
This thesis concerns critical branching random walks. We focus on supercritical (d ≥ 5 or higher) and critical (d=4) dimensions. In this thesis, we extend the potential theory for random walk to critical branching random walk. In supercritical dimensions, we introduce branching capacity for every finite subset of ℤ^d and construct its connections with critical branching random walk through the following three perspectives. 1. The visiting probability of a finite set by a critical branching random walk starting far away; 2. Branching recurrence and branching transience; 3. Local limit of branching random walk in torus conditioned on the total size. Moreover, we establish the model which we call 'branching interlacements' as the local limit of branching random walk in torus conditioned on the total size. In the critical dimension, we also construct some parallel results. On the one hand, we give the asymptotics of visiting a finite set and the convergence of the conditional hitting point. On the other hand, we establish the asymptotics of the range of a branching random walk conditioned on the total size. Also in this thesis, we analyze a small game which we call the Majority-Markov game and give an optimal strategy.Science, Faculty of
Mathematics, Department of
Graduate
2
Komen, Erwin R. "Branching constraints." Universität Potsdam, 2009. http://opus.kobv.de/ubp/volltexte/2009/3227/.
Full textAbstract:
Rejecting approaches with a directionality parameter, mainstream minimalism has adopted the notion of strict (or unidirectional) branching. Within optimality theory however, constraints have recently been proposed that presuppose that the branching direction scheme is language specific. I show that a syntactic analysis of Chechen word order and relative clauses using strict branching and
movement triggered by feature checking seems very unlikely, whereas a directionality approach works well. I argue in favor of a mixed directionality approach for Chechen, where the branching direction scheme depends on the phrase type. This observation leads to the introduction of context variants of existing markedness constraints, in order to describe the branching processes in terms of optimality theory. The paper discusses how and where the optimality theory selection of the branching directions can be implemented within a
minimalist derivation.
3
Harris, Simon Colin. "Branching diffusions." Thesis, University of Cambridge, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387607.
Full text
4
Hardy, Robert. "Branching diffusions." Thesis, University of Bath, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410689.
Full text
5
Meinecke, Ingmar. "Weighted Branching Automata." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2005. http://nbn-resolving.de/urn:nbn:de:swb:14-1133443150529-27676.
Full textAbstract:
Eine der stärksten Erweiterungen der klassischen Theorie formaler Sprachen und Automaten ist die Einbeziehung von Gewichten oder Vielfachheiten aus einem Halbring. Diese Dissertation untersucht gewichtete Automaten über Strukturen mit Nebenläufigkeit. Wir erweitern die Arbeit von Lodaya und Weil und erhalten so ein Modell gewichteter verzweigender Automaten, in dem die Berechnung des Gewichts einer parallelen Komposition anders als die einer sequentiellen Komposition gehandhabt wird. Die von Lodaya und Weil eingeführten Automaten modellieren Nebenläufigkeit durch Verzweigen. Ein verzweigender Automat ist ein endlicher Automat mit drei verschiedenen Typen von Transitionen. Sequentielle Transitionen überführen durch Ausführen eines Ereignisses einen Zustand in einen anderen. Dagegen sind Gabel- und Binde-Transitionen für das Verzweigen verantwortlich. Läufe dieser Automaten werden beschrieben durch sequentiell-parallele posets, kurz sp-posets. Alle Transitionen des Automaten werden in unserem Modell mit Gewichten versehen. Neben dem Nichtdeterminismus und der sequentiellen Komposition wollen wir nun auch die parallele Komposition quantitativ behandeln. Dafür benötigen wir eine Gewichtsstruktur mit einer Addition, einer sequentiellen und einer parallelen Multiplikation. Solch eine Struktur, genannt Bihalbring, besteht damit de facto aus zwei Halbringen mit derselben additiven Struktur. Weiterhin muss die parallele Multiplikation kommutativ sein. Das Verhalten eines gewichteten verzweigenden Automaten ist dann eine Funktion, die jeder sp-poset ein Element eines Bihalbrings zuordnet. Das Hauptresultat charakterisiert das Verhalten dieser Automaten im Sinne von Kleenes und Schützenbergers Sätzen über das Zusammenfallen der Klassen der erkennbaren und der rationalen Sprachen bzw. formalen Potenzreihen. Darüber hinaus untersuchen wir den Abschluss dieser Verhalten unter allen rationalen Operationen und unter dem Hadamard-Produkt. Letztlich diskutieren wir Zusammenhänge zwischen Reihen und Sprachen im Rahmen verzweigender AutomatenOne of the most powerful extensions of classical formal language and automata theory is the consideration of weights or multiplicities from a semiring. This thesis investigates weighted automata over structures incorporating concurrency. Extending work by Lodaya and Weil, we propose a model of weighted branching automata in which the calculation of the weight of a parallel composition is handled differently from the calculation of the weight of a sequential composition. The automata as proposed by Lodaya and Weil model concurrency by branching. A branching automaton is a finite-state device with three different types of transitions. Sequential transitions transform a state into another one by executing an action. In contrast, fork and join transitions are responsible for branching. Executions of such systems can be described by sequential-parallel posets, or sp-posets for short. In the model considered here all kinds of transitions are equipped with weights. Beside non-determinism and sequential composition we would like to deal with the parallel composition in a quantitative way. Therefore, we are in need of a weight structure equipped with addition, a sequential, and, moreover, a parallel multiplication. Such a structure, called a bisemiring, is actually composed of two semirings with the same additive structure. Moreover, the parallel multiplication has to be commutative. Now, the behavior of a weighted branching automaton is a function that associates with every sp-poset an element from the bisemiring. The main result characterizes the behavior of these automata in the spirit of Kleene's and Schützenberger's theorems about the coincidence of recognizable and rational languages, and formal power series, respectively. Moreover, we investigate the closure of behaviors under all rational operations and under Hadamard-product. Finally, we discuss connections between series and languages within our setting
6
Bailey, James Patrick. "Octanary branching algorithm." Thesis, Kansas State University, 2012. http://hdl.handle.net/2097/13801.
Full textAbstract:
Master of ScienceDepartment of Industrial and Manufacturing Systems Engineering
Todd Easton
Integer Programs (IP) are a class of discrete optimization that have been used commercially to improve various systems. IPs are often used to reach an optimal financial objective with constraints based upon resources, operations and other restrictions. While incredibly beneficial, IPs have been shown to be NP-complete with many IPs remaining unsolvable. Traditionally, Branch and Bound (BB) has been used to solve IPs. BB is an iterative algorithm that enumerates all potential integer solutions for a given IP. BB can guarantee an optimal solution, if it exists, in finite time. However, BB can require an exponential number of nodes to be evaluated before terminating. As a result, the memory of a computer using BB can be exceeded or it can take an excessively long time to find the solution. This thesis introduces a modified BB scheme called the Octanary Branching Algorithm (OBA). OBA introduces eight children in each iteration to more effectively partition the feasible region of the linear relaxation of the IP. OBA also introduces equality constraints in four of the children in order to reduce the dimension of the remaining nodes. OBA can guarantee an optimal solution, if it exists, in finite time. In addition, OBA has been shown to have some theoretical improvements over traditional BB. During computational tests, OBA was able to find the first, second and third integer solution with 64.8%, 27.9% and 29.3% fewer nodes evaluated, respectively, than CPLEX. These integers were 44.9%, 54.7% and 58.2% closer to the optimal solution, respectively, when compared to CPLEX. It is recommended that commercial solvers incorporate OBA in the initialization and random diving phases of BB.
7
Harris, John William. "Branching diffusion processes." Thesis, University of Bath, 2006. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428379.
Full text
8
Fittipaldi, María Clara. "Representation results for continuos-state branching processes and logistic branching processes." Tesis, Universidad de Chile, 2014. http://www.repositorio.uchile.cl/handle/2250/116458.
Full textAbstract:
Doctora en Ciencias de la Ingeniería, Mención Modelación MatemáticaEl objetivo de este trabajo es explorar el comportamiento de los procesos de rami ficación evolucionando a tiempo y estados continuos, y encontrar representaciones para su trayectoria y su genealogía. En el primer capítulo se muestra que un proceso de ramifi cación condicionado a no extinguirse es la única solución fuerte de una ecuación diferencial estocástica conducida por un movimiento Browniano y una medida puntual de Poisson, más un subordinador que representa la inmigración, dónde estos procesos son mutuamente independientes. Para esto se usa el hecho de que es posible obtener la ley del proceso condicionado a partir del proceso original, a través de su h-transformada, y se da una manera trayectorial de construir la inmigración a partir de los saltos del proceso. En el segundo capítulo se encuentra una representación para los procesos de rami ficación con crecimiento logístico, usando ecuaciones estocásticas. En particular, usando la de finición general dada por A. Lambert, se prueba que un proceso logístico es la única solución fuerte de una ecuación estocástica conducida por un movimiento Browniano y una medida puntual de Poisson, pero con un drift negativo fruto de la competencia entre individuos. En este capítulo se encuentra además una ecuación diferencial estocástica asociada con un proceso logístico condicionado a no extinguirse, suponiendo que éste existe y que puede ser de finido a través de una h-transformada. Esta representación muestra que nuevamente el condicionamiento da origen a un término correspondiente a la inmigración, pero en este caso dependiente de la población. Por último, en el tercer capítulo se obtiene una representación de tipo Ray-Knight para los procesos de ramifi cación logísticos, lo que da una descripción de su genealogía continua. Para esto, se utiliza la construcción de árboles aleatorios continuos asociados con procesos de Lévy generales dada por J.-F. Le Gall e Y. Le Jan, y una generalización del procedimiento de poda desarrollado por R. Abraham, J.-F. Delmas. Este resultado extiende la representación de Ray-Knight para procesos de difusión logísticos dada por V. Le, E. Pardoux y A. Wakolbinger.
9
Eick, Ernst Christopher [Verfasser], and Gerold [Akademischer Betreuer] Alsmeyer. "Branching within branching in random environment / Ernst Christopher Eick ; Betreuer: Gerold Alsmeyer." Münster : Universitäts- und Landesbibliothek Münster, 2020. http://d-nb.info/1215183356/34.
Full text
10
Bannister, Iveta. "Branching copolymerisations by ATRP." Thesis, University of Sussex, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.499571.
Full textAbstract:
Sherrington and co-workers have shown that branched vinyl polymers can be synthesized by the addition of a chain transfer agent to a conventional free radical statistical copolymerisation of a vinyl and a divinyl monomer. In the presence of the chain transfer agent, the molecular weight of the primary chains is reduced, gelation can be suppressed and soluble, branched polymers are obtained as the sole product. Living polymerisation techniques offer a way to control the primary chain length without the need for a transfer agent simply by adjusting the monomer/initiator molar ratio. It is suggested that a significant degree of intramolecular cyclisation is the most likely explanation for the remarkable delay in the onset of gelation.
11
Williams, Ceri Rhys. "Quantum interacting branching systems." Thesis, University of Nottingham, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416728.
Full text
12
Li, Junping. "Generalized Markov branching models." Thesis, University of Greenwich, 2005. http://gala.gre.ac.uk/6226/.
Full textAbstract:
In this thesis, we first considered a modified Markov branching process incorporating both state-independent immigration and resurrection. After establishing the criteria for regularity and uniqueness, explicit expressions for the extinction probability and mean extinction time are presented. The criteria for recurrence and ergodicity are also established. In addition, an explicit expression for the equilibrium distribution is presented. We then moved on to investigate the basic properties of an extended Markov branching model, the weighted Markov branching process. The regularity and uniqueness criteria of such general structures are first established. There after closed expressions for the mean extinction time and conditional mean extinction time are presented. The explosion behaviour and the mean explosion time are also investigated. In particular, the Harris regularity criterion for ordinary Markov branching process is extended to a more general case of non-linear Markov branching process. Finally, we studied a new Markov branching model, the weighted collision branching process, and considered two special cases of this process. For this weighted collision branching process, some conditions of regularity and uniqueness are obtained and the extinction behaviour and explosion behaviour of the process are investigated. For the two special cases, a collision branching process and a general collision branching process with 2 parameters, the regularity and uniqueness criteria of the process are established and explicit expressions for extinction probability vector, mean extinction times, conditional mean extinction times and mean explosion time are all obtained.
13
Ku, Ho Ming. "Interacting Markov branching processes." Thesis, University of Liverpool, 2014. http://livrepository.liverpool.ac.uk/2002759/.
Full textAbstract:
In engineering, biology and physics, in many systems, the particles or members give birth and die through time. These systems can be modeled by continuoustime Markov Chains and Markov Processes. Applications of Markov Processes are investigated by many scientists, Jagers [1975] for example . In ordinary Markov branching processes, each particles or members are assumed to be identical and independent. However, in some cases, each two members of the species may interact/collide together to give new birth. In considering these cases, we need to have some more general processes. We may use collision branching processes to model such systems. Then, in order to consider an even more general model, i.e. each particles can have branching and collision effect. In this case the branching component and collision component will have an interaction effect. We consider this model as interacting branching collision processes. In this thesis, in Chapter 1, we firstly look at some background, basic concepts of continuous-time Markov Chains and ordinary Markov branching processes. After revising some basic concepts and models, we look into more complicated models, collision branching processes and interacting branching collision processes. In Chapter 2, for collision branching processes, we investigate the basic properties, criteria of uniqueness, and explicit expressions for the extinction probability and the expected/mean extinction time and expected/mean explosion time. In Chapter 3, for interacting branching collision processes, similar to the structure in last chapter, we investigate the basic properties, criteria of uniqueness. Because of the more complicated model settings, a lot more details are required in considering the extinction probability. We will divide this section into several parts and consider the extinction probability under different cases and assumptions. After considering the extinction probability for the interacting branching processes, we notice that the explicit form of the extinction probability may be too complicated. In the last part of Chapter 3, we discuss the asymptotic behavior for the extinction probability of the interacting branching collision processes. In Chapter 4, we look at a related but still important branching model, Markov branching processes with immigration, emigration and resurrection. We investigate the basic properties, criteria of uniqueness. The most interesting part is that we investigate the extinction probability with our technique/methods using in Chapter 4. This can also be served as a good example of the methods introducing in Chapter 3. In Chapter 5, we look at two interacting branching models, One is interacting collision process with immigration, emigration and resurrection. The other one is interacting branching collision processes with immigration, emigration and resurrection. we investigate the basic properties, criteria of uniqueness and extinction probability. My original material starts from Chapter 4. The model used in chapter 4 were introduced by Li and Liu [2011]. In Li and Liu [2011], some calculation in cases of extinction probability evaluation were not strictly defined. My contribution focuses on the extinction probability evaluation and discussing the asymptotic behavior for the extinction probability in Chapter 4. A paper for this model will be submitted in this year. While two interacting branching models are discussed in Chapter 5. Some important properties for the two models are studied in detail.
14
Kostromina, Darya. "Processi di branching e applicazioni." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23215/.
Full textAbstract:
La tesi presenta una descrizione generale dei processi di branching: si introduce il modello di Galton-Watson e si evidenziano le proprietà più importanti. Si prende poi in considerazione il modello di Wright-Fisher e ne viene descritta una connessione con il processo di branching. Infine, si propongono due modelli, basati su una particolare classe di processi di branching, che descrivono l'evoluzione dell'infezione di Covid-19. Quindi, utilizzando dati di individui infetti registrati giornalmente, si stimano i parametri dei due modelli.
15
Collins, Joseph P. "Branching processes with varying environments." Thesis, University of Bath, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607471.
Full textAbstract:
This thesis concentrates on Branching Processes. We look at applying spine techniques and martingale changes of measure in order to first provide alternative proofs of well known discrete-time results concerning Branching Processes in Random Environments. We then apply the same ideas in a different setting to study Branching Brownian Motion with a Random Environment, focussing on the long-term spatial behaviour of the process. The final area of interest is Branching Brownian Motion with absorption at the origin, where we consider t he asymptotic behaviour of the survival probabilities near criticality in variations on an original model.
16
Cole, D. J. "Stochastic branching processes in biology." Thesis, University of Kent, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270684.
Full text
17
Nuzhnaya, Tatyana. "ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES." Diss., Temple University Libraries, 2015. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/322471.
Full textAbstract:
Computer and Information SciencePh.D.
Development of state-of-the-art medical imaging modalities such as Magnetic Resonance Imaging, Computed Tomography, Galactography, MR Diffusion Tensor Imaging, and Tomosynthesis plays an important role for visualization and assessment of anatomical structures. Included among these structures are structures of branching topology such as the bronchial tree in chest computed tomography images, the blood vessels in retinal images and the breast ductal network in x-ray galactograms and the tubular bone patterns in dental radiography. Analysis of such images could help reveal abnormalities, assist in estimating a risk of diseases such as breast cancer and COPD, and aid in the development of realistic anatomy phantoms. This thesis aims at the development of a set of automated methods for the analysis of anatomical structures of tree and network topology. More specifically, the two main objectives include (i) the development of analysis framework to explore the association between topology and texture patterns of anatomical branching structures and (ii) the development of the image processing methods for enhanced visualization of regions of interest in anatomical branching structures such as branching nodes.
Temple University--Theses
18
Gröttrup, Sören [Verfasser], and Gerold [Akademischer Betreuer] Alsmeyer. "Branching with branching : a stochastic description of host-parasite populations / Sören Gröttrup ; Betreuer: Gerold Alsmeyer." Münster : Universitäts- und Landesbibliothek Münster, 2013. http://d-nb.info/1141382865/34.
Full text
19
Yamada-Yamamoto, Asako. "The acquisition of English syntax by a Japanese-speaking child : from left-branching to right-branching." Thesis, University of Reading, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316365.
Full text
20
Foo, Eloise. "Genetic control of branching in pea /." St. Lucia, Qld, 2003. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe17695.pdf.
Full text
21
Ricolo, Delia. "Cytoskeletal modulation of single-cell branching." Doctoral thesis, Universitat de Barcelona, 2017. http://hdl.handle.net/10803/404782.
Full textAbstract:
The embryonic tracheal system of Drosophila melanogaster consists of a network of interconnected epithelial tubes of different size and architecture characterized by different cellular mechanisms of tube formation. The main branches of the Drosophila tracheal system have an extracellular lumen because their cells fold to form a tube. However, terminal cells (TCs), specialized cells designed to connect the tracheal system to target tissues, form unicellular branches by generating of a subcellular lumen. This topology of unicellular tubes is a good model to clarify the mechanisms that orchestrate single-cell branching, a process parallel to capillary sprouting in blood vessels. During tracheal embryonic development, TCs produce seamless tubes, generating a cytoplasmic extension, by cell elongation, and a concurrent intracellular luminal space surrounded by an apical membrane. Cell elongation and subcellular lumen formation are very much dependent on cytoskeleton reorganization.
The main aim of this thesis was to understand new aspects of cytoskeletal modulation that orchestrate subcellular lumen formation. In particular, we have addressed this aim analysing mutants displaying an increase in subcellular lumen branching and mutants characterized by the absence of the subcellular lumen.
We found that mutations in Regulator of Cyclin A (Rca1) and Cyclin A (CycA) affect subcellular branching, causing TCs to form more than one subcellular lumen. The effect of Rca1 is post-mitotic in the tracheal system, and depends on an amplification of centrosome number. Other mutant conditions, characterized by the increase of centrosome number, such as Slimb (slmb) and the overexpression of SAK also show excess of subcellular lumen branching. Furthermore, we showed that de novo lumen formation is impaired in mutant embryos with low centrosome numbers such as sas4 and is restored in the double mutant Rca1; sas4.
The data presented here define a requirement for the centrosome as a microtubule organizing center (MTOC) for the initiation of subcellular lumen formation. We propose that in wt condition two centrosomes are needed to arrange the specific intracellular TC organization necessary to generate a subcellular lumen, and that an excess of centrosome numbers allows for an increase in single- cell branching.
We also analysed the involvement of the spectraplakin Short-stop (Shot) in the cytoskeletal organization of the TCs. Shot is a multifunctional protein involved in many aspects of cytoskeletal organization in different tissues, which can operate as a single cytoskeleton component as well as coordinating cytoskeletal elements between them. This functional versatility of Shot is probably reflected by the abundant generation of isoforms and by the modulation of its numerous domains.
We found that the overexpression of shot in the tracheal system induces extra-branching of the subcellular lumen and this effect depends mainly on the C-tail domain at the C- terminus and its involvement in the stabilization/polimerization of MTs. On the other hand, by examining loss of function alleles, analysing its structural function and visualizing Shot accumulation, we suggest that Shot is not just involved in MT organization in the TC but it also acts as a crosslinker between MTs and the actin network. The first calponin domain (CH1) of the acting binding domain (ABD) at the N-terminal is involved in this cross-linking activity.
Finally, we provide some data indicating a functional overlap between the spectraplakin and the microtubule associated protein (MAP) Tau during subcellular lumen formation.Las células terminales (TCs) de la tráquea del embrión de Drosophila melanogaster son capaces de generar un lumen subcelular y son utilizadas como modelo para la formación de tubos unicelulares de tipo “seamless”. La generación de dicho lumen depende estrictamente de una especifica organización del citoesqueleto que permite la formación de una nueva membrana apical en el interior de la TC. El objetivo del trabajo aquí presentado ha sido lo de aclarar nuevos aspectos de la modulación del citoesqueleto en el contexto de la formación del lumen sub-celular. Los mutantes de Regulator of Cyclin A (Rca1) y CycA (Cyclin A) están caracterizados por TC con mas de un lumen subcelular. El efecto de Rca1 es post-mitótico y esta causado por un aumento del numero de centrosomas. Reportamos, atraves el estudio de Rca1 y otros mutantes afectados en el numero de centrosomas, una estricta asociación entre centrosomas y formación del lumen sub-celular. Nuestros datos revelan, por primer vez, la función de los centrosomas como centros de organización de microtubulos (MTOC) en la TC y que un exceso de centrosomas puede causar un aumento en la capacidad de ramificación del lumen. En este trabajo también hemos analizado la función de la spectraplakina Short-stop (Shot). A través de experimentos de sobre-expresión y falta de función de shot, integrados con estudios estructura-función y de localización de sus productos proteicos hemos concluido que la spectraplakina actúa el la TC acudiendo a diferentes grados de organización citosqueletrica; en nuestro modelo Shot es capaz de promover la estabilización/polymerizacion de microtubulos, y un exceso de esta función puede causar extra ramificación en la TC. Por otro lado, Shot esta implicado en la correcta conexión entre la red de microtubulos y la actina y su falta influye negativamente la formación del lumen sub-celular. También reportamos datos preliminares que indican una superposición funcional entre Shot y la proteína asociada a microtulos (MAP) Tau durante el desarrollo del la TC.
22
Bauer, Sebastian. "Algorithmische Eigenschaften von Branching-Time Logiken." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2007. http://nbn-resolving.de/urn:nbn:de:swb:14-1168770883767-64981.
Full textAbstract:
Es wird die Axiomatisierbarkeit einer Klasse von temporalen Prädikatenlogiken über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.
23
Wang, Xiao Chuan. "Branching of polypropylene through reactive extrusion." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21396.pdf.
Full text
24
Holland, Amanda Suzanne. "Cyclanilide promotes branching of woody ornamentals." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Spring%20Theses/HOLLAND_AMANDA_25.pdf.
Full text
25
La, Saponara Valeria. "Crack branching in cross-ply composites." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/11973.
Full text
26
Kernberger, Daniel [Verfasser]. "Hybrid Branching-Time Logics / Daniel Kernberger." Kassel : Universitätsbibliothek Kassel, 2019. http://d-nb.info/1201509378/34.
Full text
27
Janarthanan, Sivarjalingam. "Spatial spread in general branching processes." Thesis, University of Sheffield, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265577.
Full text
28
Yip, C. W. H. "Compressible discharge coefficients of branching flows." Thesis, University of Aberdeen, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233007.
Full textAbstract:
A two-dimensional numerical model for compressible branching flow through a slot is described for the purpose of predicting the discharge coefficients of film cooling holes in gas turbine blades. The method employs free-streamline theory and the hodograph transformation. It calculates the area ratio of hole to duct and the contraction coefficient from a set of prescribed boundary conditions. An approximate method for calculating the compressible contraction coefficients is also discussed in the thesis. It employs the incompressible theory previously developed by McNown and Hsu (1951) for the free efflux, the 'compressibility factor' and the flow parameter (Po-Pj)/(Po-P1), where Po, Pj, P1 represent the stagnation pressure, the static pressure of the jet and the static pressure of the approach flow, respectively. The advantages of using this method are the direct input of the area ratio of hole to duct and its speed of calculation. Experimental tests were performed using a specially designed rig in a supersonic wind tunnel. The investigations included sharp-edged slots with three different widths, a single hole and a row of two holes. The approach velocity in terms of the characteristic Mach number ranged from 0.18 to 0.58 and the pressure ratio Po/Pj, ranged from 1.10 to 1.97. Agreement between the experimental data and the theoretical values was good to within the experimental accuracy (typically around +/- 5%) for the slots and the 2-hole configuration. For the 1-hole configuration, less bleed flow than predicted was observed, with the discrepancy varying from 7% to 18%. The latter case is a very severe test of a purely two-dimensional theory. The results for the 2-hole plate suggest that the slot theory can in fact be used to predict the flow through a row of holes with small pitch to diameter ratios.
29
Bardon, Oliver 1966. "Measurement of the D*⁺ branching fractions." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/32652.
Full text
30
Ponzio, Stephen J. (Stephen John). "Restricted branching programs and hardware verification." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/35042.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 71-77).
by Stephen John Ponzio.
Ph.D.
31
Aguado, M. Teresa, Christopher J. Glasby, Paul C. Schroeder, Anne Weigert, and Christoph Bleidorn. "The making of a branching annelid." Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-175573.
Full textAbstract:
Ramisyllis multicaudata is a member of Syllidae (Annelida, Errantia, Phyllodocida) with a remarkable branching body plan. Using a next-generation sequencing approach, the complete mitochondrial
genomes of R. multicaudata and Trypanobia sp. are sequenced and analysed, representing the first ones from Syllidae. The gene order in these two syllids does not follow the order proposed as the putative ground pattern in Errantia. The phylogenetic relationships of R. multicaudata are discerned using a phylogenetic approach with the nuclear 18S and the mitochondrial 16S and cox1 genes. Ramisyllis multicaudata is the sister group of a clade containing Trypanobia species. Both genera, Ramisyllis and Trypanobia, together with Parahaplosyllis, Trypanosyllis, Eurysyllis, and Xenosyllis are located in a long branched clade. The long branches are explained by an accelerated mutational rate in the 18S rRNA gene. Using a phylogenetic backbone, we propose a scenario in which the
postembryonic addition of segments that occurs in most syllids, their huge diversity of reproductive modes, and their ability to regenerate lost parts, in combination, have provided an evolutionary basis to develop a new branching body pattern as realised in Ramisyllis.
32
Kissig, Christian. "Finitary logics for coalgebras with branching." Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/37190.
Full textAbstract:
The purpose of this dissertation is to further previous work on coalgebras as infinite statebased transition systems and their logical characterisation with particular focus on infinite regular behaviour and branching. Finite trace semantics is well understood [DR95] for nondeterministic labelled transition systems, and has recently [Jac04, HJS06] been generalised to a coalgebraic level where monads act as branching types for instance, of nondeterministic choice. Finite trace semantics then arises through an inductive construction in the Kleisli-category of the monad. We provide a more comprehensive definition of finite trace semantics, allowing for finitary branching types in Chapter 5. In Chapter 6 we carry over the ideas behind our definition of finite trace semantics to define infinite trace semantics. Coalgebraic logics [Mos99] provide one approach to characterising states in coalgebras up to bisimilarity. Coalgebraic logics are Boolean logics with the modality r. We define the Boolean dual of r in the negation-free fragment of finitary coalgebraic logics in Chapter 7, showing that finitary coalgebraic logics are essentially negation free. Our proof is largely based on the previously established completeness of finitary coalgebraic logics [KKV08]. Finite trace semantics induces the notion of finite trace equivalence. In Chapter 8 we define coalgebraic logics for many relevant branching and transition types characterising states of coalgebras with branching up to finite trace equivalence. Under further assumptions we show that these logics are expressive. Coalgebra automata allow us to state finitary properties over infinite structures essentially by a fix-point style construction. We use the dualisation of r from Chapter 7 to prove that coalgebra automata are closed under complementation in Chapter 10. This result completes a Rabin style [Rab69] correspondence between finitary coalgebraic logics and coalgebra automata for finitary transition types, begun in [Ven04, KV05]. The semantics of coalgebra automata is given in terms of parity graph games [GTW02]. In Chapter 9 we show how to structure parity graph games into rounds using the notion of players power [vB02] and how to normalise the interaction pattern between the players per round. From the latter we obtain the coinductive principle of game bisimulation. Languages accepted by coalgebra automata are called regular. Regularity is commonly [Sip96, HMU03] disproved using the pumping lemma for regular languages. We define regular languages of coalgebras and prove a pumping lemma for these languages in Chapter 11.
33
Bauer, Sebastian. "Algorithmische Eigenschaften von Branching-Time Logiken." Doctoral thesis, Technische Universität Dresden, 2005. https://tud.qucosa.de/id/qucosa%3A24981.
Full textAbstract:
Es wird die Axiomatisierbarkeit einer Klasse von temporalen Prädikatenlogiken über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.
34
Kulkarni, Amit S. "Nature of Branching in Disordered Materials." University of Cincinnati / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1190655419.
Full text
35
Zhang, Lan. "Clausal reasoning for branching-time logics." Thesis, University of Liverpool, 2010. http://livrepository.liverpool.ac.uk/3373/.
Full textAbstract:
Computation Tree Logic (CTL) is a branching-time temporal logic whose underlying model of time is a choice of possibilities branching into the future. It has been used in a wide variety of areas in Computer Science and Artificial Intelligence, such as temporal databases, hardware verification, program reasoning, multi-agent systems, and concurrent and distributed systems. In this thesis, firstly we present a refined clausal resolution calculus R�,S CTL for CTL. The calculus requires a polynomial time computable transformation of an arbitrary CTL formula to an equisatisfiable clausal normal form formulated in an extension of CTL with indexed existential path quantifiers. The calculus itself consists of eight step resolution rules, two eventuality resolution rules and two rewrite rules, which can be used as the basis for an EXPTIME decision procedure for the satisfiability problem of CTL. We give a formal semantics for the clausal normal form, establish that the clausal normal form transformation preserves satisfiability, provide proofs for the soundness and completeness of the calculus R�,S CTL, and discuss the complexity of the decision procedure based on R�,S CTL. As R�,S CTL is based on the ideas underlying Bolotov’s clausal resolution calculus for CTL, we provide a comparison between our calculus R�,S CTL and Bolotov’s calculus for CTL in order to show that R�,S CTL improves Bolotov’s calculus in many areas. In particular, our calculus is designed to allow first-order resolution techniques to emulate resolution rules of R�,S CTL so that R�,S CTL can be implemented by reusing any first-order resolution theorem prover. Secondly, we introduce CTL-RP, our implementation of the calculus R�,S CTL. CTL-RP is the first implemented resolution-based theorem prover for CTL. The prover takes an arbitrary CTL formula as input and transforms it into a set of CTL formulae in clausal normal form. Furthermore, in order to use first-order techniques, formulae in clausal normal form are transformed into firstorder formulae, except for those formulae related to eventualities, i.e. formulae containing the eventuality operator 3. To implement step resolution and rewrite rules of the calculus R�,S CTL, we present an approach that uses first-order ordered resolution with selection to emulate the step resolution rules and related proofs. This approach enables us to make use of a first-order theorem prover, which implements the first-order ordered resolution with selection, in order to realise our calculus. Following this approach, CTL-RP utilises the first-order theorem prover SPASS to conduct resolution inferences for CTL and is implemented as a modification of SPASS. In particular, to implement the eventuality resolution rules, CTL-RP augments SPASS with an algorithm, called loop search algorithm for tackling eventualities in CTL. To study the performance of CTL-RP, we have compared CTL-RP with a tableau-based theorem prover for CTL. The experiments show good performance of CTL-RP. i ii ABSTRACT Thirdly, we apply the approach we used to develop R�,S CTL to the development of a clausal resolution calculus for a fragment of Alternating-time Temporal Logic (ATL). ATL is a generalisation and extension of branching-time temporal logic, in which the temporal operators are parameterised by sets of agents. Informally speaking, CTL formulae can be treated as ATL formulae with a single agent. Selective quantification over paths enables ATL to explicitly express coalition abilities, which naturally makes ATL a formalism for specification and verification of open systems and game-like multi-agent systems. In this thesis, we focus on the Next-time fragment of ATL (XATL), which is closely related to Coalition Logic. The satisfiability problem of XATL has lower complexity than ATL but there are still many applications in various strategic games and multi-agent systems that can be represented in and reasoned about in XATL. In this thesis, we present a resolution calculus RXATL for XATL to tackle its satisfiability problem. The calculus requires a polynomial time computable transformation of an arbitrary XATL formula to an equi-satisfiable clausal normal form. The calculus itself consists of a set of resolution rules and rewrite rules. We prove the soundness of the calculus and outline a completeness proof for the calculus RXATL. Also, we intend to extend our calculus RXATL to full ATL in the future.
36
Wang, Hao Carleton University Dissertation Mathematics and Statistics. "Interacting branching particle systems and superprocesses." Ottawa, 1995.
Find full text
37
Homeister, Matthias. "On lower bounds for parity branching programs." Doctoral thesis, [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=970358091.
Full text
38
Sorefan, Karim. "The max4 Shoot Branching Regulator of Arabidopsis." Thesis, University of York, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.485139.
Full textAbstract:
Axillary bud growth is inhibited by auxin produced at the shoot apex and transported down the stem. Removal of the shoot apex by decapitation can release buds from inhibition, and application of auxin to the cut stump can restore bud inhibition. However auxin action is likely to be indirect because auxin does not accumulate in inhibited buds, and therefore requires a second messenger. The max4 mutant of Arabidopsis has increased b,ud growth that leads to increased branching in mature plants. The axillary buds of isolated nodes are also partially resistant to exogenous auxin applied to the apical cut stump. The max4 mutation also partially rescues the branch!ng of the axr3-1 auxin over-responding mutant. The auxin resistant phenotype of the max4 mutant appears to be specific to bud growth because max4 seedlings were only slightly resistant to exogenous auxin, and the max4 mutation did not rescue other auxin related phenotypes of the Bxr3-1 mutant. The phenotype and auxin physiology of the max4 mutant is reminiscent of the/amosus pea mutants. The ramosus1 mutant regulates a graft transmissible signal that interacts with auxin to inhibit bud growth. The max4 and ramosus1 mutant phenotypes are caused by mutations in orthologous genes, encoding a member of the polyene dioxygenase family. All of the family members characterised to date function around a carbon-carbon double bond of polyene chain compounds with cyclic carbon end groups. MAX4 is most related to animal polyene dioxygenases that cleave carotenoid substrates. Possibly the MAX4/RMS1 proteins cleave a carotenoid to produce a novel mobile signal that iFlhibits bud growth, and may act as an auxin second messenger.
39
Hall, Jack Kingsbury Mathematics & Statistics Faculty of Science UNSW. "Some branching rules for GL(N,C)." Awarded by:University of New South Wales. Mathematics and Statistics, 2007. http://handle.unsw.edu.au/1959.4/29473.
Full textAbstract:
This thesis considers symmetric functions and algebraic combinatorics via the polynomial representation theory of GL(N,C). In particular, we utilise the theory of Jacobi-Trudi determinants to prove some new results pertaining to the Littlewood-Richardson coefficients. Our results imply, under some hypotheses on the strictness of the partition an equality between Littlewood-Richardson coefficients and Kostka numbers. For the case that a suitable partition has two rows, an explicit formula is then obtained for the Littlewood-Richardson coefficient using the Hook Length formula. All these results are then applied to compute branching laws for GL(m+n,C) restricting to GL(m,C) x GL(n,C). The technique also implies the well-known Racah formula.
40
Vrljicak, Pavle J. "Role of Smads during renal branching morphogenesis." Thesis, McGill University, 2003. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=19397.
Full textAbstract:
Transforming growth factor-p (TGFp) pathways have been shown to regulate renal branching morphogenesis, one of the key processes determining the final number of nephrons. Although Smads are known to be downstream mediators of these signals, little is known about their role in kidney development. Using RT-PCR and in situ hybridization we investigated the expression of Smads during kidney development. We have found that the receptor regulated Smads (1, 2, 3, 5 and 8) as well as the common partner (Smad4), are expressed in the developing kidney during nephrogenesis. These factors have a specific expression pattern that overlaps with the expression of the signalling molecules BMP-4 and TGFpi. Expression of Smads 1, 3, 4, 5 and 8 is mainly found in undifferentiated mesenchymal cells of the nephrogenic zone as well as ureteric bud tips, but is downregulated in condensing mesenchymal structures. Smad 2 is mostly expressed in the stromal cell compartment. The distinct, yet overlapping, expression of Smads suggests that the specificity of TGFp signals might be determined in part by the combination of Smads expressed in a particular cell type. To better characterize the role of TGFP in kidney development, mouse embryonic kidney explants were treated with soluble TGFP ligands. Addition of BMP-2 and TGFpi inhibited renal branching morphogenesis through their effects on proliferation and survival. Similarly, proliferation and survival appeared to be the critical processes affected by TGFP signalling in the mIMCD-3 model of tubulogenesis. The direct role of Smads was examined by overexpression of a Smad3-GFP fusion protein in mIMCD-3 cells. Apoptosis was most frequently co-localized to Smad-3 transfected cells, which was consistent with the effects observed from the ligand, TGFpi. To test these observations in vivo, we developed a novel method for the manipulation of embryonic kidney explants in culture. GFP-expression vectors were introduced in kidney explants without loss in viability, and the expression of GFP was found to be rapid and sustained for several days in culture. In summary, this study has placed Smads downstream of TGFP signals in the developing kidney, and it opens the door to finding molecules that might be affected by these signals.
41
Wang, Li. "Segmentation of branching structures from medical images." Thesis, University of Warwick, 2004. http://wrap.warwick.ac.uk/61391/.
Full textAbstract:
Segmentation is a preliminary but important stage in most applications that use medical image data. The work in this thesis mainly focuses on branching structure segmentation on 2D retinal images, by applying image processing and statistical pattern recognition techniques. This thesis presents a vascular modelling algorithm based on a multiresolution image representation. A 2D Hermite polynomial is introduced to model the blood vessel profile in a quad-tree structure over a range of spatial/spatial-frequency resolutions. The use of a multi-resolution representation allows robust analysis by combining information across scales and to help improve computational efficiency. A Fourier based modelling and estimation process is developed, followed by an EM type of optimisation scheme to estimate model parameters. An information based process is then presented to select the most appropriate scale/model for modelling each region of the image. In the final stage, a deterministic graph theoretic approach and a stochastic approach within a Bayesian framework are employed for linking the local features and inferring the global vascular structure. Experimental results on a number of retinal images have been shown to demonstrate the effective application of the proposed algorithms. Some preliminary results on 3D data are also presented showing the possible extension of the algorithms.
42
Bolotov, Alexander. "Clausal resolution for branching-time temporal logic." Thesis, Manchester Metropolitan University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.311209.
Full text
43
Moon, Simon Peter. "Branching process models of T cell selection." Thesis, University College London (University of London), 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.436119.
Full text
44
Hassan, A. E. "A study of flow in branching channels." Thesis, University of Strathclyde, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.372088.
Full text
45
Rafi'ee, Fanood Mohammad Hossien. "Branching in the radical polymerization of acrylamide." Thesis, Imperial College London, 1986. http://hdl.handle.net/10044/1/38138.
Full text
46
Roberts, Matthew. "Spine changes of measure and branching diffusions." Thesis, University of Bath, 2010. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.538554.
Full textAbstract:
The main object of study in this thesis is branching Brownian motion, in which each particle moves like a Brownian motion and gives birth to new particles at some rate. In particular we are interested in where particles are located in this model at large times T : so, for a function f up to time T , we want to know how many particles have paths that look like f. Additive spine martingales are central to the study, and we also investigate some simple general properties of changes of measure related to such martingales.
47
Bocharov, Sergey. "Branching Lévy Processes with Inhomogeneous Breeding Potentials." Thesis, University of Bath, 2012. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571868.
Full textAbstract:
The object of study in this thesis is a number of different models of branching Levy processes in inhomogeneous breeding potential. We employ some widely-used spine techniques to investigate various features of these models for their subsequent comparison. The thesis is divided into 5 chapters. In the first chapter we introduce the general framework for branching Markov processes within which we are going to present all our results. In the second chapter we consider a branching Brownian motion in the potential β|·|p, β> 0, p ≥0. We give a new proof of the result about the critical value of p for the explosion time of the population. The main advantage of the new proof is that it can be easily generalised to other models. The third chapter is devoted to continuous-time branching random walks in the potential β|·|p, β> 0, p ≥0. We give results about the explosion time and the right most particle behaviour comparing them with the known results for the branching Brownian motion. In the fourth chapter we look at general branching Levy processes in the potential β|·|p, β> 0, p ≥0. Subject to certain assumptions we prove some results about the explosion time and the rightmost particle. We exhibit how the corresponding results for the branching Brownian motion and and the branching random walk fit into the general structure. The last chapter considers a branching Brownian motion with branching taking place at the origin on the local time scale. We present some results about the population dynamics and the right most particle behaviour. We also prove the Strong Law of Large Numbers for this model.
48
Simek, Kyle. "Branching Gaussian Process Models for Computer Vision." Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/612094.
Full textAbstract:
Bayesian methods provide a principled approach to some of the hardest problems in computer vision—low signal-to-noise ratios, ill-posed problems, and problems with missing data. This dissertation applies Bayesian modeling to infer multidimensional continuous manifolds (e.g., curves, surfaces) from image data using Gaussian process priors. Gaussian processes are ideal priors in this setting, providing a stochastic model over continuous functions while permitting efficient inference. We begin by introducing a formal mathematical representation of branch curvilinear structures called a curve tree and we define a novel family of Gaussian processes over curve trees called branching Gaussian processes. We define two types of branching Gaussian properties and show how to extend them to branching surfaces and hypersurfaces. We then apply Gaussian processes in three computer vision applications. First, we perform 3D reconstruction of moving plants from 2D images. Using a branching Gaussian process prior, we recover high quality 3D trees while being robust to plant motion and camera calibration error. Second, we perform multi-part segmentation of plant leaves from highly occluded silhouettes using a novel Gaussian process model for stochastic shape. Our method obtains good segmentations despite highly ambiguous shape evidence and minimal training data. Finally, we estimate 2D trees from microscope images of neurons with highly ambiguous branching structure. We first fit a tree to a blurred version of the image where structure is less ambiguous. Then we iteratively deform and expand the tree to fit finer images, using a branching Gaussian process regularizing prior for deformation. Our method infers natural tree topologies despite ambiguous branching and image data containing loops. Our work shows that Gaussian processes can be a powerful building block for modeling complex structure, and they perform well in computer vision problems having significant noise and ambiguity.
49
Meinecke, Ingmar. "Weighted Branching Automata: Combining Concurrency and Weights." Doctoral thesis, Technische Universität Dresden, 2004. https://tud.qucosa.de/id/qucosa%3A24601.
Full textAbstract:
Eine der stärksten Erweiterungen der klassischen Theorie formaler Sprachen und Automaten ist die Einbeziehung von Gewichten oder Vielfachheiten aus einem Halbring. Diese Dissertation untersucht gewichtete Automaten über Strukturen mit Nebenläufigkeit. Wir erweitern die Arbeit von Lodaya und Weil und erhalten so ein Modell gewichteter verzweigender Automaten, in dem die Berechnung des Gewichts einer parallelen Komposition anders als die einer sequentiellen Komposition gehandhabt wird. Die von Lodaya und Weil eingeführten Automaten modellieren Nebenläufigkeit durch Verzweigen. Ein verzweigender Automat ist ein endlicher Automat mit drei verschiedenen Typen von Transitionen. Sequentielle Transitionen überführen durch Ausführen eines Ereignisses einen Zustand in einen anderen. Dagegen sind Gabel- und Binde-Transitionen für das Verzweigen verantwortlich. Läufe dieser Automaten werden beschrieben durch sequentiell-parallele posets, kurz sp-posets. Alle Transitionen des Automaten werden in unserem Modell mit Gewichten versehen. Neben dem Nichtdeterminismus und der sequentiellen Komposition wollen wir nun auch die parallele Komposition quantitativ behandeln. Dafür benötigen wir eine Gewichtsstruktur mit einer Addition, einer sequentiellen und einer parallelen Multiplikation. Solch eine Struktur, genannt Bihalbring, besteht damit de facto aus zwei Halbringen mit derselben additiven Struktur. Weiterhin muss die parallele Multiplikation kommutativ sein. Das Verhalten eines gewichteten verzweigenden Automaten ist dann eine Funktion, die jeder sp-poset ein Element eines Bihalbrings zuordnet. Das Hauptresultat charakterisiert das Verhalten dieser Automaten im Sinne von Kleenes und Schützenbergers Sätzen über das Zusammenfallen der Klassen der erkennbaren und der rationalen Sprachen bzw. formalen Potenzreihen. Darüber hinaus untersuchen wir den Abschluss dieser Verhalten unter allen rationalen Operationen und unter dem Hadamard-Produkt. Letztlich diskutieren wir Zusammenhänge zwischen Reihen und Sprachen im Rahmen verzweigender Automaten.One of the most powerful extensions of classical formal language and automata theory is the consideration of weights or multiplicities from a semiring. This thesis investigates weighted automata over structures incorporating concurrency. Extending work by Lodaya and Weil, we propose a model of weighted branching automata in which the calculation of the weight of a parallel composition is handled differently from the calculation of the weight of a sequential composition. The automata as proposed by Lodaya and Weil model concurrency by branching. A branching automaton is a finite-state device with three different types of transitions. Sequential transitions transform a state into another one by executing an action. In contrast, fork and join transitions are responsible for branching. Executions of such systems can be described by sequential-parallel posets, or sp-posets for short. In the model considered here all kinds of transitions are equipped with weights. Beside non-determinism and sequential composition we would like to deal with the parallel composition in a quantitative way. Therefore, we are in need of a weight structure equipped with addition, a sequential, and, moreover, a parallel multiplication. Such a structure, called a bisemiring, is actually composed of two semirings with the same additive structure. Moreover, the parallel multiplication has to be commutative. Now, the behavior of a weighted branching automaton is a function that associates with every sp-poset an element from the bisemiring. The main result characterizes the behavior of these automata in the spirit of Kleene's and Schützenberger's theorems about the coincidence of recognizable and rational languages, and formal power series, respectively. Moreover, we investigate the closure of behaviors under all rational operations and under Hadamard-product. Finally, we discuss connections between series and languages within our setting.
50
Brummer, Alexander B., and Alexander B. Brummer. "Asymmetric Branching in Biological Resource Distribution Networks." Diss., The University of Arizona, 2017. http://hdl.handle.net/10150/624308.
Full textAbstract:
There is a remarkable relationship between an organism's metabolic rate (resting power consumption) and the organism's mass. It may be a universal law of nature that an organism's resting metabolic rate is proportional to its mass to the power of 3/4. This relationship, known as Kleiber's Law, appears to be valid for both plants and animals. This law is important because it implies that larger organisms are more efficient than smaller organisms, and knowledge regarding metabolic rates are essential to a multitude of other fields in ecology and biology. This includes modeling the interactions of many species across multiple trophic levels, distributions of species abundances across large spatial landscapes, and even medical diagnostics for respiratory and cardiovascular pathologies. Previous models of vascular networks that seek to identify the origin of metabolic scaling have all been based on the unrealistic assumption of perfectly symmetric branching. In this dissertation I will present a theory of asymmetric branching in self-similar vascular networks (published by Brummer et al. in [9]). The theory shows that there can exist a suite of vascular forms that result in the often observed 3/4 metabolic scaling exponent of Kleiber's Law. Furthermore, the theory makes predictions regarding major morphological features related to vascular branching patterns and their relationships to metabolic scaling. These predictions are suggestive of evolutionary convergence in vascular branching. To test these predictions, I will present an analysis of real mammalian and plant vascular data that shows: (i) broad patterns in vascular networks across entire animal kingdoms and (ii) within these patterns, plant and mammalian vascular networks can be uniquely distinguished from one another (publication in preparation by Brummer et al.). I will also present results from a computational study in support of point (i). Namely, that asymmetric branching may be the optimal strategy to balance the simultaneous demands of maximizing the number of nutrient exchange sites (capillaries or leaves) versus hydraulic resistance to resource transport (publication in preparation by Brummer et al.). Finally, I report on improved methods of estimating whole organism metabolism based solely on measurements of vasculature.