subject:(Convexity)

NSYSU

1. Yen, Pei-Lan. A study of convexity in directed graphs.

Degree: PhD, Applied Mathematics, 2011, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740

► Convexity in graphs has been widely discussed in graph theory and G. Chartrand et al. introduced the convexity number of oriented graphs in 2002. In… (more)

Subjects/Keywords: convexity spectrum ratio; difference of convexity spectra; strong convexity spectrum; convexity spectrum; convex set; orientable convexity number; convexity number

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yen, P. (2011). A study of convexity in directed graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740

Chicago Manual of Style (16^th Edition):

Yen, Pei-Lan. “A study of convexity in directed graphs.” 2011. Doctoral Dissertation, NSYSU. Accessed February 22, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740.

MLA Handbook (7^th Edition):

Yen, Pei-Lan. “A study of convexity in directed graphs.” 2011. Web. 22 Feb 2020.

Vancouver:

Yen P. A study of convexity in directed graphs. [Internet] [Doctoral dissertation]. NSYSU; 2011. [cited 2020 Feb 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740.

Council of Science Editors:

Yen P. A study of convexity in directed graphs. [Doctoral Dissertation]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740

Anna University

2. Jeyaraman, M P. On certain aspects of subordinations And superordinations of analytic Functions; -.

Degree: Information and Communication Engineering, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27575

►

The work reported in this thesis is devoted mainly to the study of certain newlinesubclasses of analytic functions de ned on the open unit disc… (more)

Subjects/Keywords: Univalence Convexity Starlikeness

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jeyaraman, M. P. (2014). On certain aspects of subordinations And superordinations of analytic Functions; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27575

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Jeyaraman, M P. “On certain aspects of subordinations And superordinations of analytic Functions; -.” 2014. Thesis, Anna University. Accessed February 22, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/27575.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Jeyaraman, M P. “On certain aspects of subordinations And superordinations of analytic Functions; -.” 2014. Web. 22 Feb 2020.

Vancouver:

Jeyaraman MP. On certain aspects of subordinations And superordinations of analytic Functions; -. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Feb 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27575.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jeyaraman MP. On certain aspects of subordinations And superordinations of analytic Functions; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27575

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

3. Salimi, Ehsan. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.

Degree: PhD, Industrial Engineering, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/88056

► A set of n-dimensional integral vectors, Nn, is said to be right-closed if for any x 2 , any vector y x also belongs to… (more)

▼ A set of n-dimensional integral vectors, Nn, is said to be right-closed if for any x 2 , any vector y x also belongs to it. An integral-set Nn is convex if and only if there is a convex set C Rn such that = Int(C), where Int( ) denotes the integral points in the set argument. In this dissertation, we show that the problem of verifying convexity of a right-closed set is decidable. Following this, we present a polynomial time, LP-based algorithm, for verifying the convexity of a right-closed set of integral vectors, when the dimension n is xed. This result is to be viewed against the backdrop of the fact that checking the convexity of a real-valued, geometric set can only be accomplished in an approximate sense; and, the fact that most algorithms involving sets of real-valued vectors do not apply directly to their integral counterparts. Also, we discuss a grid-search based algorithm for verifying the convexity of such a set, although not a polynomial time procedure, it is a method that veri es the convexity of right-closed sets in a reasonable time complexity. On the application side, right-closed sets feature in the synthesis of Liveness Enforcing Supervisory Policies (LESPs) for a large family of Petri Nets (PNs). For any PN structure N from this family, the set of initial markings, (N), for which there is a LESP, is right-closed. A LESP determines the transitions of a PN that are to be permitted to re at any marking in such a manner that, irrespective of the past, every transition can be red at some marking in the future. A system that is modeled by a live PN does not experience livelocks, which serves as the motivation for investigating implementation paradigms for LESPs in practice. If a transition is prevented from ring at a marking by a LESP, and all LESPs, irrespective of the implementation-paradigm that is chosen, prescribe the same control for the marking, then it is a minimally restrictive LESP. It is possible to synthesize the minimally restrictive LESP for any instance N of the aforementioned family that uses the right-closed set of markings (N). The literature also contains an implementation paradigm called invariant-based monitors for liveness enforcement in PNs. This paradigm is popular due to the fact that the resulting supervisor can be directly incorporated into the semantics of the PN model of the controlled system. In this work, we show that there is an invariant-based monitor that is equivalent to the minimally restrictive LESP that uses the right-closed set (N) if and only if (N) is convex. This result serves as the motivation behind exploring the convexity of right-closed sets. Advisors/Committee Members: Sreenivas, Ramavarapu S. (advisor), Sreenivas, Ramavarapu S. (Committee Chair), Basar, Tamer (committee member), Nagi, Rakesh (committee member), Beck, Carolyn L. (committee member), Kiyavash, Negar (committee member).

Subjects/Keywords: Right-closed set; convexity; integer convexity; polyhedral theory; Petri Nets; Liveness

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Salimi, E. (2015). On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88056

Chicago Manual of Style (16^th Edition):

Salimi, Ehsan. “On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed February 22, 2020. http://hdl.handle.net/2142/88056.

MLA Handbook (7^th Edition):

Salimi, Ehsan. “On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.” 2015. Web. 22 Feb 2020.

Vancouver:

Salimi E. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/2142/88056.

Council of Science Editors:

Salimi E. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88056

University of Western Ontario

4. Mitrea, Octavian. Polynomial and Rational Convexity of Submanifolds of Euclidean Complex Space.

Degree: 2019, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/6303

► The goal of this dissertation is to prove two results which are essentially independent, but which do connect to each other via their direct applications… (more)

Subjects/Keywords: Polynomial convexity; Rational convexity; Lagrangian manifold; Kahler form; plurisubharmonic function; Analysis

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mitrea, O. (2019). Polynomial and Rational Convexity of Submanifolds of Euclidean Complex Space. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/6303

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mitrea, Octavian. “Polynomial and Rational Convexity of Submanifolds of Euclidean Complex Space.” 2019. Thesis, University of Western Ontario. Accessed February 22, 2020. https://ir.lib.uwo.ca/etd/6303.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mitrea, Octavian. “Polynomial and Rational Convexity of Submanifolds of Euclidean Complex Space.” 2019. Web. 22 Feb 2020.

Vancouver:

Mitrea O. Polynomial and Rational Convexity of Submanifolds of Euclidean Complex Space. [Internet] [Thesis]. University of Western Ontario; 2019. [cited 2020 Feb 22]. Available from: https://ir.lib.uwo.ca/etd/6303.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mitrea O. Polynomial and Rational Convexity of Submanifolds of Euclidean Complex Space. [Thesis]. University of Western Ontario; 2019. Available from: https://ir.lib.uwo.ca/etd/6303

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

5. Karr, William Alexander. Convexity and curvature in Lorentzian geometry.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/98106

► A space-time satisfies \mathcal{R} ≥ K if the sectional curvatures are bounded below by K for spacelike planes and above by K for timelike planes… (more)

Subjects/Keywords: Space-time; Curvature; Convexity; Convex functions; Geodesics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Karr, W. A. (2017). Convexity and curvature in Lorentzian geometry. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98106

Chicago Manual of Style (16^th Edition):

Karr, William Alexander. “Convexity and curvature in Lorentzian geometry.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed February 22, 2020. http://hdl.handle.net/2142/98106.

MLA Handbook (7^th Edition):

Karr, William Alexander. “Convexity and curvature in Lorentzian geometry.” 2017. Web. 22 Feb 2020.

Vancouver:

Karr WA. Convexity and curvature in Lorentzian geometry. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/2142/98106.

Council of Science Editors:

Karr WA. Convexity and curvature in Lorentzian geometry. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98106

6. Huckaby, Chad A. Observations on Convexity.

Degree: MS- Mathematical Sciences, Mathematics and Statistics, 2017, Stephen F. Austin State University

URL: https://scholarworks.sfasu.edu/etds/88

► This thesis will explore convexity as it pertains to sets of complex-valued functions. These include preliminary looks at established linear and polynomially convex hulls,… (more)

Subjects/Keywords: complex analysis; functional convexity; convex hull; Analysis

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Huckaby, C. A. (2017). Observations on Convexity. (Masters Thesis). Stephen F. Austin State University. Retrieved from https://scholarworks.sfasu.edu/etds/88

Chicago Manual of Style (16^th Edition):

Huckaby, Chad A. “Observations on Convexity.” 2017. Masters Thesis, Stephen F. Austin State University. Accessed February 22, 2020. https://scholarworks.sfasu.edu/etds/88.

MLA Handbook (7^th Edition):

Huckaby, Chad A. “Observations on Convexity.” 2017. Web. 22 Feb 2020.

Vancouver:

Huckaby CA. Observations on Convexity. [Internet] [Masters thesis]. Stephen F. Austin State University; 2017. [cited 2020 Feb 22]. Available from: https://scholarworks.sfasu.edu/etds/88.

Council of Science Editors:

Huckaby CA. Observations on Convexity. [Masters Thesis]. Stephen F. Austin State University; 2017. Available from: https://scholarworks.sfasu.edu/etds/88

University of Manchester

7. Trybus, Adam. An Axiom System for a Spatial Logic with Convexity.

Degree: 2012, University of Manchester

URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:154840

► A spatial logic is any formal language with geometric interpretation. Research on region-based spatial logics, where variables are set to range over certain subsets of… (more)

Subjects/Keywords: logic; mathematical logic; spatial logic; convexity; axiomatization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Trybus, A. (2012). An Axiom System for a Spatial Logic with Convexity. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:154840

Chicago Manual of Style (16^th Edition):

Trybus, Adam. “An Axiom System for a Spatial Logic with Convexity.” 2012. Doctoral Dissertation, University of Manchester. Accessed February 22, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:154840.

MLA Handbook (7^th Edition):

Trybus, Adam. “An Axiom System for a Spatial Logic with Convexity.” 2012. Web. 22 Feb 2020.

Vancouver:

Trybus A. An Axiom System for a Spatial Logic with Convexity. [Internet] [Doctoral dissertation]. University of Manchester; 2012. [cited 2020 Feb 22]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:154840.

Council of Science Editors:

Trybus A. An Axiom System for a Spatial Logic with Convexity. [Doctoral Dissertation]. University of Manchester; 2012. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:154840

8. Mohammed, Osama. Approximation des fonctions de plusieurs variables sous contrainte de convexité : Approximation of multivariate functions under certain generalized convexity assumptions.

Degree: Docteur es, Mathématiques appliquées, 2017, Pau

URL: http://www.theses.fr/2017PAUU3014

► Dans de nombreuses applications, nous souhaitons interpoler ou approcher une fonction de plusieurs variables possédant certaines propriétés ou “formes” géométriques, telles que la régularité, la… (more)

▼ Dans de nombreuses applications, nous souhaitons interpoler ou approcher une fonction de plusieurs variables possédant certaines propriétés ou “formes” géométriques, telles que la régularité, la monotonie, la convexité ou la non-négativité. Ces propriétés sont importantes pourdes applications en physique (par exemple, la courbe pression-volume doit avoir une dérivée non négative), aussi bien où le problème de l’interpolation conservant la forme est essentiel dans divers problèmes de l’industrie (par exemple, modélisation automobile, construction de la surface dumasque). Par conséquent, une question importante se pose : comment calculer la meilleure approximation possible à une fonction donnée f lorsque certaines de ses propriétés caractéristiques supplémentaires sont connues ?Cette thèse présente plusieurs nouvelles techniques pour trouver une bonne approximation des fonctions de plusieurs variables par des opérateurs linéaires dont l’erreur d’approximation A( f ) - f garde un signe constant pour toute fonction f satisfaisant une certaine convexité généralisée. Nous nous concentrons dans cette thèse sur la classe des fonctions convexesou fortement convexes. Nous décrirons comment la connaissance a priori de cette information peut être utilisée pour déterminer une bonne majoration de l’erreur pour des fonctions continuellement différentiables avec des gradients Lipschitz continus. Plus précisément, nous montrons que les estimations d’erreur basées sur ces opérateurs sont toujours contrôléespar les constantes de Lipschitz des gradients, le paramètre de la convexité forte ainsi que l’erreur commise associée à l’utilisation de la fonction quadratique. En supposant en plus que la fonction que nous voulons approcher est également fortement convexe, nous établissons de meilleures bornes inférieures et supérieures pour les estimations d’erreur de l’approximation. Lesméthodes de quadrature multidimensionnelle jouent un rôle important, voire fondamental, en analyse numérique. Une analyse satisfaisante des erreurs provenant de l’utilisationdes formules de quadrature multidimensionnelle est bien moins étudiée que dans le cas d’une variable. Nous proposons une méthode d’approximation de l’intégrale d’une fonction réelle donnée à plusieurs variables par des formules de quadrature, qui conduisent à des valeurs approchées par excès (respectivement par défaut) des intégrales des fonctions ayantun certain type de convexité. Nous verrons aussi, comme nous l’avons fait pour l’approximation des fonctions, que pour de telles formules d’intégration, on peut établir un résultat de caractérisation en termes d’estimations d’erreur. En outre, nous avons étudié le problèmede l’approximation d’une intégrale définie d’une fonction donnée quand un certain nombre d’intégrales de cette fonction sur certaines sections hyperplanes d’un l’hyper-rectangle sont seulement disponibles.La motivation derrière ce type de problème est multiple. Il se pose dans de nombreuses applications, en particulier en physique expérimentale et en ingénierie, où les valeurs… Advisors/Committee Members: Guessab, Allal (thesis director).

Subjects/Keywords: Convexité; Formules; Corps convexes; Convexity; Strong convexity; Positive and Negative definitive cubature formulas; 519

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mohammed, O. (2017). Approximation des fonctions de plusieurs variables sous contrainte de convexité : Approximation of multivariate functions under certain generalized convexity assumptions. (Doctoral Dissertation). Pau. Retrieved from http://www.theses.fr/2017PAUU3014

Chicago Manual of Style (16^th Edition):

Mohammed, Osama. “Approximation des fonctions de plusieurs variables sous contrainte de convexité : Approximation of multivariate functions under certain generalized convexity assumptions.” 2017. Doctoral Dissertation, Pau. Accessed February 22, 2020. http://www.theses.fr/2017PAUU3014.

MLA Handbook (7^th Edition):

Mohammed, Osama. “Approximation des fonctions de plusieurs variables sous contrainte de convexité : Approximation of multivariate functions under certain generalized convexity assumptions.” 2017. Web. 22 Feb 2020.

Vancouver:

Mohammed O. Approximation des fonctions de plusieurs variables sous contrainte de convexité : Approximation of multivariate functions under certain generalized convexity assumptions. [Internet] [Doctoral dissertation]. Pau; 2017. [cited 2020 Feb 22]. Available from: http://www.theses.fr/2017PAUU3014.

Council of Science Editors:

Mohammed O. Approximation des fonctions de plusieurs variables sous contrainte de convexité : Approximation of multivariate functions under certain generalized convexity assumptions. [Doctoral Dissertation]. Pau; 2017. Available from: http://www.theses.fr/2017PAUU3014

9. Rafael Teixeira de AraÃjo. Convexities convexities of paths and geometric.

Degree: Master, 2014, Universidade Federal do Ceará

URL: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104 ;

►

In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number… (more)

▼

In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did research in geometric convexity and from that we characterized graph classes under some convexities such as the star florest in P3 convexity, chordal cographs in P∗ 3 convexity, and the florests in TP convexity. We also demonstrated convexities that are geometric only in specific graph classes such as cographs in P4+-free convexity, F free graphs in F-free convexity and others. Finally, we demonstrated some results of geodesic convexity and P∗ 3 in graphs with few P4âs.

Advisors/Committee Members: Rudini Menezes Sampaio, Fabricio Siqueira Benevides, Mitre Costa Dourado, Leonardo Sampaio Rocha.

Subjects/Keywords: CIENCIA DA COMPUTACAO; Convexidade em grafos; Convexidade geodÃsica; NÃmero de Hull; NÃmero de convexidade; Convexidade geomÃtrica; Convexity in graph; hull number; convexity number; P3 convexity; geodetic convexity; geometric convexity; Teoria dos grafos

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

AraÃjo, R. T. d. (2014). Convexities convexities of paths and geometric. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104 ;

Chicago Manual of Style (16^th Edition):

AraÃjo, Rafael Teixeira de. “Convexities convexities of paths and geometric.” 2014. Masters Thesis, Universidade Federal do Ceará. Accessed February 22, 2020. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104 ;.

MLA Handbook (7^th Edition):

AraÃjo, Rafael Teixeira de. “Convexities convexities of paths and geometric.” 2014. Web. 22 Feb 2020.

Vancouver:

AraÃjo RTd. Convexities convexities of paths and geometric. [Internet] [Masters thesis]. Universidade Federal do Ceará 2014. [cited 2020 Feb 22]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104 ;.

Council of Science Editors:

AraÃjo RTd. Convexities convexities of paths and geometric. [Masters Thesis]. Universidade Federal do Ceará 2014. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104 ;

Indian Institute of Science

10. Gorai, Sushil. Exploring Polynomial Convexity Of Certain Classes Of Sets.

Degree: 2010, Indian Institute of Science

URL: http://hdl.handle.net/2005/1302

► Let K be a compact subset of Cn . The polynomially convex hull of K is defined as The compact set K is said to… (more)

▼ Let K be a compact subset of Cn . The polynomially convex hull of K is defined as The compact set K is said to be polynomially convex if = K. A closed subset is said to be locally polynomially convex at if there exists a closed ball centred at z such that is polynomially convex. The aim of this thesis is to derive easily checkable conditions to detect polynomial convexity in certain classes of sets in This thesis begins with the basic question: Let S1 and S2 be two smooth, totally real surfaces in C2 that contain the origin. If the union of their tangent planes is locally polynomially convex at the origin, then is locally polynomially convex at the origin? If then it is a folk result that the answer is, “Yes.” We discuss an obstruction to the presumed proof, and use a different approach to provide a proof. When dimR it turns out that the positioning of the complexiﬁcation of controls the outcome in many situations. In general, however, local polynomial convexity of also depends on the degeneracy of the contact of T0Sj with We establish a result showing this. Next, we consider a generalization of Weinstock’s theorem for more than two totally real planes in C2 . Using a characterization, recently found by Florentino, for simultaneous triangularizability over R of real matrices, we present a sufficient condition for local polynomial convexity at of union of finitely many totally real planes is C2 . The next result is motivated by an approximation theorem of Axler and Shields, which says that the uniform algebra on the closed unit disc generated by z and h — where h is a nowhereholomorphic harmonic function on D that is continuous up to ∂D — equals . The abstract tools used by Axler and Shields make harmonicity of h an essential condition for their result. We use the concepts of plurisubharmonicity and polynomial convexity to show that, in fact, the same conclusion is reached if h is replaced by h+ R, where R is a nonharmonic perturbation whose Laplacian is “small” in a certain sense. Ideas developed for the latter result, especially the role of plurisubharmonicity, lead us to our ﬁnal result: a characterization for compact patches of smooth, totallyreal graphs in to be polynomially convex. Advisors/Committee Members: Bharali, Gautam.

Subjects/Keywords: Sets; Polynomial Convex Sets; Convex Sets; Polynomial Convexity; Polynomials; Approximation Theory; Lemma (Mathematics); Axler-Shields Approximation Theorem; Graphs - Polynomial Convexity; Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gorai, S. (2010). Exploring Polynomial Convexity Of Certain Classes Of Sets. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1302

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gorai, Sushil. “Exploring Polynomial Convexity Of Certain Classes Of Sets.” 2010. Thesis, Indian Institute of Science. Accessed February 22, 2020. http://hdl.handle.net/2005/1302.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gorai, Sushil. “Exploring Polynomial Convexity Of Certain Classes Of Sets.” 2010. Web. 22 Feb 2020.

Vancouver:

Gorai S. Exploring Polynomial Convexity Of Certain Classes Of Sets. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/2005/1302.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gorai S. Exploring Polynomial Convexity Of Certain Classes Of Sets. [Thesis]. Indian Institute of Science; 2010. Available from: http://hdl.handle.net/2005/1302

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

11. Yen, Pei-lan. The Convexity Spectra and the Strong Convexity Spectra of Graphs.

Degree: Master, Applied Mathematics, 2005, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156

► Given a connected oriented graph D, we say that a subset S of V(D) is convex in D if, for every pair of vertices x,… (more)

Subjects/Keywords: Convex set; convexity number; convexity spectrum; complete graph

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yen, P. (2005). The Convexity Spectra and the Strong Convexity Spectra of Graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yen, Pei-lan. “The Convexity Spectra and the Strong Convexity Spectra of Graphs.” 2005. Thesis, NSYSU. Accessed February 22, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yen, Pei-lan. “The Convexity Spectra and the Strong Convexity Spectra of Graphs.” 2005. Web. 22 Feb 2020.

Vancouver:

Yen P. The Convexity Spectra and the Strong Convexity Spectra of Graphs. [Internet] [Thesis]. NSYSU; 2005. [cited 2020 Feb 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yen P. The Convexity Spectra and the Strong Convexity Spectra of Graphs. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

12. Gorai, Sushil. Exploring Polynomial Convexity Of Certain Classes Of Sets.

Degree: 2010, Indian Institute of Science

URL: http://etd.iisc.ernet.in/handle/2005/1302 ; http://etd.ncsi.iisc.ernet.in/abstracts/1685/G23796-Abs.pdf

► Let K be a compact subset of Cn . The polynomially convex hull of K is defined as The compact set K is said to… (more)

▼ Let K be a compact subset of Cn . The polynomially convex hull of K is defined as The compact set K is said to be polynomially convex if = K. A closed subset is said to be locally polynomially convex at if there exists a closed ball centred at z such that is polynomially convex. The aim of this thesis is to derive easily checkable conditions to detect polynomial convexity in certain classes of sets in This thesis begins with the basic question: Let S1 and S2 be two smooth, totally real surfaces in C2 that contain the origin. If the union of their tangent planes is locally polynomially convex at the origin, then is locally polynomially convex at the origin? If then it is a folk result that the answer is, “Yes.” We discuss an obstruction to the presumed proof, and use a different approach to provide a proof. When dimR it turns out that the positioning of the complexiﬁcation of controls the outcome in many situations. In general, however, local polynomial convexity of also depends on the degeneracy of the contact of T0Sj with We establish a result showing this. Next, we consider a generalization of Weinstock’s theorem for more than two totally real planes in C2 . Using a characterization, recently found by Florentino, for simultaneous triangularizability over R of real matrices, we present a sufficient condition for local polynomial convexity at of union of finitely many totally real planes is C2 . The next result is motivated by an approximation theorem of Axler and Shields, which says that the uniform algebra on the closed unit disc generated by z and h — where h is a nowhereholomorphic harmonic function on D that is continuous up to ∂D — equals . The abstract tools used by Axler and Shields make harmonicity of h an essential condition for their result. We use the concepts of plurisubharmonicity and polynomial convexity to show that, in fact, the same conclusion is reached if h is replaced by h+ R, where R is a nonharmonic perturbation whose Laplacian is “small” in a certain sense. Ideas developed for the latter result, especially the role of plurisubharmonicity, lead us to our ﬁnal result: a characterization for compact patches of smooth, totallyreal graphs in to be polynomially convex. Advisors/Committee Members: Bharali, Gautam.

Subjects/Keywords: Sets; Polynomial Convex Sets; Convex Sets; Polynomial Convexity; Polynomials; Approximation Theory; Lemma (Mathematics); Axler-Shields Approximation Theorem; Graphs - Polynomial Convexity; Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gorai, S. (2010). Exploring Polynomial Convexity Of Certain Classes Of Sets. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/1302 ; http://etd.ncsi.iisc.ernet.in/abstracts/1685/G23796-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gorai, Sushil. “Exploring Polynomial Convexity Of Certain Classes Of Sets.” 2010. Thesis, Indian Institute of Science. Accessed February 22, 2020. http://etd.iisc.ernet.in/handle/2005/1302 ; http://etd.ncsi.iisc.ernet.in/abstracts/1685/G23796-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gorai, Sushil. “Exploring Polynomial Convexity Of Certain Classes Of Sets.” 2010. Web. 22 Feb 2020.

Vancouver:

Gorai S. Exploring Polynomial Convexity Of Certain Classes Of Sets. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2020 Feb 22]. Available from: http://etd.iisc.ernet.in/handle/2005/1302 ; http://etd.ncsi.iisc.ernet.in/abstracts/1685/G23796-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gorai S. Exploring Polynomial Convexity Of Certain Classes Of Sets. [Thesis]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ernet.in/handle/2005/1302 ; http://etd.ncsi.iisc.ernet.in/abstracts/1685/G23796-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Andriamasy, Rabaozafy Louisa. Les technologies de production tropicales et leurs champs d'applications en économie : Tropical production technologies and its applications in Economics.

Degree: Docteur es, Sciences Economiques, 2018, Perpignan

URL: http://www.theses.fr/2018PERP0021

►

Les mathématiques tropicales sont une branche des mathématiques correspondant à l'étude d'une algèbre modifiée grâce à la redéfinition de l'addition et de la multiplication. Les… (more)

▼

Les mathématiques tropicales sont une branche des mathématiques correspondant à l'étude d'une algèbre modifiée grâce à la redéfinition de l'addition et de la multiplication. Les mathématiques tropicales sont généralement définies grâce au minimum et à l'addition (algèbre min-plus) mais le terme est parfois utilisé pour désigner l'algèbre max-plus, définie grâce au maximum et à l'addition. Briec et Horvath ont introduit une notion de convexité très proche qui apparait comme un cas limite d’opérateurs utilisés en théorie de l’optimisation par Avriel (1972) et de Ben-Tal (1977). En suivant cette ligne d’investigation, nous allons proposer, dans le domaine de l’économie de la production et de l’optimisation de portefeuille, une certaine classe de modèles économiques à élaborés à partir de ces notions. Pour ce faire, nous introduisons une nouvelle classe de technologie de production permettant de prendre en compte les structures d’homothe´tie-translation dans la mesure de productivité au travers du concept de la Convexité Max-Plus. Ensuite, nous allons établir une relation topologique entre plusieurs classes de modèles convexes généralisés connus. Nous analysons pour cela la limite de Painlevé-Kuratowski des modèles CES-CET et des technologies non paramétriques satisfaisant une hypothèse de rendements d’échelle alpha. On montre que leurs limites topologiques convergent vers les modèles de production B-convexe et Cobb-Douglas. Enfin, nous allons montrer que l'amélioration de l'efficacité technique d’une coalition d’entreprises s'avère compatible avec les technologies de semi-treillis dans un jeu coopératif. Nous introduisons ensuite, le concept d’écart absolu moyen dans la sélection du portefeuille en utilisant le « Shortage Function » qui prend en compte simultanément la réduction des inputs et l’augmentation des outputs comme dans la théorie de la production. Enfin, nous allons étendre le concept de B-convexité et de l’inverse B-convexité en se concentrant sur le calcul des mesures d’efficacité technique dans le graphe.

Tropical algebra is the tropical analogue of linear algebra by redefining the usual operation addition by the maximization operation and the usual addition operation as multiplication. Briec and Horvath introduced a concept of convexity very close to this concept quoted above which appears as one of the limits of use of the theory of optimization by Avriel (1972) and Ben-Tal (1977). Following this line of investigation, we give an overview of contributions involving a semilattice structure of production technologies and an optimization portfolio. To do that, firstly, we propose a framework allowing to consider both semilattice structure and translation homothetic properties in productivity measurement. We introduce the concept of Max-Plus convexity which combine both an upper semilattice structure and an additivity assumption. We establish a topological relation between several classes of known generalized convex models using some basic algebraic convex structures. We analyze the Painlevé-Kuratowski…

Advisors/Committee Members: Briec, Walter (thesis director), Serea, Oana-Silvia (thesis director).

Subjects/Keywords: Semitreillis; Convexité; Algèbre tropical; Painlevé Kuratowski; CES-CET; Semilattices; Generalized convexity; Max-Plus convexity; Tropical algebra; Painlevé Kuratowski; 330

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Andriamasy, R. L. (2018). Les technologies de production tropicales et leurs champs d'applications en économie : Tropical production technologies and its applications in Economics. (Doctoral Dissertation). Perpignan. Retrieved from http://www.theses.fr/2018PERP0021

Chicago Manual of Style (16^th Edition):

Andriamasy, Rabaozafy Louisa. “Les technologies de production tropicales et leurs champs d'applications en économie : Tropical production technologies and its applications in Economics.” 2018. Doctoral Dissertation, Perpignan. Accessed February 22, 2020. http://www.theses.fr/2018PERP0021.

MLA Handbook (7^th Edition):

Andriamasy, Rabaozafy Louisa. “Les technologies de production tropicales et leurs champs d'applications en économie : Tropical production technologies and its applications in Economics.” 2018. Web. 22 Feb 2020.

Vancouver:

Andriamasy RL. Les technologies de production tropicales et leurs champs d'applications en économie : Tropical production technologies and its applications in Economics. [Internet] [Doctoral dissertation]. Perpignan; 2018. [cited 2020 Feb 22]. Available from: http://www.theses.fr/2018PERP0021.

Council of Science Editors:

Andriamasy RL. Les technologies de production tropicales et leurs champs d'applications en économie : Tropical production technologies and its applications in Economics. [Doctoral Dissertation]. Perpignan; 2018. Available from: http://www.theses.fr/2018PERP0021

14. Bari, Abdul. Some integer programming problems and their solution procedures; -.

Degree: Statistics, 1977, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/51761

Abstract available newline newline

Bibliography given

Advisors/Committee Members: Khan, S U and Ali, S M.

Subjects/Keywords: Mathematical; Integers; Algorithm; Glover; Convexity

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bari, A. (1977). Some integer programming problems and their solution procedures; -. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/51761

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bari, Abdul. “Some integer programming problems and their solution procedures; -.” 1977. Thesis, Aligarh Muslim University. Accessed February 22, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/51761.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bari, Abdul. “Some integer programming problems and their solution procedures; -.” 1977. Web. 22 Feb 2020.

Vancouver:

Bari A. Some integer programming problems and their solution procedures; -. [Internet] [Thesis]. Aligarh Muslim University; 1977. [cited 2020 Feb 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51761.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bari A. Some integer programming problems and their solution procedures; -. [Thesis]. Aligarh Muslim University; 1977. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51761

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Manoj, Changat. Studies on Convexity in Some Discrete Structures.

Degree: 1990, Cochin University of Science and Technology

URL: http://dyuthi.cusat.ac.in/purl/1601

Subjects/Keywords: Discrete Geometry; Convexity; Helly's Theorem

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Manoj, C. (1990). Studies on Convexity in Some Discrete Structures. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/1601

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Manoj, Changat. “Studies on Convexity in Some Discrete Structures.” 1990. Thesis, Cochin University of Science and Technology. Accessed February 22, 2020. http://dyuthi.cusat.ac.in/purl/1601.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Manoj, Changat. “Studies on Convexity in Some Discrete Structures.” 1990. Web. 22 Feb 2020.

Vancouver:

Manoj C. Studies on Convexity in Some Discrete Structures. [Internet] [Thesis]. Cochin University of Science and Technology; 1990. [cited 2020 Feb 22]. Available from: http://dyuthi.cusat.ac.in/purl/1601.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Manoj C. Studies on Convexity in Some Discrete Structures. [Thesis]. Cochin University of Science and Technology; 1990. Available from: http://dyuthi.cusat.ac.in/purl/1601

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Parvathy, K S. Studies on Convex structures with emphasis on Convexity in Graphs.

Degree: 1995, Cochin University of Science and Technology

URL: http://dyuthi.cusat.ac.in/purl/1659

Subjects/Keywords: Convex structures; Convexity in Graphs

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Parvathy, K. S. (1995). Studies on Convex structures with emphasis on Convexity in Graphs. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/1659

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Parvathy, K S. “Studies on Convex structures with emphasis on Convexity in Graphs.” 1995. Thesis, Cochin University of Science and Technology. Accessed February 22, 2020. http://dyuthi.cusat.ac.in/purl/1659.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Parvathy, K S. “Studies on Convex structures with emphasis on Convexity in Graphs.” 1995. Web. 22 Feb 2020.

Vancouver:

Parvathy KS. Studies on Convex structures with emphasis on Convexity in Graphs. [Internet] [Thesis]. Cochin University of Science and Technology; 1995. [cited 2020 Feb 22]. Available from: http://dyuthi.cusat.ac.in/purl/1659.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Parvathy KS. Studies on Convex structures with emphasis on Convexity in Graphs. [Thesis]. Cochin University of Science and Technology; 1995. Available from: http://dyuthi.cusat.ac.in/purl/1659

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Newcastle Upon Tyne

17. Iqbal, Rafhat. Shape-preserving algorithms for curve and surface design.

Degree: PhD, 1998, University of Newcastle Upon Tyne

URL: http://hdl.handle.net/10443/2089

► This thesis investigates, develops and implements algorithms for shape- preserving curve and surface design that aim to reflect the shape characteristics of the underlying geometry… (more)

Subjects/Keywords: 620.0042029; Computer graphics; Convexity preserving

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Iqbal, R. (1998). Shape-preserving algorithms for curve and surface design. (Doctoral Dissertation). University of Newcastle Upon Tyne. Retrieved from http://hdl.handle.net/10443/2089

Chicago Manual of Style (16^th Edition):

Iqbal, Rafhat. “Shape-preserving algorithms for curve and surface design.” 1998. Doctoral Dissertation, University of Newcastle Upon Tyne. Accessed February 22, 2020. http://hdl.handle.net/10443/2089.

MLA Handbook (7^th Edition):

Iqbal, Rafhat. “Shape-preserving algorithms for curve and surface design.” 1998. Web. 22 Feb 2020.

Vancouver:

Iqbal R. Shape-preserving algorithms for curve and surface design. [Internet] [Doctoral dissertation]. University of Newcastle Upon Tyne; 1998. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/10443/2089.

Council of Science Editors:

Iqbal R. Shape-preserving algorithms for curve and surface design. [Doctoral Dissertation]. University of Newcastle Upon Tyne; 1998. Available from: http://hdl.handle.net/10443/2089

18. Kumari Latha,T. The open geodetic number of a graph;.

Degree: 2014, Manonmaniam Sundaranar University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/19710

►

One concept that pervades all of graph theory is that newlineof distance, and distance is used in isomorphism testing, graph operations, hamil- newlinetonicity problems, extremal… (more)

Subjects/Keywords: convexity theory; distance; geodetic number; graph; isomorphism testing; theoretical Chemistry

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Latha,T, K. (2014). The open geodetic number of a graph;. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/19710

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Latha,T, Kumari. “The open geodetic number of a graph;.” 2014. Thesis, Manonmaniam Sundaranar University. Accessed February 22, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/19710.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Latha,T, Kumari. “The open geodetic number of a graph;.” 2014. Web. 22 Feb 2020.

Vancouver:

Latha,T K. The open geodetic number of a graph;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2020 Feb 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/19710.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Latha,T K. The open geodetic number of a graph;. [Thesis]. Manonmaniam Sundaranar University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/19710

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

The Ohio State University

19. Otto, Michael. Symplectic convexity theorems and applications to the structure theory of semisimple Lie groups.

Degree: PhD, Mathematics, 2004, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1084986339

► Atiyah’s well known convexity theorem states that for a Hamiltonian torus action T × M ¿ M on a compact connected symplectic manifold M the image F(M) under… (more)

Subjects/Keywords: Mathematics; Moment map; convexity

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Otto, M. (2004). Symplectic convexity theorems and applications to the structure theory of semisimple Lie groups. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1084986339

Chicago Manual of Style (16^th Edition):

Otto, Michael. “Symplectic convexity theorems and applications to the structure theory of semisimple Lie groups.” 2004. Doctoral Dissertation, The Ohio State University. Accessed February 22, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1084986339.

MLA Handbook (7^th Edition):

Otto, Michael. “Symplectic convexity theorems and applications to the structure theory of semisimple Lie groups.” 2004. Web. 22 Feb 2020.

Vancouver:

Otto M. Symplectic convexity theorems and applications to the structure theory of semisimple Lie groups. [Internet] [Doctoral dissertation]. The Ohio State University; 2004. [cited 2020 Feb 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1084986339.

Council of Science Editors:

Otto M. Symplectic convexity theorems and applications to the structure theory of semisimple Lie groups. [Doctoral Dissertation]. The Ohio State University; 2004. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1084986339

University of Manchester

20. Trybus, Adam. An axiom system for a spatial logic with convexity.

Degree: PhD, 2012, University of Manchester

URL: https://www.research.manchester.ac.uk/portal/en/theses/an-axiom-system-for-a-spatial-logic-with-convexity(cd19b55f-b4e5-4782-90f2-d3c0ad79891b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553496

► A spatial logic is any formal language with geometric interpretation. Research on region-based spatial logics, where variables are set to range over certain subsets of… (more)

Subjects/Keywords: 511.3; logic; mathematical logic; spatial logic; convexity; axiomatization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Trybus, A. (2012). An axiom system for a spatial logic with convexity. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/an-axiom-system-for-a-spatial-logic-with-convexity(cd19b55f-b4e5-4782-90f2-d3c0ad79891b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553496

Chicago Manual of Style (16^th Edition):

Trybus, Adam. “An axiom system for a spatial logic with convexity.” 2012. Doctoral Dissertation, University of Manchester. Accessed February 22, 2020. https://www.research.manchester.ac.uk/portal/en/theses/an-axiom-system-for-a-spatial-logic-with-convexity(cd19b55f-b4e5-4782-90f2-d3c0ad79891b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553496.

MLA Handbook (7^th Edition):

Trybus, Adam. “An axiom system for a spatial logic with convexity.” 2012. Web. 22 Feb 2020.

Vancouver:

Trybus A. An axiom system for a spatial logic with convexity. [Internet] [Doctoral dissertation]. University of Manchester; 2012. [cited 2020 Feb 22]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/an-axiom-system-for-a-spatial-logic-with-convexity(cd19b55f-b4e5-4782-90f2-d3c0ad79891b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553496.

Council of Science Editors:

Trybus A. An axiom system for a spatial logic with convexity. [Doctoral Dissertation]. University of Manchester; 2012. Available from: https://www.research.manchester.ac.uk/portal/en/theses/an-axiom-system-for-a-spatial-logic-with-convexity(cd19b55f-b4e5-4782-90f2-d3c0ad79891b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553496

University of Victoria

21. Anderson, Rachel Jean Selma. Graph Convexity and Vertex Orderings.

Degree: Department of Mathematics and Statistics, 2014, University of Victoria

URL: http://hdl.handle.net/1828/5289

► In discrete mathematics, a convex space is an ordered pair (V,M) where M is a family of subsets of a finite set V , such… (more)

Subjects/Keywords: discrete mathematics; graph theory; graph convexity; vertex orderings; vertex ordering algorithms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Anderson, R. J. S. (2014). Graph Convexity and Vertex Orderings. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5289

Chicago Manual of Style (16^th Edition):

Anderson, Rachel Jean Selma. “Graph Convexity and Vertex Orderings.” 2014. Masters Thesis, University of Victoria. Accessed February 22, 2020. http://hdl.handle.net/1828/5289.

MLA Handbook (7^th Edition):

Anderson, Rachel Jean Selma. “Graph Convexity and Vertex Orderings.” 2014. Web. 22 Feb 2020.

Vancouver:

Anderson RJS. Graph Convexity and Vertex Orderings. [Internet] [Masters thesis]. University of Victoria; 2014. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/1828/5289.

Council of Science Editors:

Anderson RJS. Graph Convexity and Vertex Orderings. [Masters Thesis]. University of Victoria; 2014. Available from: http://hdl.handle.net/1828/5289

University of Oxford

22. Schaich, Rainer Manuel. Robust model predictive control.

Degree: PhD, 2017, University of Oxford

URL: https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904

► This thesis deals with the topic of min-max formulations of robust model predictive control problems. The sets involved in guaranteeing robust feasibility of the min-max… (more)

Subjects/Keywords: Robust Control; Polytope Operation; Parametric Convexity; Set-Valued Map

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Schaich, R. M. (2017). Robust model predictive control. (Doctoral Dissertation). University of Oxford. Retrieved from https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904

Chicago Manual of Style (16^th Edition):

Schaich, Rainer Manuel. “Robust model predictive control.” 2017. Doctoral Dissertation, University of Oxford. Accessed February 22, 2020. https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904.

MLA Handbook (7^th Edition):

Schaich, Rainer Manuel. “Robust model predictive control.” 2017. Web. 22 Feb 2020.

Vancouver:

Schaich RM. Robust model predictive control. [Internet] [Doctoral dissertation]. University of Oxford; 2017. [cited 2020 Feb 22]. Available from: https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904.

Council of Science Editors:

Schaich RM. Robust model predictive control. [Doctoral Dissertation]. University of Oxford; 2017. Available from: https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904

Brigham Young University

23. Ricks, Russell M. Planar CAT(k) Subspaces.

Degree: MS, 2010, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3089&context=etd

► Let M_k² be the complete, simply connected, Riemannian 2-manifold of constant curvature k ± 0. Let E be a closed, simply connected subspace of M_k²… (more)

Subjects/Keywords: CAT(k) spaces; Jordan Curve Theorem; nonpositive curvature; convexity; Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ricks, R. M. (2010). Planar CAT(k) Subspaces. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3089&context=etd

Chicago Manual of Style (16^th Edition):

Ricks, Russell M. “Planar CAT(k) Subspaces.” 2010. Masters Thesis, Brigham Young University. Accessed February 22, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3089&context=etd.

MLA Handbook (7^th Edition):

Ricks, Russell M. “Planar CAT(k) Subspaces.” 2010. Web. 22 Feb 2020.

Vancouver:

Ricks RM. Planar CAT(k) Subspaces. [Internet] [Masters thesis]. Brigham Young University; 2010. [cited 2020 Feb 22]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3089&context=etd.

Council of Science Editors:

Ricks RM. Planar CAT(k) Subspaces. [Masters Thesis]. Brigham Young University; 2010. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3089&context=etd

University of Melbourne

24. KIRSZENBLAT, DAVID. The Steiner ratio conjecture for eight points.

Degree: 2014, University of Melbourne

URL: http://hdl.handle.net/11343/44115

► Given a set X of n points in the euclidean plane R2, a Steiner minimal tree is a shortest network interconnecting X. Note that a… (more)

Subjects/Keywords: Steiner tree; spanning tree; Steiner ratio; variational approach; convexity; rigidity.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

KIRSZENBLAT, D. (2014). The Steiner ratio conjecture for eight points. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/44115

Chicago Manual of Style (16^th Edition):

KIRSZENBLAT, DAVID. “The Steiner ratio conjecture for eight points.” 2014. Masters Thesis, University of Melbourne. Accessed February 22, 2020. http://hdl.handle.net/11343/44115.

MLA Handbook (7^th Edition):

KIRSZENBLAT, DAVID. “The Steiner ratio conjecture for eight points.” 2014. Web. 22 Feb 2020.

Vancouver:

KIRSZENBLAT D. The Steiner ratio conjecture for eight points. [Internet] [Masters thesis]. University of Melbourne; 2014. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/11343/44115.

Council of Science Editors:

KIRSZENBLAT D. The Steiner ratio conjecture for eight points. [Masters Thesis]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/44115

University of Oklahoma

25. Tokgoz, Emre -. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems.

Degree: PhD, 2012, University of Oklahoma

URL: http://hdl.handle.net/11244/319378

► In this dissertation, a new method for obtaining convexity and optimization results for functions with integer and real (i.e. mixed) variables is introduced and this… (more)

Subjects/Keywords: Mathematical optimization; Convexity spaces; Convex functions; Queuing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tokgoz, E. -. (2012). Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319378

Chicago Manual of Style (16^th Edition):

Tokgoz, Emre -. “Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems.” 2012. Doctoral Dissertation, University of Oklahoma. Accessed February 22, 2020. http://hdl.handle.net/11244/319378.

MLA Handbook (7^th Edition):

Tokgoz, Emre -. “Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems.” 2012. Web. 22 Feb 2020.

Vancouver:

Tokgoz E-. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems. [Internet] [Doctoral dissertation]. University of Oklahoma; 2012. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/11244/319378.

Council of Science Editors:

Tokgoz E-. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems. [Doctoral Dissertation]. University of Oklahoma; 2012. Available from: http://hdl.handle.net/11244/319378

University of Oklahoma

26. Tokgoz, Emre -. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems.

Degree: PhD, 2012, University of Oklahoma

URL: http://hdl.handle.net/11244/318427

► In this dissertation, a new method for obtaining convexity and optimization results for functions with integer and real (i.e. mixed) variables is introduced and this… (more)

Subjects/Keywords: Mathematical optimization; Convexity spaces; Convex functions; Queuing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tokgoz, E. -. (2012). Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/318427

Chicago Manual of Style (16^th Edition):

Tokgoz, Emre -. “Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems.” 2012. Doctoral Dissertation, University of Oklahoma. Accessed February 22, 2020. http://hdl.handle.net/11244/318427.

MLA Handbook (7^th Edition):

Tokgoz, Emre -. “Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems.” 2012. Web. 22 Feb 2020.

Vancouver:

Tokgoz E-. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems. [Internet] [Doctoral dissertation]. University of Oklahoma; 2012. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/11244/318427.

Council of Science Editors:

Tokgoz E-. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems. [Doctoral Dissertation]. University of Oklahoma; 2012. Available from: http://hdl.handle.net/11244/318427

University of Illinois – Chicago

27. McClellan, Cloie. Separable at Birth: Products of Full Relatively Quasi-Convex Subgroups.

Degree: 2019, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/23629

► Let G be a hyperbolic group such that all quasi-convex subgroups are separable. Minasyan proved that finite products of such subgroups are themselves separable using… (more)

Subjects/Keywords: separability; relative hyperbolicity; relative quasi-convexity; geometric group theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

McClellan, C. (2019). Separable at Birth: Products of Full Relatively Quasi-Convex Subgroups. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23629

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

McClellan, Cloie. “Separable at Birth: Products of Full Relatively Quasi-Convex Subgroups.” 2019. Thesis, University of Illinois – Chicago. Accessed February 22, 2020. http://hdl.handle.net/10027/23629.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

McClellan, Cloie. “Separable at Birth: Products of Full Relatively Quasi-Convex Subgroups.” 2019. Web. 22 Feb 2020.

Vancouver:

McClellan C. Separable at Birth: Products of Full Relatively Quasi-Convex Subgroups. [Internet] [Thesis]. University of Illinois – Chicago; 2019. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/10027/23629.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

McClellan C. Separable at Birth: Products of Full Relatively Quasi-Convex Subgroups. [Thesis]. University of Illinois – Chicago; 2019. Available from: http://hdl.handle.net/10027/23629

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Newcastle upon Tyne

28. Iqbal, Rafhat. Shape-preserving algorithms for curve and surface design.

Degree: PhD, 1998, University of Newcastle upon Tyne

URL: http://theses.ncl.ac.uk/jspui/handle/10443/2089 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245701

► This thesis investigates, develops and implements algorithms for shape- preserving curve and surface design that aim to reflect the shape characteristics of the underlying geometry… (more)

Subjects/Keywords: 620.0042029; Computer graphics; Convexity preserving

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Iqbal, R. (1998). Shape-preserving algorithms for curve and surface design. (Doctoral Dissertation). University of Newcastle upon Tyne. Retrieved from http://theses.ncl.ac.uk/jspui/handle/10443/2089 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245701

Chicago Manual of Style (16^th Edition):

Iqbal, Rafhat. “Shape-preserving algorithms for curve and surface design.” 1998. Doctoral Dissertation, University of Newcastle upon Tyne. Accessed February 22, 2020. http://theses.ncl.ac.uk/jspui/handle/10443/2089 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245701.

MLA Handbook (7^th Edition):

Iqbal, Rafhat. “Shape-preserving algorithms for curve and surface design.” 1998. Web. 22 Feb 2020.

Vancouver:

Iqbal R. Shape-preserving algorithms for curve and surface design. [Internet] [Doctoral dissertation]. University of Newcastle upon Tyne; 1998. [cited 2020 Feb 22]. Available from: http://theses.ncl.ac.uk/jspui/handle/10443/2089 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245701.

Council of Science Editors:

Iqbal R. Shape-preserving algorithms for curve and surface design. [Doctoral Dissertation]. University of Newcastle upon Tyne; 1998. Available from: http://theses.ncl.ac.uk/jspui/handle/10443/2089 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245701

Queens University

29. Weech, Seamas. The Facing-the-Viewer Bias in the Perception of Depth Ambiguous Human Figures .

Degree: Psychology, 2013, Queens University

URL: http://hdl.handle.net/1974/8157

► Orthographically-projected biological motion point-light displays generally contain no information about their in-depth orientation, yet observers consistently prefer the facing-the-viewer (FTV) interpretation (Vanrie, Dekeyser and Verfaillie,… (more)

Subjects/Keywords: Convexity bias; Facing-the-viewer bias; Visual perception; Biological motion

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Weech, S. (2013). The Facing-the-Viewer Bias in the Perception of Depth Ambiguous Human Figures . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/8157

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Weech, Seamas. “The Facing-the-Viewer Bias in the Perception of Depth Ambiguous Human Figures .” 2013. Thesis, Queens University. Accessed February 22, 2020. http://hdl.handle.net/1974/8157.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Weech, Seamas. “The Facing-the-Viewer Bias in the Perception of Depth Ambiguous Human Figures .” 2013. Web. 22 Feb 2020.

Vancouver:

Weech S. The Facing-the-Viewer Bias in the Perception of Depth Ambiguous Human Figures . [Internet] [Thesis]. Queens University; 2013. [cited 2020 Feb 22]. Available from: http://hdl.handle.net/1974/8157.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Weech S. The Facing-the-Viewer Bias in the Perception of Depth Ambiguous Human Figures . [Thesis]. Queens University; 2013. Available from: http://hdl.handle.net/1974/8157

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Western Ontario

30. Mallick, Mithun. Optimal Decentralized Coordination of Sources in Islanded and Grid-connected Microgrids.

Degree: 2019, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/6274

► Rising climate change concerns in recent years have instigated the emergence of sustainable sources to reduce dependence on high-emission, isolated bulk generation systems. The microgrid… (more)

Subjects/Keywords: Microgrids; Computational Modelling; Steady-state; Decentralized Optimization; Convexity; Power and Energy

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mallick, M. (2019). Optimal Decentralized Coordination of Sources in Islanded and Grid-connected Microgrids. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/6274

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mallick, Mithun. “Optimal Decentralized Coordination of Sources in Islanded and Grid-connected Microgrids.” 2019. Thesis, University of Western Ontario. Accessed February 22, 2020. https://ir.lib.uwo.ca/etd/6274.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mallick, Mithun. “Optimal Decentralized Coordination of Sources in Islanded and Grid-connected Microgrids.” 2019. Web. 22 Feb 2020.

Vancouver:

Mallick M. Optimal Decentralized Coordination of Sources in Islanded and Grid-connected Microgrids. [Internet] [Thesis]. University of Western Ontario; 2019. [cited 2020 Feb 22]. Available from: https://ir.lib.uwo.ca/etd/6274.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mallick M. Optimal Decentralized Coordination of Sources in Islanded and Grid-connected Microgrids. [Thesis]. University of Western Ontario; 2019. Available from: https://ir.lib.uwo.ca/etd/6274

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Open Access Theses and Dissertations