Spelling suggestions: "subject:"nonduality"" "subject:"uniduality""
231 |
Matroids on Complete Boolean AlgebrasHiggs, Denis Arthur 10 1900 (has links)
The approach to a theory of non-finitary matroids, as outlined by the author in [20], is here extended to the case in which the relevant closure operators are defined on arbitrary complete Boolean algebras, rather than on the power sets of sets. As a preliminary to this study, the theory of derivatives of operators on complete Boolean algebras is developed and the notion, having interest in its own right, of an analytic closure operator is introduced . The class of B-matroidal closure operators is singled out for especial attention and it is proved that this class is closed under Whitney duality. Also investigated is the class of those closure operators which are both matroidal and topological. / Thesis / Doctor of Philosophy (PhD)
|
232 |
Trapped in a Glass House: No Stones to ThrowShowalter, Claire Marie 26 April 2010 (has links)
No description available.
|
233 |
Electric-Magnetic Duality-Symmetric Effective Actions in Harmonic SuperspaceAhmadain, Amr 10 October 2014 (has links)
No description available.
|
234 |
Spanning k-Trees and Loop-Erased Random SurfacesParsons, Kyle 27 October 2017 (has links)
No description available.
|
235 |
ARTIFICIAL LIGHT + ARCHITECTURE: REINTERPRETATION OF ARCHITECTURE THROUGH PERCEPTIONKHODADAD, NAZANIN 02 July 2004 (has links)
No description available.
|
236 |
TOPICS IN SUPERSYMMETRIC GAUGE THEORIES AND THE GAUGE-GRAVITY DUALITYEDALATI AHMADSARAEI, MOHAMMAD 05 October 2007 (has links)
No description available.
|
237 |
Sparse Signal Reconstruction Modeling for MEG Source Localization Using Non-convex RegularizersSamarasinghe, Kasun M. 19 October 2015 (has links)
No description available.
|
238 |
Complexity Bounds for Search ProblemsNicholas Joseph Recker (18390417) 18 April 2024 (has links)
<p dir="ltr">We analyze the query complexity of multiple search problems.</p><p dir="ltr">Firstly, we provide lower bounds on the complexity of "Local Search". In local search we are given a graph G and oracle access to a function f mapping the vertices to numbers, and seek a local minimum of f; i.e. a vertex v such that f(v) <= f(u) for all neighbors u of v. We provide separate lower bounds in terms of several graph parameters, including congestion, expansion, separation number, mixing time of a random walk, and spectral gap. To aid in showing these bounds, we design and use an improved relational adversary method for classical algorithms, building on the prior work of Scott Aaronson. We also obtain some quantum bounds using the traditional strong weighted adversary method.</p><p dir="ltr">Secondly, we show a multiplicative duality gap for Yao's minimax lemma by studying unordered search. We then go on to give tighter than asymptotic bounds for unordered and ordered search in rounds. Inspired by a connection through sorting with rank queries, we also provide tight asymptotic bounds for proportional cake cutting in rounds.</p>
|
239 |
Intermediary of Opposites/Turkish Embassy at Washington D.C.Targutay, Toygar 28 April 2000 (has links)
The objective of this thesis is not only to design a building or investigate an idea, but also to explore and learn to appreciate what is truly important and, hope- fully, to discover that part of truth which may lead us to a serenity in our souls.
My entire struggle is basically to try to achieve a comprehension of the order of nature. At some point in my life as an architect, if I have to build an artifact, that artifact should remind people of the everlasting merits of the invisible world and awaken the imagination of others in the pursuit of truth.
This book recounts the attempt to articulate an idea, one which I believe to be a part of the order of nature, into the design environment. / Master of Architecture
|
240 |
Robust Portfolio Optimization : Construction and analysis of a robust mixed-integer linear program for use in portfolio optimizationBjurström, Tobias, Gabrielsson Baas, Sebastian January 2024 (has links)
When making an investment, it is desirable to maximize the profits while minimizingthe risk. The theory of portfolio optimization is the mathematical approach to choosingwhat assets to invest in, and distributing the capital accordingly. Usually, the objectiveof the optimization is to maximize the return or minimize the risk. This report aims toconstruct and analyze a robust optimization model with MILP in order to determine ifthat model is more suitable for portfolio optimization than earlier models. This is doneby creating a robust MILP model, altering its parameters, and comparing the resultingportfolios with portfolios from older models. Our conclusion is that the constructed modelis appropriate to use for portfolio optimization. In particular, a robust approach is wellsuited for portfolio optimization, and the added MILP-part allows users of the model tospecialize the portfolio to their own preferences.
|
Page generated in 0.0365 seconds