Дисертації з теми "Boundy"
Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Boundy.
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Boundy".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Nagar, Atulya Kumar. "Application of functional bounds to nonlinear boundary value problems." Thesis, University of York, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318245.
Повний текст джерела
2
Kelner, Jonathan 1980. "Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/30169.
Повний текст джерелаАнотація:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.Includes bibliographical references (leaves 37-39).
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [12] that one can find asymptotically optimal separators on these graphs if he is given both the graph and an embedding of it onto a low genus surface. Does there exist a simple, efficient algorithm to find these separators given only the graph and not the embedding? 2. In practice, spectral partitioning heuristics work extremely well on these graphs. Is there a theoretical reason why this should be the case? We resolve these two questions by showing that a simple spectral algorithm finds separators of cut ratio O(sqrt(g/n)) and vertex bisectors of size O(sqrt(gn)) in these graphs, both of which are optimal. As our main technical lemma, we prove an O(g/n) bound on the second smallest eigenvalue of the Laplacian of such graphs and show that this is tight, thereby resolving a conjecture of Spielman and Teng. While this lemma is essentially combinatorial in nature, its proof comes from continuous mathematics, drawing on the theory of circle packings and the geometry of compact Riemann surfaces.
by Jonathan Kelner.
S.M.
3
Yarahmadian, Shantia. "Point wise Green function bounds and long-time stability of large-amplitude noncharacteristic boundary layers." [Bloomington, Ind.] : Indiana University, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3337271.
Повний текст джерелаАнотація:
Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2008.Title from PDF t.p. (viewed on Jul 28, 2009). Source: Dissertation Abstracts International, Volume: 69-12, Section: B, page: 7553. Adviser: Kevin Zumbrun.
4
Medida, Shivaji. "Curvilinear Extension to the Giles Non-reflecting Boundary Conditions for Wall-bounded Flows." Connect to Online Resource-OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=toledo1185309100.
Повний текст джерелаАнотація:
Thesis (M.S.)--University of Toledo, 2007.Typescript. "Submitted as partial fulfillments of the requirements for the Master of Science Degree in Mechanical Engineering." "A thesis entitled"--at head of title. Bibliography: leaves 196-205.
5
Fresneda-Portillo, Carlos. "Boundary-domain integral equation systems for the Stokes system with variable viscosity and diffusion equation in inhomogeneous media." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/14521.
Повний текст джерелаАнотація:
The importance of the Stokes system stems from the fact that the Stokes system is the stationary linearised form of the Navier Stokes system [Te01, Chapter1]. This linearisation is allowed when neglecting the inertial terms at a low Reinolds numbers Re << 1. The Stokes system essentially models the behaviour of a non - turbulent viscous fluid. The mixed interior boundary value problem related to the compressible Stokes system is reduced to two different BDIES which are equivalent to the original boundary value problem. These boundary-domain integral equation systems (BDIES) can be expressed in terms of surface and volume parametrix-based potential type operators whose properties are also analysed in appropriate Sobolev spaces. The invertibility and Fredholm properties related to the matrix operators that de ne the BDIES are also presented. Furthermore, we also consider the mixed compressible Stokes system with variable viscosity in unbounded domains. An analysis of the similarities and differences with regards to the bounded domain case is presented. Furthermore, we outline the mapping properties of the surface and volume parametrix-based potentials in weighted Sobolev spaces. Equivalence and invertibility results still hold under certain decay conditions on the variable coeffi cient The last part of the thesis refers to the mixed boundary value problem for the stationary heat transfer partial di erential equation with variable coe cient. This BVP is reduced to a system of direct segregated parametrix-based Boundary-Domain Integral Equations (BDIEs). We use a parametrix different from the one employed by Chkadua, Mikhailov and Natroshvili in the paper [CMN09]. Mapping properties of the potential type integral operators appearing in these equations are presented in appropriate Sobolev spaces. We prove the equivalence between the original BVP and the corresponding BDIE system. The invertibility and Fredholm properties of the boundary-domain integral operators are also analysed in both bounded and unbounded domains.
6
Phạm, Phú Tinh [Verfasser]. "Upper bound limit and shakedown analysis of elastic-plastic bounded linearly kinematic hardening structures / Phu Tinh Pham." Aachen : Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2011. http://d-nb.info/1018189491/34.
Повний текст джерела
7
Azarskov, V., L. Zhiteckii, and K. Solovchuk. "Robust adaptive stabilization of multivariable static systems with unknown square gain matrices and bounded disturbances having unknown bounds." Thesis, Національний авіаційний університет, 2016. http://er.nau.edu.ua/handle/NAU/28626.
Повний текст джерелаАнотація:
This work deals with designing the adtipUvj robust control systems containing linear discrete-time multivariable static plants which have unknown and possibly singtdar square gain matrices in the presence of arbitrary bounded disturbances whose bounds are unknown. The asymptotical properties of these systems are established
8
Kramer, Eugene. "Nonhomogeneous Boundary Value Problems for the Korteweg-de Vries Equation on a Bounded Domain." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1258478397.
Повний текст джерела
9
Krietenstein, Thorben [Verfasser], and Elmar [Akademischer Betreuer] Schrohe. "Bounded H∞-calculus for a degenerate elliptic boundary value problem / Thorben Krietenstein ; Betreuer: Elmar Schrohe." Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2019. http://d-nb.info/1204458901/34.
Повний текст джерела
10
Dür, Mirjam. "A Class of Problems where Dual Bounds Beat Underestimation Bounds." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/1468/1/document.pdf.
Повний текст джерелаАнотація:
We investigate the problem of minimizing a nonconvex function with respect to convex constraints, and we study different techniques to compute a lower bound on the optimal value: The method of using convex envelope functions on one hand, and the method of exploiting nonconvex duality on the other hand. We investigate which technique gives the better bound and develop conditions under which the dual bound is strictly better than the convex envelope bound. As a byproduct, we derive some interesting results on nonconvex duality. (author's abstract)Series: Forschungsberichte / Institut für Statistik
11
Martin, Alexander. "Loosely Bound." VCU Scholars Compass, 2016. http://scholarscompass.vcu.edu/etd/4251.
Повний текст джерелаАнотація:
I take a poetic approach to graphic design practice. It is a subjectivist approach, which recognizes our human right to willful interpretation. Designers navigate form, culture, and history like poets through language. We are subjective, exploratory engines drawing formal inspiration from figural and analogical associations. Subjectivity in graphic design practice is complex, however. Subjectivity privileges the interaction between object and individual. When we designers interpret the literal world with the poet’s omni-directional sensitivity, we intentionally and intuitively create objects that accrete inexhaustible, extra-literal value for their audience.
12
Bornhoft, Kellie. "Shifting LandscapesStatic Bounds." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1552574570601599.
Повний текст джерела
13
Cannon, Natalie M. "The Bound Chronicles." Scholarship @ Claremont, 2013. http://scholarship.claremont.edu/scripps_theses/216.
Повний текст джерелаАнотація:
The Bound Chronicles is a fictional story that chronicles the journey of three Irish monks who travel to Britain in 892 AD, the time of the Anglo-Saxons. There, they encounter King Alfred, Vikings, poisonings, but, more harrowing, must face their inner selves and the consequences of their choices.
14
Greco, Ornella. "Bounds on Hilbert Functions." Licentiate thesis, KTH, Matematik (Avd.), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-133942.
Повний текст джерелаАнотація:
This thesis is constituted of two articles, both related to Hilbert functions and h-vectors. In the first paper, we deal with h-vectorsof reduced zero-dimensional schemes in the projective plane, and, in particular, with the problem of finding the possible h-vectors for the union of two sets of points of given h-vectors. In the second paper, we generalize the Green’s Hyperplane Restriction Theorem to the case of modules over the polynomial ring.QC 20131114
15
Alexiou, Angeliki. "Bounds in array processing." Thesis, Imperial College London, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.249378.
Повний текст джерела
16
Shipley, Gary. "Bounds of the self." Thesis, University of Nottingham, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.247290.
Повний текст джерела
17
Meddour, Cherif. "Bounds for p-functions." Thesis, Aberystwyth University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.681494.
Повний текст джерела
18
Veloudis, Ioannis. "A study of subgrid scale modelling and inflow boundary conditions for large eddy simulation of wall-bounded flows." Thesis, Loughborough University, 2006. https://dspace.lboro.ac.uk/2134/7966.
Повний текст джерелаАнотація:
The complicated turbulence structures in wall-bounded flows require accurate subgrid scale, SGS, modelling and realistic inlet boundary conditions for Large Eddy Simulation, LES. The present study focused on the investigation and development of transport equation SGS models and on the development of inlet conditions generation algorithms specialised for LES of wall-bounded flows. The investigation of SGS models has been carried out in two stages. In the first stage, models based on resolved scales and models based on subgrid scales were tested on a series of channel flow cases. Among the second group of models, there was a new SGS model whose development was based on the concept of dissipation calculated from the energy spectrum. The results indicated the superiority of the models based on subgrid scales, with the new model providing the most accurate flow field in general. (Continues...).
19
Abdelall, Fahd Fathi. "Experimental and numerical studies of the Rayleigh-Taylor instability for bounded liquid films with injection through the boundary." Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-04072004-102937/unrestricted/abdelall%5Ffahd%5Ff%5F200405%5Fphd.pdf.
Повний текст джерела
20
Ferro, Marco. "Experimental study on turbulent boundary-layer flows with wall transpiration." Doctoral thesis, KTH, Mekanik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-217125.
Повний текст джерелаАнотація:
Wall transpiration, in the form of wall-normal suction or blowing through a permeable wall, is a relatively simple and effective technique to control the behaviour of a boundary layer. For its potential applications for laminar-turbulent transition and separation delay (suction) or for turbulent drag reduction and thermal protection (blowing), wall transpiration has over the past decades been the topic of a significant amount of studies. However, as far as the turbulent regime is concerned, fundamental understanding of the phenomena occurring in the boundary layer in presence of wall transpiration is limited and considerable disagreements persist even on the description of basic quantities, such as the mean streamwise velocity, for the rather simplified case of flat-plate boundary-layer flows without pressure gradients. In order to provide new experimental data on suction and blowing boundary layers, an experimental apparatus was designed and brought into operation. The perforated region spans the whole 1.2 m of the test-section width and with its streamwise extent of 6.5 m is significantly longer than previous studies, allowing for a better investigation of the spatial development of the boundary layer. The quality of the experimental setup and measurement procedures was verified with extensive testing, including benchmarking against previous results on a canonical zero-pressure-gradient turbulent boundary layer (ZPG TBL) and on a laminar asymptotic suction boundary layer. The present experimental results on ZPG turbulent suction boundary layers show that it is possible to experimentally realize a turbulent asymptotic suction boundary layer (TASBL) where the boundary layer mean-velocity profile becomes independent of the streamwise location, so that the suction rate constitutes the only control parameter. TASBLs show a mean-velocity profile with a large logarithmic region and without the existence of a clear wake region. If outer scaling is adopted, using the free-stream velocity and the boundary layer thickness (δ99) as characteristic velocity and length scale respectively, the logarithmic region is described by a slope Ao=0.064 and an intercept Bo=0.994, independently from the suction rate (Γ). Relaminarization of an initially turbulent boundary layer is observed for Γ>3.70×10−3. Wall suction is responsible for a strong damping of the velocity fluctuations, with a decrease of the near-wall peak of the velocity-variance profile ranging from 50% to 65% when compared to a canonical ZPG TBL at comparable Reτ. This decrease in the turbulent activity appears to be explained by an increased stability of the near-wall streaks. Measurements on ZPG blowing boundary layers were conducted for blowing rates ranging between 0.1% and 0.37% of the free-stream velocity and cover the range of momentum thickness Reynolds number 10000<Reθ<36000. Wall-normal blowing strongly modifies the shape of the boundary-layer mean-velocity profile. As the blowing rate is increased, the clear logarithmic region characterizing the canonical ZPG TBLs gradually disappears. A good overlap among the mean velocity-defect profiles of the canonical ZPG TBLs and of the blowing boundary layers for all the Re number and blowing rates considered is obtained when normalization with the Zagarola-Smits velocity scale is adopted. Wall blowing enhances the intensity of the velocity fluctuations, especially in the outer region. At sufficiently high blowing rates and Reynolds number, the outer peak in the streamwise-velocity fluctuations surpasses in magnitude the near-wall peak, which eventually disappears.Genom att använda sig av genomströmmande ytor, med sugning eller blåsning, kan man relativt enkelt och effektivt påverka ett gränsskikts tillstånd. Genom sin potential att påverka olika strömningsfysikaliska fenomen så som att senarelägga både avlösning och omslaget från laminär till turbulent strömning (genom sugning) eller som att exempelvis minska luftmotståndet i turbulenta gränsskikt och ge kyleffekt (genom blåsning), så har ett otaligt antal studier genomförts på området de senaste decennierna. Trots detta så är den grundläggande förståelsen bristfällig för de strömningsfenomen som inträffar i turbulenta gränsskikt över genomströmmande ytor. Det råder stora meningsskiljaktigheter om de mest elementära strömningskvantiteterna, såsom medelhastigheten, när sugning och blåsning tillämpas även i det mest förenklade gränsskiktsfallet nämligen det som utvecklar sig över en plan platta utan tryckgradient. För att ta fram nya experimentella data på gränsskikt med sugning och blåsning genom ytan så har vi designat en ny experimentell uppställning samt tagit den i bruk.Den genomströmmande ytan spänner över hela bredden av vindtunnelns mätsträcka (1.2 m) och är 6.5 m lång i strömningsriktningen och är därmed betydligt längre än vad som använts i tidigare studier. Detta gör det möjligt att bättre utforska gränsskiktet som utvecklas över ytan i strömningsriktningen. Kvaliteten på den experimentella uppställningen och valda mätprocedurerna har verifierats genom omfattande tester, som även inkluderar benchmarking mot tidigare resultat på turbulenta gränsskikt utan tryckgradient eller blåsning/sugning och på laminära asymptotiska sugningsgränsskikt. De experimentella resultaten på turbulenta gränsskikt med sugning bekräftar för första gången att det är möjligt att experimentellt sätta upp ett turbulent asymptotiskt sugningsgränsskikt där gränsskiktets medelhastighetsprofil blir oberoende av strömningsriktningen och där sugningshastigheten utgör den enda kontrollparametern. Det turbulenta asymptotiska sugningsgränsskiktet visar sig ha en medelhastighetsprofil normalt mot ytan med en lång logaritmisk region och utan förekomsten av en yttre vakregion. Om man använder yttre skalning av medelhastigheten, med friströmshastigheten och gränsskiktstjockleken som karaktäristisk hastighet respektive längdskala, så kan det logaritmiska området beskrivas med en lutning på Ao=0.064 och ett korsande värde med y-axeln på Bo=0.994, som är oberoende av sugningshastigheten. Om sugningshasigheten normaliserad med friströmshastigheten överskrider värdet 3.70x10^-3 så återgår det ursprungligen turbulenta gränsskiktet till att vara laminärt. Sugningen genom väggen dämpar hastighetsfluktuationerna i gränsskiktet med upp till 50-60% vid direkt jämförelse av det inre toppvärdet i ett turbulent gränsskikt utan sugning och vid jämförbart Reynolds tal. Denna minskning av turbulent aktivitet verkar härstamma från en ökad stabilitet av hastighetsstråken närmast ytan. Mätningar på turbulenta gränsskikt med blåsning har genomförts för blåsningshastigheter mellan 0.1 och 0.37% av friströmshastigheten och täcker Reynoldstalområdet (10-36)x10^3, med Reynolds tal baserat på rörelsemängds-tjockleken. Vid blåsning genom ytan får man en stark modifiering av formen på hastighetesfördelningen genom gränsskiktet. När blåsningshastigheten ökar så kommer till slut den logaritmiska regionen av medelhastigheten, karaktäristisk för turbulent gränsskikt utan blåsning, att gradvis försvinna. God överens-stämmelse av medelhastighetsprofiler mellan turbulenta gränsskikt med och utan blåsning erhålls för alla Reynoldstal och blåsningshastigheter när profilerna normaliseras med Zagarola-Smits hastighetsskala. Blåsning vid väggen ökar intensiteten av hastighetsfluktuationerna, speciellt i den yttre regionen av gränsskiktet. Vid riktigt höga blåsningshastigheter och Reynoldstal så kommer den yttre toppen av hastighetsfluktuationer i gränsskiktet att överskrida den inre toppen, som i sig gradvis försvinner.
QC 20171101
21
Van, der Schyff Karlien. "Screen bound/skin bound : the politics of embodiment in the posthuman age." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/4139.
Повний текст джерелаАнотація:
Thesis (MA (English))--University of Stellenbosch, 2010.ENGLISH ABSTRACT: The end of the second millennium saw a sudden return to corporeality, especially within feminist scholarship, where embodiment and issues surrounding the body were, for the first time, made explicit. This study examines the corporeal body in relation to technology and the impact that newly emerging virtual technologies have on our understanding of the body, not only through examining representations of the technologically modified body, but also by exploring how contemporary cultural practices produce corporeal bodies that view themselves as somehow integrated with technology. It focuses on the material artefacts of contemporary culture in relation to explicitly virtual technologies, both arguing for a return to corporeality and contesting the pervasive trope of disembodiment that characterises so-called “posthuman” age. This study thus takes one of the most popular metaphors for the relationship between the corporeal body and technology as its starting point, namely Donna Haraway’s cyborg figures. Following the publication of Haraway’s “A Manifesto for Cyborgs” (1985), the female cyborg became an icon of emancipation for many feminist scholars, who utilised Haraway’s cyborg discourse as a means of discussing the cultural practices that both construct and limit female gendered identity. Through closely examining the metaphor of Haraway’s cyborg figures in relation to cultural representations of female cyborg bodies, this study argues that, ultimately, the metaphor of the cyborg is inherently neither challenging nor liberating. It then examines the failure of the cyborg as an icon of postgenderedness in terms of its negation of the corporeal, as cyborg figures paradoxically only strengthen the same Cartesian dualism Haraway’s cyborg discourse attempts to deconstruct. It explores representations of three female cyborg figures found in contemporary popular culture to illustrate how the cyborg body’s negation of the corporeal only results in the reiteration of conventional gendered stereotypes, rather than liberation from oppressive gendered practices. Finally, this study examines the crucial interplay between the corporeal and the technological, not only when speaking of more imaginary cyborg configurations and tropes, but also when speaking of the physical reality of lived bodies and embodied experiences. By examining the increasingly embodied nature of cyberspace, this study explores possible alternatives to the figure of the hypersexualised and disembodied cyborg, through investigating new figurations with which to describe the embodied postmodern subject and his/her dependence on technology. Since the central task for a feminist ethics of embodiment would be grounded in the project of representing the female body, in such a way that it constructs autonomous women’s representations without falling prey to patriarchal, stereotypical or estranging images of women’s bodies, this study concludes with more useful methods of representing the corporeal body in relation to virtual technology through an appeal to an ethics of embodiment.
AFRIKAANSE OPSOMMING: Die einde van die tweede millennium het ‘n skielike belangstelling in beliggaamdheid ontlok, veral binne feministiese vakgeleerdheid, waar beliggaamdheid en kwessies rondom die ligaam vir die eerste keer eksplisiet gestel is. Hierdie studie ondersoek die stoflike liggaam in verhouding tot tegnologie en die invloed wat nuwe, virtuele tegnologiëe op ons begrip van die liggaam het, nie slegs deur voorstellings van die tegnologies-gemodifieërde ligaam te ondersoek nie, maar deur ook te kyk na hoe kontemporêre kulturele praktyke beliggaamde subjekte produseer wat huself op een of ander wyse as geïntegreerd met tegnologie sien. Die studie fokus op die materiële artefakte van kontemporêre kultuur in verhouding tot eksplisiet virtuele tegnologiëe. Dit bevorder ‘n terugkeer tot beliggaamdheid, terwyl dit teen die sogenaamde “postmenslike” era se mees kenmerkende troop van ontliggaamdheid argumenteer. Die studie begin dus deur een van die mees populêre metafore vir die verhouding tussen die liggaamlike en die tegnologiese te ondersoek, naamlik Donna Haraway se siborgfigure. Sedert die publikasie van Haraway se “A Manifesto for Cyborgs” (1985), het verskeie feministiese vakgeleerdes die vroulike siborg-figuur beide as ’n ikoon vir emansipasie beskou en gebruik om die kulturele praktyke wat vroulike geslagsidentiteit gelyktydig konstrueer én beperk te bespreek. Deur Haraway se siborg-figure met kulturele voorstellings van vroulike siborg-liggame te vergelyk, kom hierdie studie tot die gevolgtrekking dat die metafoor van die siborg inherent nóg uitdaagend nóg bevrydend is. Gevolglik ondersoek die studie die onbevoegdheid van die siborg-figuur as ‘n ikoon vir postgeslagtigheid in terme van die siborg-liggaam se negering van beliggaamdheid, aangesien siborg-figure op ‘n paradoksale wyse die selfde Cartesiaanse dualisme versterk wat Haraway se siborg-diskoers wou dekonstrueer. Dit ondersoek voorstellings van drie vroulike siborg-figure in kontemporêre populêre kultuur om te illustreer hoe die siborgliggaam se negering van beliggaamdheid slegs konvensionele geslagstereotipes versterk, eerder as om ons van beperkende, patriargale geslagspraktyke te bevry. Ten slotte ondersoek hierdie studie die deurslaggewende tussenspel tussen die ligaamlike en die tegnologiese, nie slegs in terme van meer denkbeeldige siborg tropes nie, maar ook in terme van die fisiese reailiteit van konkrete, beliggaamde lewenservaringe. Deur die toenemend beliggaamde kwaliteit van kiberruimtes te ondersoek, stel hierdie studie moontlike alternatiewe maniere voor om die postmoderne subjek en sy/haar afhanklikheid van tegnologie te beskryf, eerder as om op ontliggaamde en hipergeseksualiseerde siborg-figure staat te maak. Aangesien ‘n feministiese beliggaamde etiek gegrond is in ‘n projek om die vroulike liggaam op só ‘n wyse voor te stel dat patriargale, stereotipiese of vervreemdbare beelde van die vroulike liggaam vermy word, eindig hierdie studie met meer nuttige metodes om die stoflike liggaam in verhouding tot virtuele tegnologie voor te stel deur ‘n beroep tot ‘n meer beliggaamde etiek te maak.
22
Carlson, Debbie Lee. "BOUND/(baˇng)." Thesis, California State University, Long Beach, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=1569584.
Повний текст джерелаАнотація:
Our life is affected by our choices, once made we are bound by them. The materials that I use in my exhibition speak to my ideas about community and harmony. By placing familiar everyday objects such as discarded chairs and boat sails in an art installation, I am attempting to challenge social norms that shape one's destiny by exploring broader possibilities. The physical tensions in the work are created through tying, binding, pulling, stitching, and assembling to manifest the state of co-dependence and interconnectivities between the objects and materials. I approach my practice as a vehicle to express something about our human experience, and by transforming everyday materials and found objects into new forms and structures, I wish to connect art and ephemeral everyday experience and forge new meanings.
23
Kadura, Karen. "Homeward Bound: Short Stories." Thesis, University of North Texas, 2013. https://digital.library.unt.edu/ark:/67531/metadc271837/.
Повний текст джерелаАнотація:
This collection contains a preface that discusses the role of landscape and place as they are used in fiction, particularly when they are colored by the writer's own memories of home. The preface is followed by four original short stories, three of which relate to a fictional small town in Texas. "Under the Surface" involves two young boys who begin to relate thoughts of the dead body they find to their own absentee mother. "Tommy" explores a young man's memories of his recently deceased friend, as well as the gossip of a small town. "Stubborn" depicts a man's struggle after his wife has delivered an ultimatum. "Out of the Valley" is about a father and daughter questioning what it means to be normal.
24
Conlon, D. "Upper bounds for Ramsey numbers." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.597892.
Повний текст джерелаАнотація:
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the edges of the complete graph on n vertices, there is guaranteed to exist a monochromatic copy of G. In this thesis, we study the size of r(G) for a number of different types of graph G, proving several new upper bounds. Our main result is an improvement upon the upper bound for the most classical case of Ramsey’s theorem, finding the Ramsey number of the complete graph Kk. We also look at the closely related question of how many Kks a two-colouring of a large Kn must contain, obtaining several interesting new results. After a brief discussion of bipartite Ramsey numbers we move on to our other main results, dealing with Ramsey numbers of sparse graphs. We prove, in particular, that a bipartite graph G with n vertices and maximum degree Δ has Ramsey number at most 2cΔn. Because of a construction of Graham, Rödl and Ruciński, we know that this result is, up to the constant c, best possible. We show, moreover, how to extend the method to hypergraphs in order to obtain a new proof of the sparse hypergraph Ramsey theorem: if H is a hypergraph with n vertices and maximum degree Δ the Ramsey number of H is at most c(Δ)n for some constant c(Δ) depending only on Δ. Note that these results were obtained simultaneously and independently by Jacob Fox and Benny Sudakov.
25
Smith, Luke Alexander. "Refining Multivariate Value Set Bounds." Thesis, University of California, Irvine, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3709756.
Повний текст джерелаАнотація:
Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the polynomial, but more recent results make use of the powers of all monomials.
In this paper, we explore the geometric properties of the Newton polytope and show how they allow for tighter upper bounds on the cardinality of the multivariate value set. We then explore a method which allows for even stronger upper bounds, regardless of whether one uses the multivariate degree or the Newton polytope to bound the value set. Effectively, this provides an alternate proof of Kosters' degree bound, an improved Newton polytope-based bound, and an improvement of a degree matrix-based result given by Zan and Cao.
26
Dzindzalieta, Dainius. "Tight Bernoulli tail probability bounds." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2014~D_20140512_103743-38560.
Повний текст джерелаАнотація:
The purpose of the dissertation is to prove universal tight bounds for deviation from the mean probability inequalities for functions of random variables. Universal bounds shows that they are uniform with respect to some class of distributions and quantity of variables and other parameters. The bounds are called tight, if we can construct a sequence of random variables, such that the upper bounds are achieved. Such inequalities are useful for example in insurance mathematics, for constructing effective algorithms. We extend the results for Lipschitz functions on general probability metric spaces.Disertacijos darbo tikslas – įrodyti universalias tiksliąsias nelygybes atsitiktinių dydžių funkcijų nukrypimo nuo vidurkio tikimybėms. Universalios nelygybės pažymi, kad jos yra tolygios pagal tam tikras bendras skirstinių klases ir pagal atsitiktinių dydžių kiekį, kartais ir pagal kitus parametrus. Nelygybės vadinamos tiksliosiomis, jeigu pavyksta sukonstruoti atsitiktinių dydžių seką, kuriai nelygybės virsta lygybėmis. Tokios nelygybės labai naudingos, pavyzdžiui, draudimo matematikoje, konstruojant efektyvius algoritmus. Disertaciją sudaro šeši skyriai. Pirmasis skyrius yra įvadas, kuriame neformaliai pristatomas disertacijoje tiriamas objektas, pateikiamas bendras darbo aprašymas ir motyvacija. Detalesnė kitų autorių rezultatų apžvalga pateikiama atskirai kiekviename skyriuje. Antrasis skyrius skirtas atvejui, kai atsitiktiniai dydžiai yra aprėžti ir simetriniai. Trečiajame skyriuje įrodomos nelygybės atsitiktiniams dydžiams, tenkinantiems dispersijos aprėžtumo sąlygą. Ketvirtajame skyriuje nagrinėjamos sąlyginai aprėžtų atsitiktinių dydžių sumos. Penktajame skyriuje tiriamos atsitiktinių dydžių sekos, sudarančios martingalą arba supermartingalą, ir joms gaunamos universaliosios tikimybinės nelygybės ir sukonstruojama nehomogeninė Markovo grandinė, kuri yra martingalas, ir kuriai minėtos nelygybės virsta lygybėmis. Šeštajame skyriuje rezultatai yra apibendrinami atsitiktinių dydžių sekos Lipšico funkcijoms.
27
LABER, EDUARDO SANY. "PREFIX CODES: ALGORITHMS AND BOUNDS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1999. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13809@1.
Повний текст джерелаАнотація:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOOs códigos de prefixo têm importância fundamental na comprenssão e transmissão de dados. Estes códigos também apresentam relações com problemas de busca. Neste tese, apresentamos novos resultados estruturais e algorítimos sobre a classe dos códigos de prefixo. Explicamos teoricamente as boas taxas de compressão observadas para alguns métodos utilizados na prática. Propomos também algoritmos eficientes para construção de códigos de prefixo ótimos e variantes. Os principais resultados aqui descritos são os seguintes: - um novo algoritmo paralelo para construção de códigos de prefixos ótimos: - uma cota superior para a perda de compressão introduzida pela restrição de comprimento nos códigos de prefixo: - uma cota superior para a perda de compressão introduzida pela restrição de comprimento nos códigos de prefixo alfabéticos: - um algoritmo aproximativo e linear para construção de códigos de prefixo com restrição de comprimento: - um algoritmo aproximativo com complexidade 0(n log n) para construção de códigos de prefixo alfabéticos com restrição de comprimento: - uma nova versão de algoritmo WARM-UP com complexidade fortemente polinomial: - um algoritmo linear para reconhecer códigos de prefixo ótimos com restrição de comprimento: - uma prova afirmativa da conjectura de Vitter sobre o desempenho dos códigos de Huffmann dinâmicos construídos pelo algoritmo FGK (Faller, Gallanger e Knuth)
The prefix codes play an important role in data compression and data communication. These codes also present relation with search problems. In this thesis, we present new structural and algorithmic results concerning the prefix code class. We theoretically explain results related to the high compression rates of some methods that have been used for pratical purposes. We also propose efficient algorthims for constructing optimal prefix codes and some variants. The major results are listed below: -a new parallel algorithm for constructing optimal prefix codes: -a sharp upper bound for the compression loss introduced due usage of length restricted prefix codes: -an upper bound for the compression loss introduced due the usage of length restricted alphabetic prefix codes: -an 0(n log n) time approximative algorithm for constructing lenght restricted prefix code: -a 0(n log n) time approximative algorithm for constructing lenght restricted alphabetic prefix code: -a strongly polinomial version for the WARM-UP algorithm: -a linear time algorithm for recognizing optimal length restricted prefix codes: -a proof for Vitter´s conjecture about the perfomance of the Dynamic Huffman Codes constructed by FGK (Faller, Gallager and Knuth) algorithm.
28
MENDES, CARLOS RAONI DE ALENCAR. "COVERING CODES: BOUNDS AND HEURISTICS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=15365@1.
Повний текст джерелаАнотація:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIORCompreensão de dados, codificação digital da fala, telecomunicações via celular, correção de erros de transmissão, são algumas das aplicações práticas do estudo dos códigos de cobertura, um importante ramo da área da matemática denominada teoria dos códigos. Neste trabalho são abordados dois problemas de códigos de cobertura: o problema clássico de códigos de cobertura e o recente problema denominado de códigos curtos de cobertura. Apresenta-se uma aplicação da metaeurística Busca Tabu Reativa, uma importante variação da Busca Tabu clássica, para os problemas citados. Além disto, apresenta-se uma nova técnica heurística para resolução de problemas de otimização combinatória denominada Heurística de Melhoria via Geração de Colunas (HMGC), juntamente com uma aplicação da mesma aos problemas em questão. A HMGC combina a geração atrasada de colunas, técnica usada na resolução de problemas com um grande número de variáveis de decisão (colunas), e heurísticas de busca local. É feita uma comparação dos resultados obtidos pela Busca Tabu Reativa, a Busca Tabu sem o mecanismo de reação e a HMGC, de forma a avaliar a qualidade das heurísticas apresentadas.
Data compression, speech coding, móbile telecommunications and error-corretion are some of the practical apllications of the covering codes study, an important field of coding theory. This work addresses two problems of covering codes: the classic code covering problem and the recent short code covering problem. It presents an application of Reactive Tabu Search (RTS) metaheuristic for the problems cited, the RTS is an important variation of the classic Tabu Search. Moreover, it presents a new heuristic technique for solving combinatorial optimization problems named Column Generation Improbement Heuristic (CGIH). It also presents an application of CGIH for the covering codes problems. The CGIH combines the delayed column generation, technique used to solve problems with a large number of decision variables (columns), and local search heuristics. A comparison of results obtained by the Reactive Tabu Search, the Tabu Search without the reaction mechanism and the CGIH is also presented in order to assess the effectivenss of the presented heuristics.
29
Martin, Adrian. "Density bounds and tangent measures." Thesis, University of Sussex, 2013. http://sro.sussex.ac.uk/id/eprint/45279/.
Повний текст джерелаАнотація:
A major theme in geometric measure theory is establishing global properties, such as rectifiability, of sets or measures from local ones, such as densities or tangent measures. In establishing sufficient conditions for rectifiability it is useful to know what local properties are possible in a given setting, and this is the theme of this thesis. It is known, for 1-dimensional subsets of the plane with positive lower density, that the tangent measures being concentrated on a line is sufficient to imply rectifiability. It is shown here that this cannot be relaxed too much by demonstrating the existence of a 1-dimensional subset of the plane with positive lower density whose tangent measures are concentrated on the union of two halflines, and yet the set is unrectiable. A class of metrics are also defined on R, which are functions of the Euclidean metric, to give spaces of dimension s (s > 1), where the lower density is strictly greater than 21-s, and a method for gaining an explicit lower bound for a given dimension is developed. The results are related to the generalised Besicovitch 1/2 conjecture. Set functions are defined that measure how easily the subsets of a set can be covered by balls (of any radius) with centres in the subset. These set functions are studied and used to give lower bounds on the upper density of subsets of a normed space, in particular Euclidean spaces. Further attention is paid to subsets of R, where more explicit bounds are given.
30
Fan, Rui 1977. "Lower bounds in distributed computing." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/43030.
Повний текст джерелаАнотація:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.Includes bibliographical references (p. 167-170).
Distributed computing is the study of achieving cooperative behavior between independent computing processes with possibly conflicting goals. Distributed computing is ubiquitous in the Internet, wireless networks, multi-core and multi-processor computers, teams of mobile robots, etc. In this thesis, we study two fundamental distributed computing problems, clock synchronization and mutual exclusion. Our contributions are as follows. 1. We introduce the gradient clock synchronization (GCS) problem. As in traditional clock synchronization, a group of nodes in a bounded delay communication network try to synchronize their logical clocks, by reading their hardware clocks and exchanging messages. We say the distance between two nodes is the uncertainty in message delay between the nodes, and we say the clock skew between the nodes is their difference in logical clock values. GCS studies clock skew as a function of distance. We show that surprisingly, every clock synchronization algorithm exhibits some execution in which two nodes at distance one apart have Q( lo~gD clock skew, where D is the maximum distance between any pair of nodes. 2. We present an energy efficient and fault tolerant clock synchronization algorithm suitable for wireless networks. The algorithm synchronizes nodes to each other, as well as to real time. It satisfies a relaxed gradient property. That is, it guarantees that, using certain reasonable operating parameters, nearby nodes are well synchronized most of the time. 3. We study the mutual exclusion (mutex) problem, in which a set of processes in a shared memory system compete for exclusive access to a shared resource. We prove a tight Q(n log n) lower bound on the time for n processes to each access the resource once. .
(cont.) Our novel proof technique is based on separately lower bounding the amount of information needed for solving mutex, and upper bounding the amount of information any mutex algorithm can acquire in each step. We hope that our results offer fresh ways of looking at classical problems, and point to interesting new open problems
by Rui Fan.
Ph.D.
31
Sills, Graham. "Height bounds for n-coverings." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608879.
Повний текст джерела
32
Trejo, Abad Sofía. "Complex bounds for interval maps." Thesis, University of Warwick, 2013. http://wrap.warwick.ac.uk/62056/.
Повний текст джерелаАнотація:
In this thesis we give a proof of complex bounds for real analytic interval maps, for all possible combinatorics. We begin by constructing a sequence of intervals, known as the enhanced nest, that covers both non-renormalizable and infinitely renormalizable maps. This is a generalisation of the nest introduced in [KSvS1]. In Chapter 3, we prove the combinatorial and geometric properties of the enhanced nest, known as real bounds. The results from this chapter extend the ones in [KSvS1] to maps with odd critical points. In Chapter 4, we make use of Poincar´e disks based on intervals from the enhanced nest to construct quasi box-mappings associated to (real) first return maps. Key in this part of the proof are the pullbacks along monotone branches, that are controlled with the aid of fundamental domains, and the pullbacks between two consecutive levels from the enhanced nest of different combinatorial type, one non-terminating and one terminating. We use similar techniques to the ones developed in [LevS2] to obtain complex box-mappings from the quasi box-mappings that we constructed. Finally, we follow the arguments in [KSvS1] to prove complex bounds for the complex box-mappings we constructed.
33
De, Swardt N. C. "Bounds on baskets option prices." Master's thesis, University of Cape Town, 2005. http://hdl.handle.net/11427/4880.
Повний текст джерелаАнотація:
Includes bibliographical references (leaves 70-71).The celebrated Black-Scholes option pricing model is unable to produce closed-form solutions for arithmetic basket options. This problem stems from the lack of an analitical form for the distribution of a sum of lognormal random variables. lVlarket participants commonly price basket options by assuming the basket follows lognormal dynamics, although it is known that this approximation performs poorly in some cicumstances. The problem of finding an analytical approximation to the sum of lognormally distributed random variables has been widely studied. In this dissertation we seek to draw these studies together and apply them in an option pricing setting. We propose some new option pricing formulae based on these approximations. In order to examine the utility of these new formulae and compare them to commonly used market approximations we present rigorous analytical bounds for the price of arithmetic basket options using the theory of comonotonicity. In this we follow the ideas in Deelstra et al. [7]. Additionally we provide an interval of hedge parameters (the Greeks). We carry out a numerical sensitivity analysis and identify circumstances under which the market approximation misprices basket options.
34
Bannani, Faiz (Faiz Khalil) Carleton University Dissertation Mathematics. "Bounds on classical Ramsey numbers." Ottawa, 1988.
Знайти повний текст джерела
35
Naylor, Claire. "X-ray crystallographic studies of glucose 6-phosphate dehydrogenase." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360467.
Повний текст джерела
36
Goedhart, Eva Govinda. "Explicit bounds for linear difference equations /." Electronic thesis, 2005. http://etd.wfu.edu/theses/available/etd-05102005-222845/.
Повний текст джерела
37
Dinckal, Cigdem. "Bounds On The Anisotropic Elastic Constants." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/2/12609227/index.pdf.
Повний текст джерелаАнотація:
In this thesis, mechanical and elastic behaviour of anisotropic materials are inves-
tigated in order to understand the optimum mechanical behaviour of them in
selected directions. For an anisotropic material with known elastic constants, it
is possible to choose the best set of e¤ective elastic constants and e¤
ective eigen- values which determine the optimum mechanical and elastic properties of it and also represent the material in a speci.ed greater material symmetry. For this reason, bounds on the e¤
ective elastic constants which are the best set of elastic constants and e¤
ective eigenvalues of materials have been constructed symbollicaly for all anisotropic elastic symmetries by using Hill [4,13] approach. Anisotropic Hooke.s law and its Kelvin inspired formulation are described and generalized Hill inequalities are explained in detail. For di¤
erent types of sym- metries, materials were selected randomly and data of elastic constants for them were collected. These data have been used to calculate bounds on the e¤
ective elastic constants and e¤
ective eigenvalues. Finally, by examining numerical results of bounds given in tables, it is seen that the materials selected from the same symmetry type which have larger interval between the bounds, are more anisotropic, whereas some materials which have smaller interval between the bounds, are closer to isotropy.
38
Hernadvolgyi, Istvan T. "Automatically generated lower bounds for search." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/29112.
Повний текст джерелаАнотація:
Heuristic search algorithms (eg. A* and IDA*) with accurate lower bounds can solve impressively large problems optimally. Most lower bounds, such as the well known Manhattan Distance heuristic for the sliding-tile puzzles or the Assignment Problem lower bound for the Asymmetric Traveling Salesman problem, are the products of human ingenuity and insight. An alternative approach to obtain lower bounds is to precalculate shortest distances in an abstraction of the original search space which is derived automatically and store the bounds in pattern databases (look-up tables). This latter technique, based on the ideas of Culberson and Schaeffer, gained popularity when Korf for the first time solved random instances of Rubik's Cube using pattern databases. While researchers were pushing for solving larger and larger problems, the fact that there exist a very large number of abstract spaces that can provide lower bounds was overlooked. This thesis fills this gap in research by investigating the search performance of lower bounds derived from abstractions. We also use the results of this analysis to automatically derive high performance pattern databases.
First, we establish a very predictable trade-off between search speed and the number of entries in the pattern database. Second, we derive simple statistics that can predict the search performance of pattern databases without performing actual searches in the original state space. Using these results, we derive high performance pattern databases to search for macro-operators and to solve challenging instances of the well known Sequential Ordering Problem (SOP). Macro-search is a good candidate to showcase automatically derived lower bounds since there are many search spaces and each needs a different lower bound. The SOP is an NP-hard optimization problem. We were able to solve an unsolved instance from the TSPLIB. This required a greedy search in the space of abstractions to find a sufficiently accurate lower bound and several novel enhancements to the basic branch and bound algorithm.
39
Lee, Ciaran M. "Bounds on computation from physical principles." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:39451e29-3719-4cf4-a030-57c07e603380.
Повний текст джерелаАнотація:
The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This raises the general question of what broad relationships exist between physical principles and computation. The current thesis explores this question within the operationally-defined framework of generalised probabilistic theories. In particular, we investigate the limits on computational power imposed by simple physical principles. At present, the best known upper bound on the power of quantum computers is that BQP is contained in AWPP, where AWPP is a classical complexity class contained in PP. We define a circuit-based model of computation in the above mentioned operational framework and show that in theories where local measurements suffice for tomography, efficient computations are also contained in AWPP. Moreover, we explicitly construct a theory in which the class of efficiently solvable problems exactly equals AWPP, showing this containment to be tight. We also investigate how simple physical principles bound the power of computational paradigms which combine computation and communication in a non-trivial fashion, such as interactive proof systems. Additionally, we show how some of the essential components of computational algorithms arise from certain natural physical principles. We use these results to investigate the relationship between interference behaviour and computational power, demonstrating that non-trivial interference behaviour is a general resource for post-classical computation. We then investigate whether post-quantum interference is a resource for post-quantum computation. Sorkin has defined a hierarchy of possible post-quantum interference behaviours where, informally, the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. In quantum theory, at most pairs of paths can ever interact in a fundamental way. We consider how Grover's speed-up depends on the order of interference in a theory, and show that, surprisingly, the quadratic lower bound holds regardless of the order of interference.
40
Wu, Zili. "Error bounds for an inequality system." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ62533.pdf.
Повний текст джерела
41
Ou, Jihong, and Lawrence M. Wein. "Performance Bounds for Scheduling Queueing Networks." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5216.
Повний текст джерелаАнотація:
The goal of this paper is to assess the improvement in performance that might' be achieved by optimally scheduling a multiclass open queueing network. A stochastic process is defined whose steady-state mean value is less than or equal to the mean number of customers in a queueing network under any arbitrary scheduling policy. Thus, this process offers a lower bound on performance when the objective of the queueing network scheduling problem is to minimize the mean number of customers in the network. Since this bound is easily obtained from a computer simulation model of a queueing network, its main use is to aid job-shop schedulers in determining how much further improvement (relative to their proposed policies) might be achievable from scheduling. Through computational examples, we identify some factors that affect the tightness of the bound.
42
Kazi, Haseeb A. "Inequalities and bounds for elliptic integrals /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1212780461&sid=18&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Повний текст джерела
43
McDonald, Daniel J. "Generalization Error Bounds for Time Series." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/184.
Повний текст джерелаАнотація:
In this thesis, I derive generalization error bounds — bounds on the expected inaccuracy of the predictions — for time series forecasting models. These bounds allow forecasters to select among competing models, and to declare that, with high probability, their chosen model will perform well — without making strong assumptions about the data generating process or appealing to asymptotic theory. Expanding upon results from statistical learning theory, I demonstrate how these techniques can help time series forecasters to choose models which behave well under uncertainty. I also show how to estimate the β-mixing coefficients for dependent data so that my results can be used empirically. I use the bound explicitly to evaluate different predictive models for the volatility of IBM stock and for a standard set of macroeconomic variables. Taken together my results show how to control the generalization error of time series models with fixed or growing memory.
44
Geyer, Alois, Michael Hanke, and Alex Weissensteiner. "No-Arbitrage Bounds for Financial Scenarios." Elsevier, 2014. http://dx.doi.org/10.1016/j.ejor.2014.01.027.
Повний текст джерелаАнотація:
We derive no-arbitrage bounds for expected excess returns to generate scenarios used in financial
applications. The bounds allow to distinguish three regions: one where arbitrage opportunities will
never exist, a second where arbitrage may be present, and a third, where arbitrage opportunities
will always exist. No-arbitrage bounds are derived in closed form for a given covariance matrix
using the least possible number of scenarios. Empirical examples illustrate the practical potential
of knowing these bounds. (authors' abstract)
45
Larsson, Erik. "Topological Lower Bounds in Complexity Theory." Thesis, KTH, Matematik (Avd.), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-161067.
Повний текст джерелаАнотація:
The first goal of this thesis is to present two different methods, originally developed by Björner, Lovász and Yao [4], for proving lower bounds on the worst-case complexity in the linear decision tree model, by applying them to the k-EQUAL PROBLEM. Both methods are based on the computation of topological properties of the intersection lattice of a subspace arrangement. The second goal is to use one of these methods (based on estimates of Betti numbers) to improve upon a lower bound, due to Linusson [12], on the linear decision tree complexity c′(n,k) of the k-of-EACH PROBLEM on n elements. We show that c′(n,k) ≥ n log₃(n/6k).
46
Brammer, Stephen John. "A bounds approach to industrial performance." Thesis, University of East Anglia, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.327416.
Повний текст джерела
47
Hart, Michael. "Degree bounds for graphs in surfaces." Thesis, University of Nottingham, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335630.
Повний текст джерела
48
Harris, Charles Milton. "Enumeration reducibility and polynomial time bounds." Thesis, University of Leeds, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426857.
Повний текст джерела
49
Wakefield, M. A. "Bounds on quantities of physical interest." Thesis, University of Reading, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272236.
Повний текст джерела
50
Collins, Julian M. "The Karlhede classification and derivative bounds." Thesis, University of Southampton, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292428.
Повний текст джерела