Log in

Relevant bibliographies by topics / Graph parameter / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Graph parameter.

Dissertations / Theses on the topic 'Graph parameter'

Author: Grafiati

Published: 4 June 2021

Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Graph parameter.'

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

Soleimanfallah, Arezou. "Fixed-parameter tractable algorithms in graph theory." Thesis, Royal Holloway, University of London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wappler, Markus. "On Graph Embeddings and a new Minor Monotone Graph Parameter associated with the Algebraic Connectivity of a Graph." Doctoral thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-115518.

Full text

Abstract:

We consider the problem of maximizing the second smallest eigenvalue of the weighted Laplacian of a (simple) graph over all nonnegative edge weightings with bounded total weight. We generalize this problem by introducing node significances and edge lengths. We give a formulation of this generalized problem as a semidefinite program. The dual program can be equivalently written as embedding problem. This is fifinding an embedding of the n nodes of the graph in n-space so that their barycenter is at the origin, the distance between adjacent nodes is bounded by the respective edge length, and the

APA, Harvard, Vancouver, ISO, and other styles

3

Rocha, Mário. "The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2311.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Köpf, Boris Alexander. "Fixed parameter algorithms on planar graphs." [S.l. : s.n.], 2003. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10321688.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Drton, Mathias. "Maximum likelihood estimation in Gaussian AMP chain graph models and Gaussian ancestral graph models /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/8952.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Alipourazadi, Shahram. "New approaches to linear graph modeling of distributed-parameter systems." Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/41896.

Full text

Abstract:

Analytical modeling is an important fundamental step in the development of procedures such as simulation, design, control, and health monitoring of engineering systems. Typically, physical properties such as inertia, flexibility (or stiffness), capacitance, inductance, and energy dissipation (mechanical damping or electrical resistance) are spatially distributed in a physical dynamic system. Often in dynamic models, these characteristics are approximated by spatially “lumped” elements. For better accuracy, however, the true distributed nature of these parameters has to be incorporated into the

APA, Harvard, Vancouver, ISO, and other styles

7

Wilson, Samuel Stuart. "Characterising parameterized graph classes : certifying algorithms for fixed-parameter tractable problems." Thesis, University of Leeds, 2015. http://etheses.whiterose.ac.uk/11175/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Yu, Nuo 1983. "Fixed parameter tractable algorithms for optimal covering tours with turns." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=111595.

Full text

Abstract:

Many geometry problems can be solved by transformation to graph problems. Often, both the geometry version and graph version of the problem are NP-hard - and therefore not likely to be solved in polynomial time. One approach to solving these hard problems is to use fixed parameter tractable (FPT) algorithms. We present a framework for developing FPT algorithms for graph problems using dynamic programming, monadic second order logic of graphs, tree-width, and bidimensionality. We use this framework to obtain FPT results for covering tour problems on grid-graphs with turn costs. The results for

APA, Harvard, Vancouver, ISO, and other styles

9

Wappler, Markus [Verfasser], Christoph [Akademischer Betreuer] Helmberg, and Franz [Gutachter] Rendl. "On Graph Embeddings and a new Minor Monotone Graph Parameter associated with the Algebraic Connectivity of a Graph / Markus Wappler ; Gutachter: Franz Rendl ; Betreuer: Christoph Helmberg." Chemnitz : Universitätsbibliothek Chemnitz, 2013. http://d-nb.info/1214245757/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bouvier, Tom. "Graphes et décompositions." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0341/document.

Full text

Abstract:

Dans cette thèse, nous étudions diverses largeurs de graphes autour de la largeur arborescente ainsi que de la largeur de clique. Nous commençons avec une étude comparative entre la largeur arborescente d’un graphe et la largeur de clique du graphe d’incidence associé, de laquelle nous extrayons des résultats algorithmiques encourageants. Puis nous présentons quelques propriétés structurelles liées à la largeur arborescente spéciale, largeur relativement récente qui est à mi-chemin entre les deux largeurs précédentes. Enfin nous nous intéressons à une notion plus générale connue sous le nom de

APA, Harvard, Vancouver, ISO, and other styles

11

Dasgupta, Kaushani. "Parameter Estimation Using Consensus Building Strategies with Application to Sensor Networks." Thesis, University of North Texas, 2013. https://digital.library.unt.edu/ark:/67531/metadc407815/.

Full text

Abstract:

Sensor network plays a significant role in determining the performance of network inference tasks. A wireless sensor network with a large number of sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in WSN is developing an efficient protocol which has a significant impact on the convergence of the network. Parameter estimation is one of the most important applications of sensor network. In order to model such large and complex networks for estimation, efficient strategies and algorithms which take less time to converge are being deve

APA, Harvard, Vancouver, ISO, and other styles

12

Cunningham, James. "Efficient, Parameter-Free Online Clustering." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1606762403895603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Grout, Jason Nicholas. "Ultraconnected and Critical Graphs." BYU ScholarsArchive, 2004. https://scholarsarchive.byu.edu/etd/34.

Full text

Abstract:

We investigate the ultraconnectivity condition on graphs, and provide further connections between critical and ultraconnected graphs in the positive definite partial matrix completion problem. We completely characterize when the join of graphs is ultraconnected, and prove that ultraconnectivity is preserved by Cartesian products. We completely characterize when adding a vertex to an ultraconnected graph preserves ultraconnectivity. We also derive bounds on the number of vertices which guarantee ultraconnectivity of certain classes of regular graphs. We give results from our exhaustive enumerat

APA, Harvard, Vancouver, ISO, and other styles

14

Tran, The Truyen. "On conditional random fields: applications, feature selection, parameter estimation and hierarchical modelling." Curtin University of Technology, Dept. of Computing, 2008. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=18614.

Full text

Abstract:

There has been a growing interest in stochastic modelling and learning with complex data, whose elements are structured and interdependent. One of the most successful methods to model data dependencies is graphical models, which is a combination of graph theory and probability theory. This thesis focuses on a special type of graphical models known as Conditional Random Fields (CRFs) (Lafferty et al., 2001), in which the output state spaces, when conditioned on some observational input data, are represented by undirected graphical models. The contributions of thesis involve both (a) broadening

APA, Harvard, Vancouver, ISO, and other styles

15

Kim, Eun Jung. "Parameterized algorithms on digraph and constraint satisfaction problems." Thesis, Royal Holloway, University of London, 2010. http://repository.royalholloway.ac.uk/items/4e3a1971-6e98-97a9-8e4f-9e1fdc76066a/9/.

Full text

Abstract:

While polynomial-time approximation algorithms remain a dominant notion in tackling computationally hard problems, the framework of parameterized complexity has been emerging rapidly in recent years. Roughly speaking, the analytic framework of parameterized complexity attempts to grasp the difference between problems which admit O(c^k . poly(n))-time algorithms such as Vertex Cover, and problems like Dominating Set for which essentially brute-force O(n^k)-algorithms are best possible until now. Problems of the former type is said to be fixed-parameter tractable (FPT) and those of the latter ty

APA, Harvard, Vancouver, ISO, and other styles

16

Voráč, Ladislav. "Řiditelné filtry s maximálním možným přeladěním a netradičními aktivními prvky." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218353.

Full text

Abstract:

The thesis is paid to design frequency filters steerable jet active elements of the MO–CF (Multiple-Output Current Follower) and also newly-developed current active element DACA (Digitally Adjustable Current Amplifier) in the company ON Semiconductor. The first three chapters focus on basic properties of frequency filters, used components and circuit design methods. The digitally controllable current amplifier DACA is used for managing the radio frequency filters and adjust it using the current amplification parameter A through the digital input CTR. For the design of filters of the second ord

APA, Harvard, Vancouver, ISO, and other styles

17

Serrat, Yvan. "Un algorithme de vérification du schéma électrique extrait d'un circuit intégré." Grenoble 1, 1987. http://www.theses.fr/1987GRE10007.

Full text

Abstract:

L'etude presentee concerne la verification du schema electrique d'un circuit integre obtenu par extraction. Cette verification est basee sur la comparaison du schema electrique extrait avec le schema electrique de reference, utilise par le concepteur pour dessiner le circuit. Du point de vue mathematique, une telle comparaison est equivalente a un test d'isomorphisme effectue sur les graphes associes aux deux schemas. L'algorithme employe prend en compte tous les parametres des graphes (connectivite, type de noeuds, type de liaisons. . . ) pour determiner si oui ou non ces graphes sont isomorp

APA, Harvard, Vancouver, ISO, and other styles

18

Deering, Jessie. "Uphill & Downhill Domination in Graphs and Related Graph Parameters." Digital Commons @ East Tennessee State University, 2013. https://dc.etsu.edu/honors/103.

Full text

Abstract:

Placing degree constraints on the vertices of a path allows the definitions of uphill and downhill paths. Specifically, we say that a path π = v1, v2,...vk+1 is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi) ≥ deg(vi+1). Conversely, a path π = u1, u2,...uk+1 is an uphill path if for every i, 1 ≤ i ≤ k, deg(ui) ≤ deg(ui+1). We investigate graphical parameters related to downhill and uphill paths in graphs. For example, a downhill path set is a set P of vertex disjoint downhill paths such that every vertex v ∈ V belongs to at least one path in P, and the downhill path number is the minimum c

APA, Harvard, Vancouver, ISO, and other styles

19

Jerinic, Vasco. "ParaGraph - Parameterprüfung für Intellectual Properties." Doctoral thesis, Universitätsbibliothek Chemnitz, 2005. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200500518.

Full text

Abstract:

Beim Austausch von Intellectual Properties (IP) entsteht das Problem, daß der Anwender oftmals nicht sicher feststellen kann, ob die gewünschte Parameterkombination unterstützt wird bzw. ob die IP mit den gewünschten Einstellungen korrekt arbeitet. Ziel dieser Arbeit ist es, eine mögliche Lösung zur Parameterprüfung bereitzustellen. Im Rahmen des vom Bundesministerium für Bildung und Forschung (BMBF) geförderten Projekts Intellectual Property Qualifikation für effizientes Systemdesign [IPQ] wurde dazu das Entwurfswerkzeug entwickelt. Anhand einer durch den Entwerfer vorgegebenen formalen Bes

APA, Harvard, Vancouver, ISO, and other styles

20

Finbow, Stephen. "Graph parameters and products." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0018/MQ49351.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Chera, Catalin-Marian. "Contribution à l'extension de l'approche énergétique à la représentation des systèmes à paramètres distribués." Phd thesis, Ecole Centrale de Lille, 2009. http://tel.archives-ouvertes.fr/tel-00578842.

Full text

Abstract:

Tout phénomène, qu'il soit biologique, géologique ou mécanique peut être décrit à l'aide de lois de la physique en termes d'équations différentielles, algébriques ou intégrales, mettant en relation différentes variables physiques. Les objectifs de la thèse sont de montrer comment les systèmes à paramètres distribués peuvent être modélisés par un modèle bond graph, qui est par nature un modèle à paramètres localisés. Deux approches sont possibles : - utiliser une technique d'approximation qui discrétise le modèle initialement sous forme d'équations aux dérivées partielles (EDP) dans le domaine

APA, Harvard, Vancouver, ISO, and other styles

22

Sarkar, Medha Shukla. "GXL, a graph transformation language with scoping and graph parameters." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0013/NQ52862.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Neggazi, Brahim. "Self-stabilizing algorithms for graph parameters." Thesis, Lyon 1, 2015. http://www.theses.fr/2015LYO10041/document.

Full text

Abstract:

Le concept d'auto-stabilisation a été introduit par Dijkstra en 1973. Un système distribué est auto-stabilisant s'il peut démarrer de n'importe quelle configuration initiale et retrouver une configuration légitime en un temps fini par lui-même et sans aucune intervention extérieure. La convergence est également garantie lorsque le système est affecté par des fautes transitoires, ce qui en fait une approche élégante, non masquante, pour la tolérance aux pannes. L'auto-stabilisation a été étudiée dans divers domaines des systèmes distribués tels que les problèmes de synchronisation de l'horloge,

APA, Harvard, Vancouver, ISO, and other styles

24

Fischermann, Miranca. "Domination parameters and their unique realizations." [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=964904160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Collins, Andrew. "Graph parameters and the speed of hereditary properties." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/100734/.

Full text

Abstract:

In this thesis we study the speed of hereditary properties of graphs and how this defines some of the structure of the properties. We start by characterizing several graph parameters by means of minimal hereditary classes. We then give a global characterization of properties of low speed, before looking at properties with higher speeds starting at the Bell number. We then introduce a new parameter, clique-width, and show that there are an infinite amount of minimal hereditary properties with unbounded clique-width. We then look at the factorial layer in more detail and focus on P7-free biparti

APA, Harvard, Vancouver, ISO, and other styles

26

Mach, Lukáš. "Parameterized complexity : permutation patterns, graph arrangements, and matroid parameters." Thesis, University of Warwick, 2015. http://wrap.warwick.ac.uk/77519/.

Full text

Abstract:

The theory of parameterized complexity is an area of computer science focusing on refined analysis of hard algorithmic problems. In the thesis, we give two complexity lower bounds and define two novel parameters for matroids. The first lower bound is a kernelization lower bound for the Permutation Pattern Matching problem, which is concerned with finding a permutation pattern inside another input permutation. Our result states that unless a certain (widely believed) complexity hypothesis fails, it is impossible to construct a polynomial time algorithm taking an instance of the Permutation Patt

APA, Harvard, Vancouver, ISO, and other styles

27

Coetzer, Audrey. "Criticality of the lower domination parameters of graphs." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/1051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Lewis, Jason Robert. "Vertex-edge and edge-vertex parameters in graphs." Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079748/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Schneck, Thomas [Verfasser]. "New Parameters for Beyond-Planar Graphs / Thomas Schneck." Tübingen : Universitätsbibliothek Tübingen, 2020. http://d-nb.info/1222511037/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Roux, Adriana. "Vertex-criticality of the domination parameters of graphs." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6874.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Sato, Cristiane Maria. "Homomorfismos de grafos." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-07082008-105246/.

Full text

Abstract:

Homomorfismos de grafos são funções do conjunto de vértices de um grafo no conjunto de vértices de outro grafo que preservam adjacências. O estudo de homomorfismos de grafos é bastante abrangente, existindo muitas linhas de pesquisa sobre esse tópico. Nesta dissertação, apresentaremos resultados sobre homomorfismos de grafos relacionados a pseudo-aleatoriedade, convergência de seqüência de grafos e matrizes de conexão de invariantes de grafos. Esta linha tem se mostrado muito rica, não apenas pelos seus resultados, como também pelas técnicas utilizadas nas demonstrações. Em especial, destaca

APA, Harvard, Vancouver, ISO, and other styles

32

Mishra, Dharmendra Kumar. "Kinetic parameter estimation for degradation of anthocyanins in grape pomace." Diss., Connect to online resource - MSU authorized users, 2008.

Find full text

Abstract:

Thesis (M.S.)--Michigan State University. Dept. of Biosystems and Agricultural Engineering, 2008.<br>Title from PDF t.p. (viewed on Aug. 3, 2009) Includes bibliographical references. Also issued in print.

APA, Harvard, Vancouver, ISO, and other styles

33

Mohammed, Abdulhakeem Othman. "Slimness, Thinness and other Negative Curvature Parameters of Graphs." Kent State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1561995374485276.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

VERNIER, ISABELLE. "Graphe symbolique parametre de reseaux de petri et logique temporelle." Paris 6, 1994. http://www.theses.fr/1994PA066760.

Full text

Abstract:

Les programmes paralleles sont souvent definis pour un nombre fini mais non determine de processus. On peut alors souhaiter verifier des proprietes des programmes quel que soit le nombre de processus. Le programme defini pour un nombre fixe de processus est un programme instancie. Il a ete prouve que dans le cas general la verification parametree, i. E. Sans fixer le nombre de processus, est un probleme indecidable. Cependant, de nombreux travaux ont eu pour but de resoudre ce probleme pour des cas particuliers. Les methodes proposees sont non programmables, semi-decidables, avec des cas d'ech

APA, Harvard, Vancouver, ISO, and other styles

35

Calatroni, Luca. "New PDE models for imaging problems and applications." Thesis, University of Cambridge, 2016. https://www.repository.cam.ac.uk/handle/1810/256139.

Full text

Abstract:

Variational methods and Partial Differential Equations (PDEs) have been extensively employed for the mathematical formulation of a myriad of problems describing physical phenomena such as heat propagation, thermodynamic transformations and many more. In imaging, PDEs following variational principles are often considered. In their general form these models combine a regularisation and a data fitting term, balancing one against the other appropriately. Total variation (TV) regularisation is often used due to its edgepreserving and smoothing properties. In this thesis, we focus on the design of T

APA, Harvard, Vancouver, ISO, and other styles

36

Fouladgar, Javad. "Contribution à l'extension du calcul parallèle : Application à l'identification et à la commande des systèmes interconnectés." Nancy 1, 1988. http://www.theses.fr/1988NAN10133.

Full text

Abstract:

On utilise un graphe pour représenter les relations entre les différentes tâches constituant chaque algorithme d'identification et de commande. Ce graphe sert à l'ordonnancement et au calcul de la durée d'exécution grâce à la méthode CPM (critical path method)

APA, Harvard, Vancouver, ISO, and other styles

37

Mert, Mecnun. "Effect Of High Hydrostatic Pressure On Microbial Load And Quality Parameters Of Grape Juice." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12611536/index.pdf.

Full text

Abstract:

Effect of high hydrostatic pressure (150-200-250 MPa) on the microbial load and quality parameters (pH, color, 5-hydroxymethylfurfural-HMF) of white (Sultaniye) and red (Alicante Bouschet) grape juices with combination of temperature (20-30-40&deg<br>C) and holding time (5-10-15 min) was studied. Increased pressure and temperature showed significant effect on microbial reduction in white and red grape juices (p&lt<br>0.05). The effect of pressure and time on pH drop was found to be insignificant (p&gt<br>0.05). HHP resulted in E&lt<br>1 for white grape and E&lt<br>7 for red grape juice samples

APA, Harvard, Vancouver, ISO, and other styles

38

Kumar, Ashwani. "Optimizing Parameters for High-quality Metagenomic Assembly." Miami University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=miami1437997082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

DesOrmeaux, Wyatt Jules. "Restrained and Other Domination Parameters in Complementary Prisms." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/1998.

Full text

Abstract:

In this thesis, we will study several domination parameters of a family of graphs known as complementary prisms. We will first present the basic terminology and definitions necessary to understand the topic. Then, we will examine the known results addressing the domination number and the total domination number of complementary prisms. After this, we will present our main results, namely, results on the restrained domination number of complementary prisms. Subsequently results on the distance - k domination number, 2-step domination number and stratification of complementary prisms will be pre

APA, Harvard, Vancouver, ISO, and other styles

40

Tumanova, Natalija. "The Numerical Analysis of Nonlinear Mathematical Models on Graphs." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2012. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2012~D_20120720_121648-24321.

Full text

Abstract:

The numerical algorithms for non-stationary mathematical models in non-standard domains are investigated in the dissertation. The problem definition domain is represented by branching structures with conjugation equations considered at the branching points. The numerical analysis of the conjugation equations and non-classical boundary conditions distinguish considered problems among the classical problems of mathematical physics presented in the literature. The scope of the dissertation covers the investigation of stability and convergence of the numerical algorithms on branching structures wi

APA, Harvard, Vancouver, ISO, and other styles

41

Martin, Jonathan. "Impact of marine extracts applications on cv. Syrah grape (Vitis vinifera L.) yield components, harvest juice quality parameters, and nutrient uptake." DigitalCommons@CalPoly, 2011. https://digitalcommons.calpoly.edu/theses/699.

Full text

Abstract:

Vineyard management practices have an impact on grape berry development in ways that influence the quality of wine made from those grapes. The goal of this study was to determine whether exogenous applications of marine extracts on Syrah grapes can influence yield components, harvest juice quality parameters, and nutrient uptake. From 2009 to 2011, Syrah grape vines at the Trestle Vineyard on the California Polytechnic State University, San Luis Obispo campus received individual doses of marine extract via fertigation at berry set and veraison proportional to the amount they would receive on a

APA, Harvard, Vancouver, ISO, and other styles

42

Erincik, Omer. "Studies to determine time of grape berry and rachis susceptibility, and environmental parameters required for leaf and cane infection by phomopsis viticola /." The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486402957197997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Gumus, Selcuk. "Investigation Of Novel Topological Indices And Their Applications In Organic Chemistry." Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/2/12611019/index.pdf.

Full text

Abstract:

Numerical descriptors, beginning with Wiener, and then named topological indices by Hosoya, have gained gradually increasing importance along with other descriptors for use in QSAR and QSPR studies. Being able to estimate the physical or chemical properties of a yet nonexistent substance as close as possible is very important due to huge consumption of time and money upon direct synthesis. In addition, one may face safety problem as in the case of explosives. There have been almost hundred topological indices so far in the chemical graph theory literature. However, there is no topological inde

APA, Harvard, Vancouver, ISO, and other styles

44

Munaro, Andrea. "Sur quelques invariants classiques et nouveaux des hypergraphes." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM072/document.

Full text

Abstract:

Dans cette thèse, nous considérons plusieurs paramètres des hypergraphes et nous étudions si les restrictions aux sous-classes des hypergraphes permettent d’obtenir des propriétés combinatoires et algorithmiques souhaitables. La plupart des paramètres que nous prenons en compte sont des instances spéciales des packings et transversals des hypergraphes.Dans la première partie, nous allons nous concentrer sur les line graphs des graphes subcubiques sans triangle et nous allons démontrer que pour tous ces graphes il y a un independent set de taille au moins 3|V(G)|/10 et cette borne est optimale.

APA, Harvard, Vancouver, ISO, and other styles

45

Mroszczyk, Przemyslaw. "Computation with continuous mode CMOS circuits in image processing and probabilistic reasoning." Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/computation-with-continuous-mode-cmos-circuits-in-image-processing-and-probabilistic-reasoning(57ae58b7-a08c-4a67-ab10-5c3a3cf70c09).html.

Full text

Abstract:

The objective of the research presented in this thesis is to investigate alternative ways of information processing employing asynchronous, data driven, and analogue computation in massively parallel cellular processor arrays, with applications in machine vision and artificial intelligence. The use of cellular processor architectures, with only local neighbourhood connectivity, is considered in VLSI realisations of the trigger-wave propagation in binary image processing, and in Bayesian inference. Design issues, critical in terms of the computational precision and system performance, are exten

APA, Harvard, Vancouver, ISO, and other styles

46

McMahon, Heather. "The effects of different processing parameters (cold soak and percent alcohol (v/v) at dejuicing) on the concentrations of grape glycosides and glycoside fractions and glycosidase activities in selected yeast and lactic acid bacteria." Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/46209.

Full text

Abstract:

Grape-derived aroma and flavor precursors exist partially as non-volatile, sugar-bound glycosides. Hydrolysis of these compounds may modify sensory attributes and potentially enhance wine quality. Cold soak (prefermentation skin contact) at two temperatures and alcohol content (%, v/v) at dejuicing were monitored to determine effects on Cabernet Sauvignon glycoside concentration. Total, phenolic-free, and red-free glycoside concentrations were estimated by the quantification of glycosyl-glucose. Cold soak (5 days at 10Â° C) increased total glycosides by 77%, red-free glycosides by 80%, a

APA, Harvard, Vancouver, ISO, and other styles

47

Saez, Christine. "Etude des parametres de la fermentation alcoolique : application a l'elaboration du petillant de raisin." Toulouse, INSA, 1986. http://www.theses.fr/1986ISAT0030.

Full text

Abstract:

DANS L'ELABORATION DU PETILLANT DE RAISIN, L'ETAPE DE FERMENTATION JOUE LE ROLE PREPONDERANT DANS L'ETABLISSEMENT DE LA QUALITE ORGANOLEPTIQUE DU PRODUIT. AFIN DE L'OPTIMISER, SONT ETUDIES LES EFFETS DE DIVERS PARAMETRES OPERATOIRES EN PRENANT EN COMPTE AUSSI BIEN LES CRITERES QUALIFICATIFS QUE CINETIQUES. AINSI, IL EST DEMONTRE QUE: DE FORTS TAUX D'INOCULATION PERMETTENT DE REDUIRE LE TEMPS DE FERMENTATION, MAIS ONT UN EFFET DEFAVORABLE SUR LES COMPOSANTES AROMATIQUES DU PRODUIT; LA TEMPERATURE DE FERMENTATION, DANS UNE GAMME DE 15 A 20°c, N'A PAS D'INFLUENCE NOTABLE SUR LES QUALITES GUSTATIV

APA, Harvard, Vancouver, ISO, and other styles

48

Tumanova, Natalija. "Netiesinių matematinių modelių grafuose skaitinė analizė." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2012. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2012~D_20120720_121639-03735.

Full text

Abstract:

Disertacijoje nagrinėjami nestacionarių matematinių modelių nestandartinėse srityse skaitiniai sprendimo algoritmai. Uždavinio formulavimo sritis yra šakotosios struktūros (ang. branching structures), kurių išsišakojimo taškuose apibrėžiami tvermės dėsniai. Tvermės dėsnių skaitinė analizė ir nestandartinių kraštinių sąlygų analizė skiria nagrinėjamus uždavinius nuo klasikinių aprašytų literatūroje matematinės fizikos uždavinių. Disertacijoje suformuluoti uždaviniai apima skaitinių algoritmų šakotose struktūrose su skirtingais srautų tvermės dėsniais stabilumo ir konvergavimo tyrimą, lygiagreči

APA, Harvard, Vancouver, ISO, and other styles

49

Lamas, Celina de Almeida 1990. "Efeito protetor do concentrado de suco de uva no testículo e em parâmetros espermáticos de ratos intoxicados com cloreto de cádmio = Protective effect of grape juice concentrate effect in the testis and sperm parameters of rats intoxicated with cadmium chloride." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/317837.

Full text

Abstract:

Orientador: Mary Anne Heidi Dolder<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Biologia<br>Made available in DSpace on 2018-08-25T23:14:37Z (GMT). No. of bitstreams: 1 Lamas_CelinadeAlmeida_M.pdf: 4632096 bytes, checksum: e93808b5b5cccd35f9d08ba0c30c5a33 (MD5) Previous issue date: 2014<br>Resumo: O cádmio é um desregulador endócrino ressaltado por causar significativas disfunções fisiológicas e bioquímicas em animais e humanos. Está presente em pesticidas e no cigarro, sendo comum a contaminação de humanos. O testículo é um dos órgãos mais afetados pela toxici

APA, Harvard, Vancouver, ISO, and other styles

50

Cochefert, Manfred. "Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes." Thesis, Université de Lorraine, 2014. http://www.theses.fr/2014LORR0336/document.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à la résolution exacte de problèmes NP-difficiles sur les graphes et les hypergraphes. Les problèmes que nous étudions regroupent dans un premier temps des variantes du problème classique du nombre chromatique. Les variantes de ce problème se distinguent par la difficulté introduite par les relations entre les classes de couleurs, ou la difficulté de reconnaissance des classes de couleurs elles-mêmes. Puis nous ferons le lien avec les problèmes de transversaux sur les hypergraphes. Plus particulièrement, il s’agira de s’intéresser à l’énumération de tran

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!