Dissertations / Theses: 'Boundedne'

1

MIRAGLIO, PIETRO. "ESTIMATES AND RIGIDITY FOR STABLE SOLUTIONS TO SOME NONLINEAR ELLIPTIC PROBLEMS." Doctoral thesis, Università degli Studi di Milano, 2020. http://hdl.handle.net/2434/704717.

Full text

Abstract:

Questa tesi è incentrata sullo studio di equazioni differenziali alle derivate parziali di tipo ellittico. La prima parte della tesi riguarda la regolarità delle soluzioni stabili per un'equazione nonlineare con il p-Laplaciano, in un dominio limitato dello spazio Euclideo. La tecnica è basata sull'uso di disuguaglianze di tipo Hardy-Sobolev su ipersuperfici, del quale viene approfondito lo studio. Nella seconda parte viene preso in esame un problema nonlocale di tipo Dirichlet-Neumann. Studiamo la simmetria unidimensionale di alcune sottoclassi di soluzioni stabili, ottenendo risultati in dimensione n=2, 3. Inoltre, studiamo il comportamento asintotico dell'operatore associato a questo problema nonlocale, usando tecniche di Γ-convergenza.
This thesis deals with the study of elliptic PDEs. The first part of the thesis is focused on the regularity of stable solutions to a nonlinear equation involving the p-Laplacian, in a bounded domain of the Euclidean space. The technique is based on Hardy-Sobolev inequalities in hypersurfaces involving the mean curvature, which are also investigated in the thesis. The second part concerns, instead, a nonlocal problem of Dirichlet-to-Neumann type. We study the one-dimensional symmetry of some subclasses of stable solutions, obtaining new results in dimensions n=2, 3. In addition, we carry out the study of the asymptotic behaviour of the operator associated with this nonlocal problem, using Γ-convergence techniques.

APA, Harvard, Vancouver, ISO, and other styles

2

Cadotte, Patrick. "Robust bounded-input bounded-output stability of systems." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100331.

Full text

Abstract:

Two research problems involving the class of discrete-time signals bounded in magnitude are addressed in this thesis. The first problem concerns robust stability of systems with repeated, structured, linear time-varying, and induced-ℓinfinity-norm bounded perturbations. The second problem consists in the design of an ℓ₁-optimal controller that allows for flexible management of the tradeoff between the ability of a system to attenuate disturbance signals versus its expected worst peak-to-peak amplification. Original solutions to both problems are provided and their efficiency is assessed with examples and applications.

APA, Harvard, Vancouver, ISO, and other styles

3

Brown, Emilie Sayward. "Bounded Surface." VCU Scholars Compass, 2008. http://scholarscompass.vcu.edu/etd/1331.

Full text

Abstract:

The relationship between surface, perception, and structure has occupied my graduate studies. Locating, transforming, and transcending the surface requires play with perceptive abilities not only of vision, but of touch, hearing, and the other senses as well. How do the interactions of sense with the qualities of a surface determine our perception of the world? What role does the extension of the senses play in one's ability to perceive surface and structure? Using sense information gleaned from surfaces, the tectonics of our world are made visible. Might this relationship be played backwards as well? Composed structures produce surfaces upon which limina can be sensed.This written accompaniment to the thesis works is intended to continue the exploration of the surface/ sense/ structure relationship. With the visual work as a basis, each section consists of two parts. This structure is a tool for producing sense information for the viewer concerning the visual work.The first part serves as a bridge between the particular visual work and the second part. Consisting of a page or so of text, the first part of each section is also intended to set a tone or position the reader for the second part. The second part is more formal and speaks about the ideas behind the produced object, and for the most part could be applied to any works in this thesis. My desire is that the adjacency of the pieces in each section will create a friction of sorts an awareness of the surface between the two writings, and perhaps, between the writing and the objects.

APA, Harvard, Vancouver, ISO, and other styles

4

Buss, Samuel R. "Bounded arithmetic /." Napoli : Bibliopolis, 1986. http://catalogue.bnf.fr/ark:/12148/cb35611934b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Delivorias, Efstathios. "Chase Variants & Boundedness." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS039.

Full text

Abstract:

Le « chase » est une famille d'algorithmes conçus pour inférer des données en utilisant des connaissances ontologiques représentées par des règles existentielles, un sous-langage de la logique du premier ordre. Une littérature importante concerne son analyse, mais utilise des notations et des terminologies variées. On définit un cadre unificateur pour la spécification et l’étude des algorithmes du chase. On utilise ce cadre pour expliciter et comparer les propriétés des différentes variantes du chase. On se focalise particulièrement sur le problème de la "k-saturation-bornée" : k est-elle la taille maximum d'une chaîne d'applications de règles interdépendantes (où interdépendance signifie que le résultat d'une application d'une règle contribue au déclenchement de l'application suivante) ? En définissant des propriétés intermédiaires, on montre que le problème de la k-saturation-bornée est décidable pour de nombreuses variantes du chase. Parmi d’autres résultats, nous définissons deux nouvelles variantes du chase qui réduisent le nombre d’applications de règles redondantes sans augmenter significativement le temps de calcul
The chase is a family of algorithms designed to infer data with the use of ontological knowledge, which encoded in existential rules, a sub-language of first-order logic. A considerable literature has been devoted to its analysis, approaching it from a variety of presupposed terminological and notational background. We define a unifying framework for the specification and study of chase algorithms. We utilize it to compare and clarify the properties that discern the different variants of the chase. We particularly focus on studying whether there is a bound in the maximum length of a chain of interdependent rule applications (where interdependency means that the output of a rule application is contributing to triggering the next rule application). This is the problem ofboundedness, or k-boundedness, when the bound k is given. By investigating a number of intermediate properties, we find that k-boundedness is decidable for several chase variants. In addition to other secondary results, we define two new chase variants with the aim of reducing redundant rule applications without heavily increasing the computation cost

APA, Harvard, Vancouver, ISO, and other styles

6

Kaur, Surinder. "Culturally bounded rationality." Thesis, Henley Business School, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294508.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mullican, Cristina. "Bounded Powers Extend:." Thesis, Boston College, 2020. http://hdl.handle.net/2345/bc-ir:108748.

Full text

Abstract:

Thesis advisor: Ian Biringer
We are interested in proving the following statement: Given a 3-manifold M with boundary and a homeomorphism of the boundary f : ∂M → ∂M such that there is some power that extends to M, there is some k depending only on the genus g(∂M) and some l < k such that ƒᶩ extends to M. We will prove that the power needed to extend is not uniformly bounded with some examples, we will prove the statement is true if M is boundary incompressible and we will show that the general statement reduces to effectivising some technical results about pure homeomorphisms extending to compression bodies
Thesis (PhD) — Boston College, 2020
Submitted to: Boston College. Graduate School of Arts and Sciences
Discipline: Mathematics

APA, Harvard, Vancouver, ISO, and other styles

8

Herbert, Jodi. "Boundedness properties of bilinear pseudodifferential operators." Diss., Kansas State University, 2014. http://hdl.handle.net/2097/18707.

Full text

Abstract:

Doctor of Philosophy
Department of Mathematics
Virginia Naibo
Investigations of pseudodifferential operators are useful in a variety of applications. These include finding solutions or estimates of solutions to certain partial differential equations, studying boundedness properties of commutators and paraproducts, and obtaining fractional Leibniz rules. A pseudodifferential operator is given through integration involving the Fourier transform of the arguments and a function called a symbol. Pseudodifferential operators were first studied in the linear case and results were obtained to advance both the theory and applicability of these operators. More recently, significant progress has been made in the study of bilinear, and more generally multilinear, pseudodifferential operators. Of special interest are boundedness properties of bilinear pseudodifferential operators which have been examined in a variety of function spaces. Since determining factors in the boundedness of these operators are connected to properties of the corresponding symbols, significant effort has been directed at categorizing the symbols according to size and decay conditions as well as at establishing the associated symbolic calculus. One such category, the bilinear Hörmander classes, plays a vital role in results concerning the boundedness of bilinear pseudodifferential operators in the setting of Lebesgue spaces in particular. The new results in this work focus on the study of bilinear pseudodifferential operators with symbols in weighted Besov spaces of product type. Unlike the Hörmander classes, symbols in these Besov spaces are not required to possess in finitely many derivatives satisfying size or decay conditions. Even without this much smoothness, boundedness properties on Lebesgue spaces are obtained for bilinear operators with symbols in certain Besov spaces. Important tools in the proofs of these new results include the demonstration of appropriate estimates and the development of a symbolic calculus for some of the Besov spaces along with duality arguments. In addition to the new boundedness results and as a byproduct of studying operators with symbols in Besov spaces, it is possible to quantify the smoothness of the symbols, in terms of the conditions that define the Hörmander classes, that is sufficient for boundedness of the operators in the context of Lebesgue spaces.

APA, Harvard, Vancouver, ISO, and other styles

9

Alderaz, Fatma Hussien Shbani. "Boundedness and pseudocompactness in pointfree topology." University of Western Cape, 2019. http://hdl.handle.net/11394/7848.

Full text

Abstract:

>Magister Scientiae - MSc
This dissertation is a presentation to generalize boundedness and pseudocompactness in pointfree topology. We rst obtain and introduce a boundedness notion for elements of a frame. This is then further inspiration to introduce a de nition of bounded frame homomorphism whose domain may be any frame E, not just the frame of open sets of the reals.

APA, Harvard, Vancouver, ISO, and other styles

10

Wienhard, Anna Katharina. "Bounded cohomology and geometry." Bonn : Mathematisches Institut der Universität, 2004. http://catalog.hathitrust.org/api/volumes/oclc/62768224.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ameur, Foued ben Fredj. "Space-bounded learning algorithms /." Paderborn : Heinz Nixdorf Inst, 1996. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=007171235&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Strothmann, Willy-B. "Bounded degree spanning trees /." Paderborn : HNI, 1997. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=007959737&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Lind, Martin. "Functions of bounded variation." Thesis, Karlstad University, Division for Engineering Sciences, Physics and Mathematics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-209.

Full text

Abstract:

The paper begins with a short survey of monotone functions. The functions of bounded variation are introduced and some basic properties of these functions are given. Finally the jump function of a function of bounded variation is defined.

APA, Harvard, Vancouver, ISO, and other styles

14

Diao, Lili. "Nonlinear bounded controller design." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59374.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Wassermann, Renata. "Resource-bounded belief revision." Amsterdam : Amsterdam : Institute for Logic, Language and Computation, University of Amsterdam ; Universiteit van Amsterdam [Host], 2000. http://dare.uva.nl/document/83874.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Riis, SÃ¸ren. "Independence in bounded arithmetic." Thesis, University of Oxford, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Mavra, Boris. "Bounded geometry index theory." Thesis, University of Oxford, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318820.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Vergara, John Paul C. "Sorting by Bounded Permutations." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30401.

Full text

Abstract:

Let P be a predicate applicable to permutations. A permutation that satisfies P is called a generator. Given a permutation $pi$, MinSort_P is the problem of finding a shortest sequence of generators that, when composed with $pi$, yields the identity permutation. The length of this sequence is called the P distance of $pi$. Diam_P is the problem of finding the longest such distance for permutations of a given length. MinSort_P and Diam_P, for some choices of P, have applications in the study of genome rearrangements and in the design of interconnection networks. This dissertation considers generators that are swaps, reversals, or block-moves. Distance bounds on these generators are introduced and the corresponding problems are investigated. Reduction results, graph-theoretic models, exact and approximation algorithms, and heuristics for these problems are presented. Experimental results on the heuristics are also provided. When the bound is a function of the length of the permutation, there are several sorting problems such as sorting by block-moves and sorting by reversals whose bounded variants are at least as difficult as the corresponding unbounded problems. For some bounded problems, a strong relationship exists between finding optimal sorting sequences and correcting the relative order of individual pairs of elements. This fact is used in investigating MinSort_P and Diam_P for two particular predicates. A short block-move is a generator that moves an element at most two positions away from its original position. Sorting by short block-moves is solvable in polynomial time for two large classes of permutations: woven bitonic permutations and woven double-strip permutations. For general permutations, a polynomial-time (4/3)-approximation algorithm that computes short block-move distance is devised. The short block-move diameter for length-n permutations is determined. A short swap is a generator that swaps two elements that have at most one element between them. A polynomial-time 2-approximation algorithm for computing short swap distance is devised and a class of permutations where the algorithm computes the exact short swap distance is determined. Bounds for the short swap diameter for length-n permutations are determined.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Yuan. "Convergence and Boundedness of Probability-One Homotopies for Model Order Reduction." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30716.

Full text

Abstract:

The optimal model reduction problem is an inherently nonconvex problem and thus provides a nontrivial computational challenge. This study systematically examines the requirements of probability-one homotopy methods to guarantee global convergence. Homotopy algorithms for nonlinear systems of equations construct a continuous family of systems, and solve the given system by tracking the continuous curve of solutions to the family. The main emphasis is on guaranteeing transversality for several homotopy maps based upon the pseudogramian formulation of the optimal projection equations and variations based upon canonical forms. These results are essential to the probability-one homotopy approach by guaranteeing good numerical properties in the computational implementation of the homotopy algorithms.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

20

Wills, Jules A., and n/a. "Strategic planning in Commonwealth departments: beyond magaerialism: from bounded rationality to bounded uncertainty." University of Canberra. Administrative Studies, 1991. http://erl.canberra.edu.au./public/adt-AUC20060426.154713.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Chern, Shey-jey. "Estimates for the number of polynomials with bounded degree and bounded Mahler measure /." Digital version accessible at:, 2000. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Abe, Takeshi. "BOUNDEDNESS OF SEMISTABLE SHEAVES OF RANK FOUR." 京都大学 (Kyoto University), 2001. http://hdl.handle.net/2433/150404.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Molka, Daniel, Robert Schöne, Daniel Hackenberg, and Wolfgang E. Nagel. "Detecting Memory-Boundedness with Hardware Performance Counters." Association for Computing Machinery (ACM), 2017. https://tud.qucosa.de/id/qucosa%3A33807.

Full text

Abstract:

Modern processors incorporate several performance monitoring units, which can be used to count events that occur within different components of the processor. They provide access to information on hardware resource usage and can therefore be used to detect performance bottlenecks. Thus, many performance measurement tools are able to record them complementary to information about the application behavior. However, the exact meaning of the supported hardware events is often incomprehensible due to the system complexity and partially lacking or even inaccurate documentation. For most events it is also not documented whether a certain rate indicates a saturated resource usage. Therefore, it is usually diffcult to draw conclusions on the performance impact from the observed event rates. In this paper, we evaluate whether hardware performance counters can be used to measure the capacity utilization within the memory hierarchy and estimate the impact of memory accesses on the achieved performance. The presented approach is based on a small selection of micro-benchmarks that constantly stress individual components in the memory subsystem, ranging from caches to main memory. These workloads are used to identify hardware performance counters that provide good estimates for the utilization of individual components in the memory hierarchy. However, since access latencies can be interleaved with computing instructions, a high utilization of the memory hierarchy does not necessarily result in low performance. We therefore also investigate which stall counters provide good estimates for the number of cycles that are actually spent waiting for the memory hierarchy.

APA, Harvard, Vancouver, ISO, and other styles

24

Chis, Cristina. "Bounded sets in topological groups." Doctoral thesis, Universitat Jaume I, 2010. http://hdl.handle.net/10803/10502.

Full text

Abstract:

A boundedness structure (bornology) on a topological space is an ideal of subsets containing all singletons, that is, closed under taking subsets and unions of finitely many elements. In this paper we deal with the structure of the whole family of bounded subsets rather than the specific properties of them by means of certain functions that we define on a metrizable topological group. Our motivation is twofold: on the one hand, we obtain useful information about the structural features of certain remarkable classes of bounded systems, cofinality, local properties, etc. For example, we estimate the cofinality of these boundedness notions.
In the second part of the paper, we apply duality methods in order to obtain estimations of the size of a local base for an important class of groups. This translation, which has been widely exhibited in the Pontryagin-van Kampen duality theory of locally compact abelian groups, is often very relevant and has been extended by many authors to more general classes of topological groups. In this work we follow basically the pattern and terminology given by Vilenkin in 1998.

APA, Harvard, Vancouver, ISO, and other styles

25

Persson, Magnus. "Bounded Rationality and Exemplar Models." Doctoral thesis, Uppsala University, Department of Psychology, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-3572.

Full text

Abstract:

Bounded rationality is the study of how human cognition with limited capacity is adapted to handle the complex information structures in the environment. This thesis argues that in order to understand the bounded rationality of decision processes, it is necessary to develop decision theories that are computational process models based upon basic cognitive and perceptual mechanisms. The main goal of this thesis is to show that models of perceptual categorization based on the storage of exemplars and retrieval of similar exemplars whenever a new object is encountered (D. L. Medin & M. M. Schaffer, 1978), can be an important contribution to theories of decision making. Study I proposed, PROBEX (PROBabilities from Exemplars), a model for inferences from generic knowledge. It is a “lazy” algorithm that presumes no pre-computed abstractions. In a computer simulation it was found to be a powerful decision strategy, and it was possible to fit the model to human data in a psychologically plausible way. Study II was a theoretical investigation that found that PROBEX was very robust in conditions where the decision maker has very little information, and that it worked well even under the worst circumstances. Study III empirically tested if humans can learn to use exemplar based or one reason decision making strategies (G. Gigerenzer, P. Todd, & the ABC Research Group, 1999) where it is appropriate in a two-alternative choice task. Experiment 1 used cue structure and presentation format as independent variables, and participants easily used one reason strategies if the decision task presented the information as normal text. The participants were only able to use exemplars if they were presented as short strings of letters. Experiment 2 failed to accelerate learning of exemplar use during the decision phase, by prior exposure to exemplars in a similar task. In conclusion, this thesis supports that there are at least two modes of decision making, which are boundedly rational if they are used in the appropriate context. Exemplar strategies may, contrary to study II, only be used late in learning, and the conditions for learning need to be investigated further.

APA, Harvard, Vancouver, ISO, and other styles

26

Ho, Ngoc Duc. "Resource-Bounded Reasoning about Knowledge." Doctoral thesis, Universitätsbibliothek Leipzig, 2004. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-36935.

Full text

Abstract:

Der Begriff ``Agent'' hat sich als eine sehr nützliche Abstraktion erwiesen, um verschiedene Problembereiche auf eine intuitive und natürliche Art und Weise zu konzeptualisieren. Intelligente Agenten haben daher Anwendung gefunden in verschiedenen Teilbereichen der Informatik. Zur Modellierung werden intelligente Agenten meist als intentionale Systeme aufgefaßt und mit Hilfe von mentalistischen Begriffen wie Wissen, Glauben (oder Überzeugung), Wunsch, Pflicht, Intention usw. beschrieben. Unter diesen mentalen Begriffen gehören die epistemischen Begriffe (d.h., Wissen und Glauben) zu den wichtigsten und wurden auch am intensivsten untersucht. Zur Modellierung von Wissen und Glauben werden in der Regel modale epistemische Logiken verwendet. Solche Systeme sind aber nicht geeignet, um ressourcenbeschränkte Agenten zu beschreiben, weil sie zu starke Annahmen bezüglich der Rationalität von Agenten machen. Zum Beispiel wird angenommen, daß Agenten alle logischen Wahrheiten sowie alle Konsequenzen seines Wissens kennen. Dieses Problem ist bekannt als das Problem der logischen Allwissenheit (``logical omniscience problem''). Da alle Agenten grundsätzlich nur über begrenzte Ressourcen (wie z.B. Zeit, Information, Speicherplatz) verfügen, können sie nur eine begrenzte Menge von Informationen verarbeiten. Daher müssen alternative Modelle entwickelt werden, um Agenten realistisch modellieren zu können (siehe Kapitel 2). Daß modale epistemische Logik für die Formalisierung des ressourcenbeschränkten Schließens (``resource-bounded reasoning'') nicht geeignet ist, wird als ein offenes Problem der Agententheorien anerkannt. Es gibt bisher aber keine brauchbaren Alternativen zur Modallogik. Die meisten Ansätze zur Lösung des logischen Allwissenheitsproblems versuchen, Wissen und Glauben mit Hilfe schwacher Modallogiken zu beschreiben. Solche Versuche sind nicht befriedigend, da sie eine willkürliche Einschränkung der Rationalität der Agenten zur Folge haben (siehe Kapitel 3). Mein Ziel ist es, einen Rahmen für das ressourcenbeschränktes Schließen über Wissen und Glauben zu entwickeln. Damit soll eine solide Grundlage für Theorien intelligenter Agenten geschaffen werden. Als Nebenergebnis wird das logische Allwissenheitsproblem auf eine sehr intuitive Art und Weise gelöst: obwohl Agenten rational sind und alle logischen Schlußregeln anwenden können, sind sie nicht logisch allwissend, weil ihnen nicht genügend Ressourcen zu Verfügung stehen, um alle logischen Konsequenzen ihres Wissens zu ziehen. Im Kapitel 4 wird eine Reihe von Logiken vorgestellt, die den Begriff des expliziten Wissens formalisieren. Es wird eine Lösung des Problems der logischen Allwissenheit der epistemischen Logik vorgeschlagen, die die Rationalität der Agenten nicht willkürlich einschränkt. Der Grundgedanke dabei ist der folgende. Ein Agent kennt die logischen Konsequenzen seines Wissens nur dann, wenn er sie tatsächlich hergeleitet hat. Wenn ein Agent alle Prämissen einer gültigen Schlußregel kennt, kennt er nicht notwendigerweise die Konklusion: er kennt sie nur nach der Anwendung der Regel. Wenn er den Schluß nicht ziehen kann, z.B. weil er nicht die notwendigen Ressourcen dazu hat, wird sein Wissen nicht um diese herleitbare Information erweitert. Die Herleitung neuer Informationen wird als die Ausführung mentaler Handlungen aufgefaßt. Mit Hilfe einer Variante der dynamischen Logik können diese Handlungen beschrieben werden. Im Kapitel 5 werden Systeme für das ressourcenbeschränkte Schließen über Wissen und Glauben entwickelt, die auch quantitative Bedingungen über die Verfügbarkeit von Ressourcen modellieren können. Mit Hilfe dieser Logiken können Situationen beschrieben werden, wo Agenten innerhalb einer bestimmten Zeitspanne entscheiden müssen, welche Handlungen sie ausführen sollen. Der Ansatz besteht darin, epistemische Logik mit Komplexitätstheorie zu verbinden. Mit Hilfe einer Komplexitätsanalyse kann ein Agent feststellen, ob ein bestimmtes Problem innerhalb vorgegebener Zeit lösbar ist. Auf der Grundlage dieses Wissens kann er dann die für die Situation geeignete Entscheidung treffen. Damit ist es gelungen, eine direkte Verbindung zwischen dem Wissen eines Agenten und der Verfügbarkeit seiner Ressourcen herzustellen
One of the principal goals of agent theories is to describe realistic, implementable agents, that is, those which have actually been constructed or are at least in principle implementable. That goal cannot be reached if the inherent resource-boundedness of agents is not treated correctly. Since the modal approach to epistemic logic is not suited to formalize resource-bounded reasoning, the issue of resource-boundedness remains one of the main foundational problems of any agent theory that is developed on the basis of modal epistemic logic. My work is an attempt to provide theories of agency with a more adequate epistemic foundation. It aims at developing theories of mental concepts that make much more realistic assumptions about agents than other theories. The guiding principle of my theory is that the capacities attributed to agents must be empirically verifiable, that is, it must be possible to construct artificial agents which satisfy the specifications determined by the theory. As a consequence, the unrealistic assumption that agents have unlimited reasoning capacities must be rejected. To achieve the goal of describing resource-bounded agents accurately, the cost of reasoning must be taken seriously. In the thesis I have developed a framework for modeling the relationship between knowledge, reasoning, and the availability of resources. I have argued that the correct form of an axiom for epistemic logic should be: if an agent knows all premises of a valid inference rule and if he performs the right reasoning, then he will know the conclusion as well. Because reasoning requires resources, it cannot be safely assumed that the agent can compute his knowledge if he does not have enough resources to perform the required reasoning. I have demonstrated that on the basis of that idea, the problems of traditional approaches can be avoided and rich epistemic logics can be developed which can account adequately for our intuitions about knowledge

APA, Harvard, Vancouver, ISO, and other styles

27

Tugluk, Ozan. "Dynamics Of Wall Bounded Turbulence." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12605829/index.pdf.

Full text

Abstract:

Karhunen-Lo`{e}ve decomposition is a well established tool, in areas such as signal processing, data compression and low-dimensional modeling. In computational fluid mechanics (CFD) too, KL decomposition can be used to achieve reduced storage requirements, or construction of relatively low-dimensional models. These relatively low-dimensional models, can be used to investigate the dynamics of the flow field in a qualitative manner. Employment of these reduced models is beneficial, as the they can be studied with even stringent computing resources. In addition, these models enable the identification and investigation of interactions between flowlets of different nature (the flow field is decomposed into these flowlets). However, one should not forget that, the reduced models do not necessarily capture the entire dynamics of the original flow, especially in the case of turbulent flows. In the presented study, a KL basis is used to construct reduced models of Navier-Stokes equations in the case of wall-bounded turbulent flow, using Galerkin projection. The resulting nonlinear dynamical systems are then used to investigate the dynamics of transition to turbulence in plane Poiseuille flow in a qualitative fashion. The KL basis used, is extracted from a flow filed obtained from a direct numerical simulation of plane Poiseuille flow.

APA, Harvard, Vancouver, ISO, and other styles

28

Östling, Robert. "Bounded rationality and endogenous preferences." Doctoral thesis, Handelshögskolan i Stockholm, Samhällsekonomi (S), 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:hhs:diva-454.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Lind, Martin. "Functions of Generalized Bounded Variation." Doctoral thesis, Karlstads universitet, Institutionen för matematik och datavetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-26342.

Full text

Abstract:

This thesis is devoted to the study of different generalizations of the classical conception of a function of bounded variation. First, we study the functions of bounded p-variation introduced by Wiener in 1924. We obtain estimates of the total p-variation (1<p<∞) and other related functionals for a periodic function f in Lp([0,1]) in terms of its Lp-modulus of continuity ω(f;δ)p. These estimates are sharp for any rate of decay of ω(f;δ)p. Moreover, the constant coefficients in them depend on parameters in an optimal way. Inspired by these results, we consider the relationship between the Riesz type generalized variation vp,α(f) (1<p<∞, 0≤α≤1-1/p) and the modulus of p-continuity ω1-1/p(f;δ). These functionals generate scales of spaces that connect the space of functions of bounded p-variation and the Sobolev space Wp1. We prove sharp estimates of vp,α(f) in terms of ω1-1/p(f;δ). In the same direction, we study relations between moduli of p-continuity and q-continuity for 1<p<q<∞. We prove an inequality that estimates ω1-1/p(f;δ) in terms of ω1-1/q(f;δ). The inequality is sharp for any order of decay of ω1-1/q(f;δ). Next, we study another generalization of bounded variation: the so-called bounded Λ-variation, introduced by Waterman in 1972. We investigate relations between the space ΛBV of functions of bounded Λ-variation, and classes of functions defined via integral smoothness properties. In particular, we obtain the necessary and sufficient condition for the embedding of the class Lip(α;p) into ΛBV. This solves a problem of Wang (2009). We consider also functions of two variables. Applying our one-dimensional result, we obtain sharp estimates of the Hardy-Vitali type p-variation of a bivariate function in terms of its mixed modulus of continuity in Lp([0,1]2). Further, we investigate Fubini-type properties of the space Hp(2) of functions of bounded Hardy-Vitali p-variation. This leads us to consider the symmetric mixed norm space Vp[Vp]sym of functions of bounded iterated p-variation. For p>1, we prove that Hp(2) is not embedded into Vp[Vp]sym, and that Vp[Vp]sym is not embedded into Hp(2). In other words, Fubini-type properties completely fail in the class of functions of bounded Hardy-Vitali type p-variation for p>1.
Baksidestext The classical concept of the total variation of a function has been extended in several directions. Such extensions find many applications in different areas of mathematics. Consequently, the study of notions of generalized bounded variation forms an important direction in the field of mathematical analysis. This thesis is devoted to the investigation of various properties of functions of generalized bounded variation. In particular, we obtain the following results: sharp relations between spaces of generalized bounded variation and spaces of functions defined by integral smoothness conditions (e.g., Sobolev and Besov spaces); optimal properties of certain scales of function spaces of frac- tional smoothness generated by functionals of variational type; sharp embeddings within the scale of spaces of functions of bounded p-variation; results concerning bivariate functions of bounded p-variation, in particular sharp estimates of total variation in terms of the mixed Lp-modulus of continuity, and Fubini-type properties.

APA, Harvard, Vancouver, ISO, and other styles

30

Morris, Simon Edward. "Bounded derivations from uniform algebras." Thesis, University of Cambridge, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318438.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Seabright, Paul. "Bounded beliefs and Keynesian speculation." Thesis, University of Oxford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sequeira, Dilip. "Type inference with bounded quantification." Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/503.

Full text

Abstract:

In this thesis we study some of the problems which occur when type inference is used in a type system with subtyping. An underlying poset of atomic types is used as a basis for our subtyping systems. We argue that the class of Helly posets is of significant interest, as it includes lattices and trees, and is closed under type formation not only with structural constructors such as function space and list, but also records, tagged variants, Abadi-Cardelli object constructors, top and bottom. We develop a general theory relating consistency, solvability, and solution of sets of constraints between regular types built over Helly posets with these constructors, and introduce semantic notions of simplification and entailment for sets of constraints over Helly posets of base types. We extend Helly posets with inequalities of the form a <= tau, where tau is not necessarily atomic, and show how this enables us to deal with bounded quantification. Using bounded quantification we define a subtyping system which combines structural subtype polymorphism and predicative parametric polymorphism, and use this to extend with subtyping the type system of Laufer and Odersky for ML with type annotations. We define a complete algorithm which infers minimal types for our extension, using factorisations, solutions of subtyping problems analogous to principal unifiers for unification problems. We give some examples of typings computed by a prototype implementation.

APA, Harvard, Vancouver, ISO, and other styles

33

Heath, Matthew J. "Bounded derivations from Banach algebras." Thesis, University of Nottingham, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.519425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Jago, Mark. "Logics for resource-bounded agents." Thesis, University of Nottingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.437092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Silver, Alan Peter. "On polynomial time bounded reducibilities." Thesis, University of Leeds, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.303395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Vinokur, Leon. "Environmental policy and bounded rationality." Thesis, Queen Mary, University of London, 2010. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1708.

Full text

Abstract:

The Prospect Theory proposes to assess outcomes relative to a reference point (or benchmark). Although the literature recognises the relevance of dynamic benchmarks, most of the applications of Prospect Theory employ static reference points (or a status quo). This paper aims to develop a Prospect Theory framework for investment under uncertainty subject to a dynamic reference point, within the context of environmental policy making, where the distinction between a dynamic and a static frameworks is crucial. I evince that, in contrast to the static framework, in a dynamic framework the investor measures not only the absolute but also the relative risk premium (Sharpe ratio) of the investment opportunity, incorporating the risks and returns of a reference portfolio. I propose that there exists a relation between static and dynamic frameworks. Using the dynamic framework, I argue that in the environmental context international co-operation is the key to a successful environmental policy

APA, Harvard, Vancouver, ISO, and other styles

37

Allen, Stephen David. "Ideals of completely bounded operators." Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/11154.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Fällström, Anders. "Algebras of bounded holomorphic functions." Doctoral thesis, Umeå universitet, Institutionen för matematik, teknik och naturvetenskap, 1994. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-114744.

Full text

Abstract:

Some problems concerning the algebra of bounded holomorphic functions from bounded domains in Cn are solved. A bounded domain of holomorphy Q in C2 with nonschlicht i7°°- envelope of holomorphy is constructed and it is shown that there is a point in Q for which Gleason’s Problem for H°°(Q) cannot be solved. If A(f2) is the Banach algebra of functions holomorphic in the bounded domain Q in Cn and continuous on the boundary and if p is a point in Q, then the following problem is known as Gleason’s Problem for A(Q) : Is the maximal ideal in A(Q) consisting of functions vanishing at p generated by (Zl ~Pl) , ■■■ , (Zn - Pn) ? A sufficient condition for solving Gleason’s Problem for A(Q) for all points in Q is given. In particular, this condition is fulfilled by a convex domain Q with Lipi+£-boundary (0 < e < 1) and thus generalizes a theorem of S.L.Leibenzon. One of the ideas in the methods of proof is integration along specific polygonal lines. If Gleason’s Problem can be solved in a point it can be solved also in a neighbourhood of the point. It is shown, that the coefficients in this case depends holomorphically on the points. Defining a projection from the spectrum of a uniform algebra of holomorphic functions to Cn, one defines the fiber in the spectrum over a point as the elements in the spectrum that projects on that point. Defining a kind of maximum modulus property for domains in Cn, some problems concerning the fibers and the number of elements in the fibers in certain algebras of bounded holomorphic functions are solved. It is, for example, shown that the set of points, over which the fibers contain more than one element is closed. A consequence is also that a starshaped domain with the maximum modulus property has schlicht /y°°-envelope of holomorphy. These kind of problems are also connected with Gleason’s problem. A survey paper on general properties of algebras of bounded holomorphic functions of several variables is included. The paper, in particular, treats aspects connecting iy°°-envelopes of holomorphy and some areas in the theory of uniform algebras.

Diss. (sammanfattning) Umeå : Umeå universitet, 1994, härtill 6 uppsatser

digitalisering@umu

APA, Harvard, Vancouver, ISO, and other styles

39

Köhler, Jonathan Hugh. "Bounded rationality in savings decisions." Thesis, University of York, 1996. http://etheses.whiterose.ac.uk/10878/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Lawrence, David E. "Cluster-Based Bounded Influence Regression." Diss., Virginia Tech, 2003. http://hdl.handle.net/10919/28455.

Full text

Abstract:

In the field of linear regression analysis, a single outlier can dramatically influence ordinary least squares estimation while low-breakdown procedures such as M regression and bounded influence regression may be unable to combat a small percentage of outliers. A high-breakdown procedure such as least trimmed squares (LTS) regression can accommodate up to 50% of the data (in the limit) being outlying with respect to the general trend. Two available one-step improvement procedures based on LTS are Mallows 1-step (M1S) regression and Schweppe 1-step (S1S) regression (the current state-of-the-art method). Issues with these methods include (1) computational approximations and sub-sampling variability, (2) dramatic coefficient sensitivity with respect to very slight differences in initial values, (3) internal instability when determining the general trend and (4) performance in low-breakdown scenarios. A new high-breakdown regression procedure is introduced that addresses these issues, plus offers an insightful summary regarding the presence and structure of multivariate outliers. This proposed method blends a cluster analysis phase with a controlled bounded influence regression phase, thereby referred to as cluster-based bounded influence regression, or CBI. Representing the data space via a special set of anchor points, a collection of point-addition OLS regression estimators forms the basis of a metric used in defining the similarity between any two observations. Cluster analysis then yields a main cluster "halfset" of observations, with the remaining observations becoming one or more minor clusters. An initial regression estimator arises from the main cluster, with a multiple point addition DFFITS argument used to carefully activate the minor clusters through a bounded influence regression framework. CBI achieves a 50% breakdown point, is regression equivariant, scale equivariant and affine equivariant and distributionally is asymptotically normal. Case studies and Monte Carlo studies demonstrate the performance advantage of CBI over S1S and the other high breakdown methods regarding coefficient stability, scale estimation and standard errors. A dendrogram of the clustering process is one graphical display available for multivariate outlier detection. Overall, the proposed methodology represents advancement in the field of robust regression, offering a distinct philosophical viewpoint towards data analysis and the marriage of estimation with diagnostic summary.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

41

Zhang, Luyao. "Bounded Rationality and Mechanism Design." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Nalla, Pradeep Kumar. "Efficient distributed bounded property checking." [S.l. : s.n.], 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wu, Yiping. "Bounded rationality for BitTorrent networks." Diss., Columbia, Mo. : University of Missouri-Columbia, 2008. http://hdl.handle.net/10355/6681.

Full text

Abstract:

Thesis (M.S.)--University of Missouri-Columbia, 2008.
The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 19, 2009) Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

44

Carroll, Gabriel D. (Gabriel Drew). "Approaches to mechanism design with boundedly rational agents." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/72829.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Economics, 2012.
Cataloged from PDF version of thesis.
Includes bibliographical references.
This dissertation ties together three papers on mechanism design with boundedly rational agents. These papers explore theoretically whether, and to what extent, limitations on agents' ability to strategically misrepresent their preferences can help a mechanism designer achieve outcomes that she could not achieve with perfectly rational agents. The first chapter investigates whether local incentive constraints are sufficient to logically imply full incentive-compatibility, in a variety of mechanism design settings. This can be motivated by a boundedly rational model in which agents cannot contemplate all possible misrepresentations, but can consider those that are close to their true preferences. This chapter offers a unified approach that covers both continuous and discrete type spaces, showing that in many commonly studied cases, local incentive-compatibility (suitably defined) implies full incentive-compatibility. The second chapter advances the methodology of looking quantitatively at incentives for strategic behavior, motivated by the premise that agents will be truthful if the incentive to be strategic is small enough. This chapter defines a mechanism's susceptibility to manipulation as the maximum amount of expected utility any agent can ever gain from strategic misrepresntation. This measure of susceptibility is then applied to anonymous voting rules. One set of results estimates the susceptibility of specific voting rules; an important finding is that several voting systems previously identified as resistant to manipulation are actually more susceptible than simple plurality rule, by the measure proposed here. A second set of results gives asymptotic lower bounds on susceptibility for any possible voting rule, under various combinations of efficiency, regularity, and informational conditions. These results illustrate how one can quantitatively explore the tradeoffs between susceptibility and other properties of the voting rule. The third chapter carries the methodology of the second chapter to a market environment: unit-demand, private-value double auction markets. This chapter quantitatively studies the tradeoff between inefficiency and susceptibility to manipulation, among all possible mechanisms for such markets. The main result approximately locates the possibility frontier, pinning it down within a factor that is logarithmic in the size of the market.
by Gabriel D. Carroll.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

45

Vähäkangas, Antti V. "Boundedness of weakly singular integral operators on domains /." Helsinki : Suomalainen Tiedeakatemia, 2009. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=018603140&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Emmer, Susanne. "Optimal portfolios with bounded downside risks." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=96577838X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Gabih, Abdelali, and Ralf Wunderlich. "Optimal portfolios with bounded shortfall risks." Universitätsbibliothek Chemnitz, 2004. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200401202.

Full text

Abstract:

This paper considers dynamic optimal portfolio strategies of utility maximizing investors in the presence of risk constraints. In particular, we investigate the optimization problem with an additional constraint modeling bounded shortfall risk measured by Value at Risk or Expected Loss. Using the Black-Scholes model of a complete financial market and applying martingale methods we give analytic expressions for the optimal terminal wealth and the optimal portfolio strategies and present some numerical results.

APA, Harvard, Vancouver, ISO, and other styles

48

Svindland, Gregor. "Convex Risk Measures Beyond Bounded Risks." Diss., lmu, 2009. http://nbn-resolving.de/urn:nbn:de:bvb:19-97156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Teska, Jakub University of Ballarat. "Graphs and subgraphs with bounded degree." Author, 2008. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/12806.

Full text

Abstract:

"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract.
Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

50

Awedh, Mohammad. "Proving properties for bounded model checking." Diss., Connect to online resource, 2006. 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:3219012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Boundedne'

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