Dissertations / Theses: 'Classes of recursive functions'

1

Cooper, D. "Classes of low complexity." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.375251.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gomes, Victor pereira. "Funções recursivas primitivas: caracterização e alguns resultados para esta classe de funções." Universidade Federal da Paraíba, 2016. http://tede.biblioteca.ufpb.br:8080/handle/tede/8514.

Full text

Abstract:

Submitted by Maike Costa (maiksebas@gmail.com) on 2016-08-10T14:17:41Z No. of bitstreams: 1 arquivo total.pdf: 975005 bytes, checksum: 6f8194b9c0cb9c0bbd07b1d2b0ba4b9e (MD5)
Made available in DSpace on 2016-08-10T14:17:41Z (GMT). No. of bitstreams: 1 arquivo total.pdf: 975005 bytes, checksum: 6f8194b9c0cb9c0bbd07b1d2b0ba4b9e (MD5) Previous issue date: 2016-06-21
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
The class of primitive recursive functions is not a formal version to the class of algorithmic functions, we study this special class of numerical functions due to the fact of that many of the functions known as algorithmic are primitive recursive. The approach on the class of primitive recursive functions aims to explore this special class of functions and from that, present solutions for the following problems: (1) given the class of primitive recursive derivations, is there an algorithm, that is, a mechanical procedure for recognizing primitive recursive derivations? (2) Is there a universal function for the class of primitive recursive functions? If so, is this function primitive recursive? (3) Are all the algorithmic functions primitive recursive? To provide solutions to these issues, we base on the hypothetical-deductive method and argue based on the works of Davis (1982), Mendelson (2009), Dias e Weber (2010), Rogers (1987), Soare (1987), Cooper (2004), among others. We present the theory of Turing machines which is a formal version to the intuitive notion of algorithm, and after that the famous Church-Turing tesis which identifies the class of algorithmic functions with the class of Turing-computable functions. We display the class of primitive recursive functions and show that it is a subclass of Turing-computable functions. Having explored the class of primitive recursive functions we proved as results that there is a recognizer algorithm to the class of primitive recursive derivations; that there is a universal function to the class of primitive recursive functions which does not belong to this class; and that not every algorithmic function is primitive recursive.
A classe das funções recursivas primitivas não constitui uma versão formal para a classe das funções algorítmicas, estudamos esta classe especial de funções numéricas devido ao fato de que muitas das funções conhecidas como algorítmicas são recursivas primitivas. A abordagem acerca da classe das funções recursivas primitivas tem como objetivo explorar esta classe especial de funções e, a partir disto, apresentar soluções para os seguintes problemas: (1) dada a classe das derivações recursivas primitivas, há um algoritmo, ou seja, um procedimento mecânico, para reconhecer derivações recursivas primitivas? (2) Existe uma função universal para a classe das funções recursivas primitivas? Se sim, essa função é recursiva primitiva? (3) Toda função algorítmica é recursiva primitiva? Para apresentar soluções para estas questões, nos pautamos no método hipotético-dedutivo e argumentamos com base nos manuais de Davis (1982), Mendelson (2009), Dias e Weber (2010), Rogers (1987), Soare (1987), Cooper (2004), entre outros. Apresentamos a teoria das máquinas de Turing, que constitui uma versão formal para a noção intuitiva de algoritmo, e, em seguida, a famosa tese de Church-Turing, a qual identifica a classe das funções algorítmicas com a classe das funções Turing-computáveis. Exibimos a classe das funções recursivas primitivas, e mostramos que a mesma constitui uma subclasse das funções Turing-computáveis. Tendo explorado a classe das funções recursivas primitivas, como resultados, provamos que existe um algoritmo reconhecedor para a classe das derivações recursivas primitivas; que existe uma função universal para a classe das funções recursivas primitivas a qual não pertence a esta classe; e que nem toda função algorítmica é recursiva primitiva.

APA, Harvard, Vancouver, ISO, and other styles

3

Ferizis, George Computer Science &amp Engineering Faculty of Engineering UNSW. "Mapping recursive functions to reconfigurable hardware." Awarded by:University of New South Wales. Computer Science and Engineering, 2005. http://handle.unsw.edu.au/1959.4/23366.

Full text

Abstract:

Reconfigurable computing is a method of development that provides a developer with the ability to reprogram a hardware device. In the specific case of FPGAs this allows for rapid and cost effective implementation of hardware devices when compared to standard a ASIC design, coupled with an increase in performance when compared to software based solutions. With the advent of development tools such as Celoxica's DK package and Xilinx's Forge package, that support languages traditionally associated with software development, a change in the skill sets required to develop FPGA solutions from hardware designers to software programmers is possible and perhaps desirable to increase the adoption of FPGA technologies. To support developers with these skill sets tools should closely mirror current software development tools in terms of language, syntax and methodology, while at the same time both transparently and automatically take advantage of as much of the increased performance that reconfigurable architectures can provide over traditional software architectures by utilizing the parallelism and the ability to create arbitrary depth pipelines which is not present in traditional microprocessor designs. A common feature of many programming languages that is not supported by many higher level design tools is recursion. Recursion is a powerful method used to elegantly describe many algorithms. Recursion is typically implemented by using a stack to store arguments, context and a return address for function calls. This however limits the controlling hardware to running only a single function at any moment which eliminates an algorithm's ability to take advantage of the parallelism available between successive iterations of a recursive function. This squanders the high amount of parallelism provided by the resources on the FPGA thus reducing the performance of the recursive algorithm. This thesis presents a method to address the lack of support for recursion in design tools that exploits the parallelism available between recursive calls. It does this by unrolling the recursion into a pipeline, in a similar manner to the pipeline obtained from loop unrolling, and then streaming the data through the resulting pipeline. However essential differences between loops and recursive functions such as multiple recursive calls in a function, and hence multiple unrollings, and post-recursive statements add further complexity to the issue of unrolling as the pipeline may take a non-linear shape and contain heterogeneous stages. Unrolling the recursive function on the FPGA increases the parallelism available, however the depth of the pipline and therefore the amount of parallelism available, is limited by the finite resources on the FPGA. To make efficient use of the resources on the FPGA the system must be able to unroll the function in a way to best suit the input but also must ensure that the function is not unrolled past its maximum recursive depth. A trivial solution such as unrolling on-demand introduces a latency into the system when a further instance of the function is unrolled that reduces overall performance. To reduce this penalty it is desirable for the system to be able to predict the behaviour of the recursive function based on the input data and unroll the function to a suitable length prior to it being required. Accurate prediction is possible in cases where the condition for recursion is a simple function on the arguments, however in cases where the condition for recursion is based on complex functions, such as the entire recursive function, accurate prediction is not possible. In situations such as this a heuristic is used which provides a close approximation to the correct depth of recursion at any given time. This prediction allows the system to reduce the performance penalty from real time unrolling without over utilization of the the FPGA resources. Results obtained demonstrate the increase in performance for various recursive functions obtained from the increased parallelism, when compared to a stack based implementation on the same device. In certain instances due to constraints on hardware availability results were gained from device simulation using a simulator developed for this purpose. Details of this simulator are presented in this thesis.

APA, Harvard, Vancouver, ISO, and other styles

4

Francis, Johanna Leigh 1970. "Three essays in recursive utility functionals." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61285.

Full text

Abstract:

Three essays in the study recursive utility are presented. The first is an exposition of the extant recursive utility literature. A correspondence is drawn between the discrete time axioms for recursive utility in Koopmans (1960) and the continuous time framework in Epstein (1987b). The second essay investigates the method for endogenizing the rate of time preference given in Uzawa (1968). It is shown that when applied to non-autonomous systems, the Uzawa transformation generates errors in first order conditions. We provide a simple method for extending the Uzawa transformation to non-autonomous systems. These results are applied to two stochastic optimal control problems in the third essay. In the first problem a consumer optimally allocates consumption of a given cake whose size is unknown. With an endogenous rate of time preference, it is shown that the consumption profile may be increasing monotonic under a given set of assumptions. The second problem incorporates an endogenous rate of time preference into a stochastic optimal growth model.

APA, Harvard, Vancouver, ISO, and other styles

5

House, Robert Simpson. "Airy functions and the Recursive Ray Acoustics Algorithm." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA290182.

Full text

Abstract:

Thesis (M.S. in Electrical Engineering) Naval Postgraduate School, December 1994.
Thesis advisor(s): Lawrence J. Ziomek. "December 1994." Includes bibliographical references. Also available online.

APA, Harvard, Vancouver, ISO, and other styles

6

McVeigh, Brian. "Multiple functions in equivalence classes." Thesis, University of Ulster, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.414095.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Clouâtre, André. "Implementation and applications of recursively defined relations." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=75694.

Full text

Abstract:

In relational algebra, a recursive relation R is defined by an equation of the form R = f(R), where f(R) is a positive relational algebra expression. Such an equation can be solved by applying a general closure operator. Although some optimization is possible, the performance obtained using this approach is very dependent on the form of the equation which defines R. Principally for this reason, we have developed specialized closure operators for relations which are solutions to problems of practical importance such as transitive closure, accessibility, shortest path, bill-of-materials, and deductions by containment comparisons.
This approach has led to the following general results: (1) design, classification, and analysis of many iterative methods for evaluating recursive relations, as well as analysis of experimental results; (2) formalization of the concept of iterative evaluation of a relation; (3) demonstration that domain algebra can be used to solve problems of concatenation and aggregation of the information associated with a recursive structure; (4) proof that relational division and general containment joins are left-monotone.
More specific results consist of a collection of original algorithms which run well on secondary storage, as shown by simulations. Among them, we wish to emphasize the differencing logarithmic transitive closure (TC) algorithms, which are superior to the previously known relational TC algorithms, and the shortest path algorithms, which are in fact generic algorithms for path algebra problems.

APA, Harvard, Vancouver, ISO, and other styles

8

Kabanets, Valentine. "Nonuniformly hard Boolean functions and uniform complexity classes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ58599.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Darus, M. "Extreme problems for certain classes of analytic functions." Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.636350.

Full text

Abstract:

This thesis is concerned with extreme problems for certain classes of analytic functions. In many cases, the classes of functions considered form proper subclasses of the class S of normalised analytic functions which are univalent in the unit disc D. In Chapter 1, we present some definitions and known results which are required in subsequent chapters. In Chapter 2, we state some known results concerning the so-called Fekete-Szegö Theorem. We give some extensions and new results in the case of close-to-convex functions. Chapter 3 contains some miscellaneous Fekete-Szegö Theorems. In this chapter, we introduce a new class of analytic functions, which we call logarithmically convex. These functions are a natural analogue to the so-called α-convex functions, studied extensively over the last decade or so. Some extreme coefficient problems are solved for logarithmically convex functions. The final chapter deals with subordination. We apply a lemma of Miller and Mocanu to obtain a series of best possible subordination theorems when the super-ordinate function lies in a sector, rather than the usual half-plane. A consequence of one such result is that the logarithmically convex functions defined in Chapter 3 form a subset of the starlike functions and are thus univalent in D.

APA, Harvard, Vancouver, ISO, and other styles

10

Pedron, Mark [Verfasser]. "Zero Partition Cycles : A Recursive Formula for Characteristic Classes of Surface Bundles / Mark Pedron." Bonn : Universitäts- und Landesbibliothek Bonn, 2017. http://d-nb.info/1132711517/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bani-Mustafa, Ahmed. "Recursive residuals and estimation for mixed models /." View thesis, 2004. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20050928.140822/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Meredith, M. Brandon. "Polynomial Functions over Rings of Residue Classes of Integers." Digital Archive @ GSU, 2007. http://digitalarchive.gsu.edu/math_theses/34.

Full text

Abstract:

In this thesis we discuss how to find equivalent representations of polynomial functions over the ring of integers modulo a power of a prime. Specifically, we look for lower degree representations and representations with fewer variables for which important applications in electrical and computer engineering exist. We present several algorithms for finding these compact formulations.

APA, Harvard, Vancouver, ISO, and other styles

13

Ward, Claire. "On geometric zeta functions, epsilon constants and canonical classes." Thesis, King's College London (University of London), 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Labuschagne, L. E., and Louis E. Labuschagne. "Functions of operators and the classes associated with them." Doctoral thesis, University of Cape Town, 1988. http://hdl.handle.net/11427/23260.

Full text

Abstract:

The important classes of normally solvable, ϴ₊ (ϴ₋) and strictly singular (strictly cosingular) operators have long been studied in the setting of bounded or closed operators between Banach spaces. Results by Kato, Lacey, et al (see Goldberg [16; III.1.9, III.2.1 and III.2.3] ) led to the definition of certain norm related functions of operators (Γ, Δ and Γ₀) which provided a powerful new way to study the classes of ϴ₊ and strictly singular operators (see for example Gramsch[19], Lebow and Schechter[28] and Schechter[36]). Results by Brace and R.-Kneece[4] among others led to the definition of analogous functions (Γ' and Δ') which were used to study ϴ₋ and strictly cosingular operators (see for example Weis, [37] and [38]). Again this problem was considered mainly for the case of bounded operators between Banach spaces. This thesis represents a contribution to knowledge in the sense that by considering the functions Γ', Δ' and Γ'₀, as well as the minimum modulus function in the more general setting of unbounded linear operators between normed linear spaces, we obtain the classes of F₋ and Range Open operators which turn out to be closely related to the classes of ϴ₋ and normally solvable operators respectively. We also define unbounded strictly cosingular operators and find that many of the classical results on ϴ₋, normally solvable and bounded strictly cosingular operators go through for F₋, range open and unbounded strictly cosingular operators respectively. This ties up with work done by R. W. Cross and provides a workable framework within which to study ϴ₋ and ϴ₊ type operators in the much more. general setting of unbounded linear operators between normed linear spaces.

APA, Harvard, Vancouver, ISO, and other styles

15

Octavian, Stan. "New recursive algorithms for training feedforward multilayer perceptrons." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/13534.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Saito, Chieri. "A design and theory of strongly typed object-oriented programming languages for extensible recursive classes." 京都大学 (Kyoto University), 2010. http://hdl.handle.net/2433/120371.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

So, Hon Chung. "The Julia sets of certain classes of permutable entire functions /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?MATH%202007%20SO.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Petersen, Willis L. "The Lie Symmetries of a Few Classes of Harmonic Functions." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd837.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Madrigal-Bauguss, Jessica Glenn Sigrid S. "Transfer of "good" and "bad" functions within stimulus equivalence classes." [Denton, Tex.] : University of North Texas, 2008. http://digital.library.unt.edu/permalink/meta-dc-6080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Madrigal-Bauguss, Jessica. "Transfer of "good" and "bad" functions within stimulus equivalence classes." Thesis, University of North Texas, 2008. https://digital.library.unt.edu/ark:/67531/metadc6080/.

Full text

Abstract:

This study compared results of two experiments that tested transfer of function in stimulus equivalence classes in a task dissimilar to (in Experiment I) and similar to (in Experiment II) the task that trained functional responding. Eleven students from UNT participated in return for monetary compensation. Phase 1 and 2 were identical in the two experiments, in which they established stimulus equivalence classes and functional responding, respectively. Each experiment then used different tasks in the third phase to test differential responding. Only participants in Experiment II demonstrated consistent transfer of function. Results are discussed in terms of how task similarity may function as a type of contextual control when there is limited experience with the task.

APA, Harvard, Vancouver, ISO, and other styles

21

Lannin, John K. Langrall Cynthia Willey. "Developing middle school students' understanding of recursive and explicit reasoning." Normal, Ill. Illinois State University, 2001. http://wwwlib.umi.com/cr/ilstu/fullcit?p3006621.

Full text

Abstract:

Thesis (Ph. D.)--Illinois State University, 2001.
Title from title page screen, viewed April 25, 2006. Dissertation Committee: Cynthia W. Langrall (Chair), Graham A. Jones, Tami S. Martin, Patricia H. Klass. Includes bibliographical references (leaves 138-146) and abstract. Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

22

譚天佑 and Tin-yau Tam. "A study of induced operators on symmetry classes of tensors." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1986. http://hub.hku.hk/bib/B31230738.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Tam, Tin-yau. "A study of induced operators on symmetry classes of tensors /." [Hong Kong] : University of Hong Kong, 1986. http://sunzi.lib.hku.hk/hkuto/record.jsp?B12322593.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Oram, John A. "Best approximations from certain classes of functions defined by integral operators." Thesis, University of Newcastle Upon Tyne, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386590.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Dominquez-Soto, Patricia. "Investigations in the dynamics of three different classes of meromorphic functions." Thesis, University College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286312.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Schnell, Christian. "The boundary behavior of cohomology classes and singularities of normal functions." Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1218036000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Mersmann, Gerd. "Algebraische und kombinatorische Aspekte der Harder-Narasimhan-Rekursion und ihrer Umkehrung." Bonn : [s.n.], 1999. http://catalog.hathitrust.org/api/volumes/oclc/41464664.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Jahangiri-Lahekani, M. "Coefficients of powers of subclasses of univalent functions and convolutions of some classes of polynomials and analytic functions." Thesis, University of York, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Piotrowski, Andrzej. "Classes of Linear Operators and the Distribution of Zeros of Entire Functions." Thesis, University of Hawaii at Manoa, 2007. http://hdl.handle.net/10125/25932.

Full text

Abstract:

Motivated by the work of Pólya, Schur, and Turán, a complete characterization of multiplier sequences for the Hermite polynomial basis is given. Laguerre's theorem and a remarkable curve theorem due to Pólya are generalized. Sufficient conditions for the location of zeros in certain strips in the complex plane are determined. Results pertaining to multiplier sequences and complex zero decreasing sequences for other polynomial sets are established.
viii, 178 leaves, bound ; 29 cm.
Thesis (Ph. D.)--University of Hawaii at Manoa, 2007.

APA, Harvard, Vancouver, ISO, and other styles

30

MacIver, Kirsty. "The role of common stimulus functions in the development of equivalence classes." Thesis, University of North Texas, 2004. https://digital.library.unt.edu/ark:/67531/metadc4593/.

Full text

Abstract:

College students were exposed to training designed to teach nine simple discriminations, such that sets of three arbitrary visual stimuli acquired common functions. For seven of eight participants, three 3-member contingency classes resulted. When the same stimuli were presented in a match-to-sample procedure under test conditions, four participants demonstrated equivalence-consistent responding, matching all stimuli from the same contingency class. Test performance for two participants was systematically controlled by other variables, and for a final participant was unsystematic. Exposure to a yes/no test yielded equivalence-consistent performance for one participant where the match-to-sample test had not. Implications for the treatment of equivalence as a unified, integrated phenomenon are discussed.

APA, Harvard, Vancouver, ISO, and other styles

31

Lin, Chungping. "The RMT (Recursive multi-threaded) tool: A computer aided software engineeering tool for monitoring and predicting software development progress." CSUSB ScholarWorks, 1998. https://scholarworks.lib.csusb.edu/etd-project/1787.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Fournier, Bradford M. "Towards a Theory of Recursive Function Complexity: Sigma Matrices and Inverse Complexity Measures." ScholarWorks@UNO, 2015. http://scholarworks.uno.edu/td/2072.

Full text

Abstract:

This paper develops a data structure based on preimage sets of functions on a finite set. This structure, called the sigma matrix, is shown to be particularly well-suited for exploring the structural characteristics of recursive functions relevant to investigations of complexity. The matrix is easy to compute by hand, defined for any finite function, reflects intrinsic properties of its generating function, and the map taking functions to sigma matrices admits a simple polynomial-time algorithm . Finally, we develop a flexible measure of preimage complexity using the aforementioned matrix. This measure naturally partitions all functions on a finite set by characteristics inherent in each function's preimage structure.

APA, Harvard, Vancouver, ISO, and other styles

33

Castillo, René Erlin. "Generalized Non-Autonomous Kato Classes and Nonlinear Bessel Potentials." Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1121964346.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Calcina, Sabrina Graciela Suárez. "Princípio da similaridade para classes de campos vetoriais complexos." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-02042014-142433/.

Full text

Abstract:

Esta dissertação trata do Princípio da similaridade para as soluções das equações da forma L\'OMEGA\' = A(z) ·\'OMEGA\' + B(z) · \'BARRA\' \'omega\' , sendo L um campo vetorial complexo não singular e A,B \'PERTENCE\' \'C POT. sigma\' (\'R POT. 2\'), com 0 < \'sigma\' < 1. Aqui são apresentados resultados para o campo vetorial elítico L = \'PARTIAL SUP\' \'\'PARTIAL\' z e para classes de campos vetoriais elíticos degenerados
This dissertation deals with the Similarity principle for solutions of equations of the form L \'omega\' = A(z) · \'omega\' + B(z) · \' BARRA\' \'omega\' where L is a nonsingular complex vector field and A,B \'IT BELONGS\' \'C POT. sigma \' (\'R POT. 2\'), with 0 < \'sigma\' < 1. Here are presented results for elliptic vector field and for classes of degenerate elliptic vector fields

APA, Harvard, Vancouver, ISO, and other styles

35

De, Castro Lisa. "Analytic Functions with Real Boundary Values in Smirnov Classes E^p." Scholar Commons, 2013. http://scholarcommons.usf.edu/etd/4661.

Full text

Abstract:

This thesis concerns the classes of analytic functions on bounded, n-connected domains known as the Smirnov classes Ep, where p > 0. Functions in these classes satisfy a certain growth condition and have a relationship to the more well known classes of functions known as the Hardy classes Hp. In this thesis I will show how the geometry of a given domain will determine the existence of non-constant analytic functions in Smirnov classes that possess real boundary values. This is a phenomenon that does not occur among functions in the Hardy classes. The preliminary and background information is given in Chapters 1 and 3 while the main results of this thesis are presented in Chapters 2 and 4. In Chapter 2, I will consider the case of the simply connected domain and the boundary characteristics that allow non-constant analytic functions with real boundary values in certain Smirnov classes. Chapter 4 explores the case of an n-connected domain and the sufficient conditions for which the aforementioned functions exist. In Chapter 5, I will discuss how my results for simply connected domains extend Neuwirth-Newman's Theorem and finish with an open problem for n-connected domains.

APA, Harvard, Vancouver, ISO, and other styles

36

Juan, Huguet Jordi. "Iterates of differential operators and vector valued functions on non quasi analytic classes." Doctoral thesis, Universitat Politècnica de València, 2011. http://hdl.handle.net/10251/9401.

Full text

Abstract:

En el año 1960 Komatsu introdujo ciertas clases de funciones infinitamente derivables definidas mediante estimaciones del crecimiento de los sucesivos iterados de un operador en derivadas parciales cuando estudiaba propiedades de regularidad de las soluciones de ciertas ecuaciones en derivadas parciales. Esta línea de investigación ha sido muy activa hasta la actualidad a través de los trabajos de muchos autores. Destacamos, entre otros, Bolley, Camus, Kotake, Langenbruch, Métivier, Narasimhan, Newberger, Rodino, Zanghirati y Zielezny. Toda esta bibliografía involucra el llamado problema de los iterados que consiste, grosso modo, en caracterizar las funciones de una cierta clase en términos del comportamiento de los iterados de un operador previamente fijado. En la primera parte de esta tesis seguimos con la investigación mencionada antes en un contexto más general: clases no casi analíticas de funciones ultradiferenciables en el sentido de Braun, Meise y Taylor. El estudio de estas clases no casi analíticas es una área de investigación muy activa debido a sus aplicaciones a la teoría de operadores en derivadas parciales: destacamos entre otros el trabajo de Bonet, Braun, Domanski, Fernández, Frerick, Galbis, Taylor y Vogt. En el Capítulo 1 introducimos estas clases y enunciamos las propiedados que utilizaremos a lo largo de esta tesis. En el Capítulo 2 definimos las clases no casi analíticas con respecto a los iterados de un operador en derivadas parciales P(D) y estudiamos sus propiedades topológicas como la completitud y la nuclearidad. En particular, demostramos que estas clases son un espacio localmente convexo completo si y sólo si el operador P(D) es hipoelíptico y vemos que en tal caso son además un espacio nuclear. A continuación, demostramos que estas clases verifican un teorema de tipo Paley-Wiener. En el Capítulo 3 tenemos como objetivo obtener resultados sobre el problema de los iterados en clases no casi analíticas. Generalizamos varios resultados de Newberger, Zielezny, Métivier y Komatsu y damos caracterizaciones de cuándo una clase no casi analítica definida en términos de los iterados de un operador coincide con una clase no casi analítica según Braun, Meise y Taylor. Toda la investigación que se había hecho sobre espacios de funciones definidos por iterados de operadores se había centrado en clases de tipo Roumieu. Sin embargo, demostramos que los resultados dados en los Capítulos 2 y 3 también son válidos para clases de tipo Beurling. En el año 1990, Langenbruch y Voigt demostraron que todo espacio de Fréchet formado por distribuciones que sea invariante bajo la acción de un operador hipoelíptico está continuamente incluido en C¥. En el capítulo 4 introducimos los operadores ultradiferenciales e investigamos extensiones del resultado de Langenbruch y Voigt al contexto ultradiferenciable. El nuevo concepto de espacio de Fréchet (w, P(D))-estable involucra a los iterados de P(D) mediante una condición de equicontinuidad y nos permite mostrar la relación de este tipo de resultados con el problema de los iterados. La segunda parte de esta tesis se centra en el estudio de funciones con valores vectoriales en un espacio localmente convexo.
Juan Huguet, J. (2011). Iterates of differential operators and vector valued functions on non quasi analytic classes [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/9401
Palancia

APA, Harvard, Vancouver, ISO, and other styles

37

Landrum, Chad Michael. "A recursive algorithm to prevent deadlock in flexible manufacturing systems." Ohio : Ohio University, 2000. http://www.ohiolink.edu/etd/view.cgi?ohiou1172265184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Hughes, Maureen Eliabeth. "Teachers and other adults as talk-partners for pupils in nursery and reception classes." Thesis, University of Newcastle Upon Tyne, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241540.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Pawlaschyk, Thomas Patrick [Verfasser]. "On some classes of q-plurisubharmonic functions and q-pseudoconcave sets / Thomas Patrick Pawlaschyk." Wuppertal : Universitätsbibliothek Wuppertal, 2015. http://d-nb.info/1081429941/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Pawlaschyk, Thomas [Verfasser]. "On some classes of q-plurisubharmonic functions and q-pseudoconcave sets / Thomas Patrick Pawlaschyk." Wuppertal : Universitätsbibliothek Wuppertal, 2015. http://d-nb.info/1081429941/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Osman, Abdusslam. "Smoothness of invariant densities for certain classes of dynamical systems." Thesis, Connect to online version, 1996. http://0-wwwlib.umi.com.mercury.concordia.ca/cr/concordia/fullcit?pMQ90889.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Soler, i. Gibert Odí. "Approximation in the Zygmund Class and Distortion under Inner Functions." Doctoral thesis, Universitat Autònoma de Barcelona, 2020. http://hdl.handle.net/10803/670865.

Full text

Abstract:

En aquest treball es tracten dos problemes. El primer és un problema d’aproximació en la classe de Zygmund per funcions del subespai I_1(BMO), que és l’espai de funcions contínues amb derivada a BMO en el sentit de les distribucions. Considerem la distància definida per la semi-norma de Zygmund. En el Capítol 1, donada una funció f de la classe de Zygmund en la recta real amb suport compacte, trobem una estimació de la seva distància al subespai I_1(BMO). A més, aquest resultat s’expressa en termes de les segones diferències de f, que defineixen la seva semi-norma de Zygmund. Com a corol·lari, obtenim una caracterització de la clausura de l’espai I_1(BMO) en aquesta semi-norma. Els mètodes presentats en aquesta primera part no es poden aplicar al cas de la classe de Zygmund a l’espai euclidià de dimensió n>1. Tanmateix, presentem un resultat anàleg per mesures de Zygmund en dimensió n>=1. En aquest cas, el subespai que considerem és el de mesures absolutament contínues amb derivada de Radon-Nykodim en l’espai BMO. En el Capítol 2, considerem l’espai de funcions amb continuïtat Hölder de paràmetre 0=1. Per 0En este trabajo se tratan dos problemas. El primero es un problema de aproximación en la clase de Zygmund por funciones del subespacio I_1(BMO), que es el espacio de funciones continuas con derivada en BMO en el sentido de las distribuciones. Consideramos la distancia definida por la semi-norma de Zygmund. En el Capítulo 1, dada una función f de la clase de Zygmund en la recta real con soporte compacto, encontramos una estimación de su distancia al subespacio I_1(BMO). Además, este resultado se expresa mediante las segundas diferencias de f, que definen su semi-norma de Zygmund. Como corolario, obtenemos una caracterización de la clausura del espacio I_1(BMO) en esta semi-norma. Los métodos presentados en esta primera parte no son aplicables al caso de la clase de Zygmund en el espacio euclidiano de dimensión n>1. No obstante, presentamos un resultado análogo para medidas de Zygmund en dimensión n>=1. En este caso, el subespacio que consideramos es el de medidas absolutamente continuas con derivada de Radon-Nykodim en el espacio BMO. En el Capítulo 2, consideramos el espacio de funciones continuas Hölder de parámetro 0=1. Para 0In this work we deal with two different problems. The first one is an approximation problem in the Zygmund class by functions in the subspace I_1(BMO), which is the space of continuous functions with derivative in BMO in the sense of distributions. We consider the distance defined by the Zygmund semi-norm. In Chapter 1, given a function f in the Zygmund class in the real line with compact support, we find an estimate of its distance to the subspace I_1(BMO). In addition, this result is expressed in terms of the second differences of f, which define its Zygmund semi-norm. As a corollary, we obtain a characterisation of the closure of I_1(BMO) in this semi-norm. The methods presented in this first part are not applicable to the Zygmund class in the euclidean space of dimension n>1. However, we present an analogous result for Zygmund measures in dimension n>=1. In this case, the subspace that we consider is the space of absolutely continuous measures with Radon-Nykodim derivative in BMO. In Chapter 2, we consider the space of Hölder continuous functions with parameter 0=1. For 0

APA, Harvard, Vancouver, ISO, and other styles

43

SOUZA, Luciano. "New trigonometric classes of probabilistic distributions." Universidade Federal Rural de Pernambuco, 2015. http://www.tede2.ufrpe.br:8080/tede2/handle/tede2/5127.

Full text

Abstract:

Submitted by Mario BC (mario@bc.ufrpe.br) on 2016-08-01T12:46:49Z No. of bitstreams: 1 Luciano Souza.pdf: 1424173 bytes, checksum: 75d7ff2adb5077203e1371925327b71e (MD5)
Made available in DSpace on 2016-08-01T12:46:49Z (GMT). No. of bitstreams: 1 Luciano Souza.pdf: 1424173 bytes, checksum: 75d7ff2adb5077203e1371925327b71e (MD5) Previous issue date: 2015-11-13
In this thesis, four new probabilistic distribution classes are presented and investigated: sine, cosine, tangent and secant. For each of which a new kind of distribution was created, which were used for modelling real life data.By having an exponential distribution to compare the biases, a numerical simulation was obtained, making it possible to verify that the bias tends to zero as the sample size is increased. In addition to that, some numerical results for checking maximum likelihood estimates, as well as the results for finite samples, were obtained, just as much as several class properties and their respective distributions were also obtained, along with the expansions, maximum likelihood estimates, Fisher information, the first four moments, average, variance, skewness, and kurtosis, the generating function of moments and Renyi’s entropy. It was evidenced that all distributions have shown good fit when applied to real life data, when in comparison to other models. In order to compare the models, the Akaike Information Criterion (AIC), the Corrected Akaike Information Criterion (CAIC), the Bayesian Information Criterion (BIC), the Hannan Quinn Information Criterion (HQIC) were used, along with two other main statistic sources: Cramer-Von Mises and Anderson-Darling. As a final step, the results of the analyses and the comparison of the results are brought up, as well as a few directions for future works.
Nesta tese apresentamos e investigamos quatro novas classes trigonométricas de distribuições probabilísticas. As classes seno, cosseno, tangente e secante. Para cada uma das novas classes foi criada uma nova distribuição. Estas quatro novas distribuições foram usadas na modelagem de dados reais. Obtivemos uma simulação numérica, usando como base a distribuição exponencial, para se comparar os vicios (bias) e verificamos que, a medida que aumentamos o tamanho da amostra, o bias tende a zero. Alguns resultados numéricos para ver estimativas de máxima verossimilhança e os resultados para amostras finitas foram obtidos. Várias propriedades das classes e as suas distribuições foram obtidos. Obtemos as expansões, as estimativas de máxima verossimilhança, informações de Fisher, os quatro primeiros momentos, média, variância, assimetria e curtose, a função geradora de momentos e a entropia Rényi. Mostramos que todas as distribuições têm proporcionado bons ajustes quando aplicadas a dados reais, em comparação com outros modelos. Na comparação dos modelos foram utilizados: o Akaike Information Criterion (AIC), o Akaike Information Criterion Corrigido (CAIC), a informação Bayesian Criterion (BIC), o critério de informação Hannan Quinn (HQIC) e duas das principais estatísticas também foram utilizadas: Cramer -von Mises e Anderson-Darling. Por fim, apresentamos os resultados da análise e comparação dos resultados, e orientações para trabalhos futuros.

APA, Harvard, Vancouver, ISO, and other styles

44

Delgado, Diana. "Subsitution of stimulus functions as a means to distinguish among different types of functional classes /." abstract and full text PDF (free order & download UNR users only), 2005. http://0-wwwlib.umi.com.innopac.library.unr.edu/dissertations/fullcit/1430443.

Full text

Abstract:

Thesis (M.A.)--University of Nevada, Reno, 2005.
"May, 2005." Includes bibliographical references (leaves 47-49). Online version available on the World Wide Web. Library also has microfilm. Ann Arbor, Mich. : ProQuest Information and Learning Company, [2005]. 1 microfilm reel ; 35 mm.

APA, Harvard, Vancouver, ISO, and other styles

45

Kutbi, M. A. "Growth properties of certain classes of functions regular in the unit disc and their derivatives." Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.637834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Amsheri, Somia M. A. "Fractional calculus operator and its applications to certain classes of analytic functions. A study on fractional derivative operator in analytic and multivalent functions." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/6320.

Full text

Abstract:

The main object of this thesis is to obtain numerous applications of fractional derivative operator concerning analytic and -valent (or multivalent) functions in the open unit disk by introducing new classes and deriving new properties. Our finding will provide interesting new results and indicate extensions of a number of known results. In this thesis we investigate a wide class of problems. First, by making use of certain fractional derivative operator, we define various new classes of -valent functions with negative coefficients in the open unit disk such as classes of -valent starlike functions involving results of (Owa, 1985a), classes of -valent starlike and convex functions involving the Hadamard product (or convolution) and classes of -uniformly -valent starlike and convex functions, in obtaining, coefficient estimates, distortion properties, extreme points, closure theorems, modified Hadmard products and inclusion properties. Also, we obtain radii of convexity, starlikeness and close-to-convexity for functions belonging to those classes. Moreover, we derive several new sufficient conditions for starlikeness and convexity of the fractional derivative operator by using certain results of (Owa, 1985a), convolution, Jack¿s lemma and Nunokakawa¿ Lemma. In addition, we obtain coefficient bounds for the functional of functions belonging to certain classes of -valent functions of complex order which generalized the concepts of starlike, Bazilevi¿ and non-Bazilevi¿ functions. We use the method of differential subordination and superordination for analytic functions in the open unit disk in order to derive various new subordination, superordination and sandwich results involving the fractional derivative operator. Finally, we obtain some new strong differential subordination, superordination, sandwich results for -valent functions associated with the fractional derivative operator by investigating appropriate classes of admissible functions. First order linear strong differential subordination properties are studied. Further results including strong differential subordination and superordination based on the fact that the coefficients of the functions associated with the fractional derivative operator are not constants but complex-valued functions are also studied.

APA, Harvard, Vancouver, ISO, and other styles

47

Amsheri, Somia Muftah Ahmed. "Fractional calculus operator and its applications to certain classes of analytic functions : a study on fractional derivative operator in analytic and multivalent functions." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/6320.

Full text

Abstract:

The main object of this thesis is to obtain numerous applications of fractional derivative operator concerning analytic and ρ-valent (or multivalent) functions in the open unit disk by introducing new classes and deriving new properties. Our finding will provide interesting new results and indicate extensions of a number of known results. In this thesis we investigate a wide class of problems. First, by making use of certain fractional derivative operator, we define various new classes of ρ-valent functions with negative coefficients in the open unit disk such as classes of ρ-valent starlike functions involving results of (Owa, 1985a), classes of ρ-valent starlike and convex functions involving the Hadamard product (or convolution) and classes of κ-uniformly ρ-valent starlike and convex functions, in obtaining, coefficient estimates, distortion properties, extreme points, closure theorems, modified Hadmard products and inclusion properties. Also, we obtain radii of convexity, starlikeness and close-to-convexity for functions belonging to those classes. Moreover, we derive several new sufficient conditions for starlikeness and convexity of the fractional derivative operator by using certain results of (Owa, 1985a), convolution, Jack's lemma and Nunokakawa' Lemma. In addition, we obtain coefficient bounds for the functional |α_ρ+2-θα²_ρ+1| of functions belonging to certain classes of p-valent functions of complex order which generalized the concepts of starlike, Bazilevič and non-Bazilevič functions. We use the method of differential subordination and superordination for analytic functions in the open unit disk in order to derive various new subordination, superordination and sandwich results involving the fractional derivative operator. Finally, we obtain some new strong differential subordination, superordination, sandwich results for ρ-valent functions associated with the fractional derivative operator by investigating appropriate classes of admissible functions. First order linear strong differential subordination properties are studied. Further results including strong differential subordination and superordination based on the fact that the coefficients of the functions associated with the fractional derivative operator are not constants but complex-valued functions are also studied.

APA, Harvard, Vancouver, ISO, and other styles

48

Huynh, Huy. "Estimating the maximum probability of categorical classes with applications to biological diversity measurements." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44868.

Full text

Abstract:

The study of biological diversity has seen a tremendous growth over the past few decades. Among the commonly used indices capturing both the richness and evenness of a community, the Berger-Parker index, which relates to the maximum proportion of all species, is particularly effective. However, when the number of individuals and species grows without bound this index changes, and it is important to develop statistical tools to measure this change. In this thesis, we introduce two estimators for this maximum: the multinomial maximum and the length of the longest increasing subsequence. In both cases, the limiting distribution of the estimators, as the number of individuals and species simultaneously grows without bound, is obtained. Then, constructing the 95% confidence intervals for the maximum proportion helps improve the comparison of the Berger-Parker index among communities. Finally, we compare the two approaches by examining their associated bias corrected estimators and apply our results to environmental data.

APA, Harvard, Vancouver, ISO, and other styles

49

Padden, Dereck J. "Recursive modeling of interpositional transfer functions with a genetic algorithm aided by an adaptive filter for the purpose of altering free-field sound localization /." Online version of thesis, 2007. http://hdl.handle.net/1850/4484.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Kemp, Russell Stephen. "Pseudo-linear indentification and its application to adaptive control." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/45810.

Full text

Abstract:

The method of Pseudo-Linear Identification (PLID) is presented as an explicitly linear approach to the joint state and parameter estimation problem. The convergence properties of the algorithm in the stochastic case are investigated through simulation and comparisons with popular methods are made. The method is then extended to allow the tracking of time-varying system parameters.

An adaptive control structure based upon this Trackingâ PLID algorithm is proposed which utilizes poleâ placement state variable feedback via Ackermann's formula. The capabilities of this adaptive control scheme are demonstrated by application to a full-order nonlinear aircraft simulation model where significant improvement is shown over fixed-gain controllers in the face of rapid plant changes.

Master of Science

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Classes of recursive functions'

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