Log in

Relevant bibliographies by topics / Recurrent relations / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Recurrent relations.

Dissertations / Theses on the topic 'Recurrent relations'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

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

Select a source type:

Consult the top 41 dissertations / theses for your research on the topic 'Recurrent relations.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Aydin, Hueseyin. "Recurrence relations in finite nilpotent groups." Thesis, University of Bath, 1991. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292809.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

McGough, Andrew Stephen. "Parallel simulations using recurrence relations and relaxation." Thesis, University of Newcastle Upon Tyne, 2000. http://hdl.handle.net/10443/1411.

Full text

Abstract:

This thesis develops and evaluates a number of efficient algorithms for performing parallel simulations. These algorithms achieve approximate linear speed-up, in the sense that their run times are in the order of O(n/p), when n is the size of the problem and p is the number of processors employed. The systems that are being simulated are related to ATM switches and sliding window communication protocols. The algorithms presented first are concern with the parallel generation and merging of bursty arrival sources, marking and deleting of lost cells due to buffer overflows and computation of dep

APA, Harvard, Vancouver, ISO, and other styles

3

Puhlfürst, Georg [Verfasser], and Dieter [Akademischer Betreuer] Lüst. "Non-commutative recurrence relations for scattering amplitudes / Georg Puhlfürst. Betreuer: Dieter Lüst." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2016. http://d-nb.info/1088318185/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Herndon, John Alan. "Limit periodicity of sequences defined by certain recurrence relations; and Julia sets." Diss., Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/28641.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wilkinson, Joan Christina. "Stability in the numerical treatment of Volterra integral and integro-differential equations with emphasis on finite recurrence relations." Thesis, Open University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.290222.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mcneish, Roxann. "An exploration of threatened harm as a type of maltreatment and its relation to recurrence of maltreatment." Scholar Commons, 2013. https://scholarcommons.usf.edu/etd/5074.

Full text

Abstract:

There were no studies found in the literature that primarily focused on threatened harm as type of maltreatment. This study utilized Florida's child welfare administrative data to explore threatened harm as a type of maltreatment, particularly as a predictor of recurrence of maltreatment within six and 12 months for children who had a verified report of maltreatment in FY2005-2006. Threatened harm was examined in three ways; when it was reported as the only maltreatment, the initial maltreatment, and in situations where there was a prior report. The most prevalent acts of threatened harm were

APA, Harvard, Vancouver, ISO, and other styles

7

Khan, Mumtaz Ahmad, and Mukesh Pal Singh. "A study of two variables Legendre polynomials." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/96205.

Full text

Abstract:

The present paper deals with a study of a two variable polynomial Pn(x) analogues to the Legendre polynomial Pn(x). The paper contains differential recurrence relations, a partial differential equation, double generating functions, double and triple hypergeometric forms, a special property and a bilinear double generating function for the newly defined polynomials Pn,k(x, y).

APA, Harvard, Vancouver, ISO, and other styles

8

Nolibos, Denilson Amaral. "Relações de referência e aplicações." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306042.

Full text

Abstract:

Orientadores: Andreia Cristina Ribeiro, Jose Plinio de Oliveira Santos<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-15T13:18:54Z (GMT). No. of bitstreams: 1 Nolibos_DenilsonAmaral_M.pdf: 844244 bytes, checksum: a8a3a4010cc659ca0ba1dffdd0790ad1 (MD5) Previous issue date: 2010<br>Resumo: Este trabalho versa sobre Relações de Recorrência e alguns de seus métodos de resolução. Buscamos gerar um texto de fácil leitura que estimule o leitor a prosseguir e aprofundar-se

APA, Harvard, Vancouver, ISO, and other styles

9

Khan, Mumtaz Ahmad, Abdul Hakim Khan, and Naeem Ahmad. "A study of modified hermite polynomials." Pontificia Universidad Católica del Perú, 2012. http://repositorio.pucp.edu.pe/index/handle/123456789/96880.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Amini, Rose-Marie. "Hodgkin Lymphoma : Studies of Advanced Stages, Relapses and the Relation to Non-Hodgkin Lymphomas." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2002. http://publications.uu.se/theses/91-554-5265-5/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Galiffa, Daniel. "THE SHEFFER B-TYPE 1 ORTHOGONAL POLYNOMIAL SEQUENCES." Doctoral diss., University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3859.

Full text

Abstract:

In 1939, I.M. Sheffer proved that every polynomial sequence belongs to one and only one $type$. Sheffer extensively developed properties of the $B$-\emph{Type 0} polynomial sequences and determined which sets are also orthogonal. He subsequently generalized his classification method to the case of arbitrary $B$-\emph{Type k} by constructing the generalized generating function $A(t)\mathrm=\sum_^\infty$, with $H_i(t)=h_t^i+h_t^+\cdots,\phantomh_\neq 0$. Although extensive research has been done on characterizing polynomial sequences, no analysis has yet been completed on sets of type one or hig

APA, Harvard, Vancouver, ISO, and other styles

12

Webb, Grayson. "Biorthogonal Polynomials." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-140733.

Full text

Abstract:

In this thesis we present some fundamental results regarding orthogonal polynomials and biorthogonal polynomials, the latter defined as in the article "Cauchy Biorthogonal Polynomials", authored by Bertola, Gekhtman, and Szmigielski. We show that total positivity of the kernel can be weakened and how this implies that interlacement for biorthogonal polynomials holds in general. A counterexample is provided showing that in general there does not exist a four-term recurrence relation such as the one found for the Cauchy kernel. As a direct consequence we show that biorthogonal polynomial sequenc

APA, Harvard, Vancouver, ISO, and other styles

13

Kirlar, Baris Bulent. "Elliptic Curve Pairing-based Cryptography." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612613/index.pdf.

Full text

Abstract:

In this thesis, we explore the pairing-based cryptography on elliptic curves from the theoretical and implementation point of view. In this respect, we first study so-called pairing-friendly elliptic curves used in pairing-based cryptography. We classify these curves according to their construction methods and study them in details. Inspired of the work of Koblitz and Menezes, we study the elliptic curves in the form $y^{2}=x^{3}-c$ over the prime field $F_{q}$ and compute explicitly the number of points $#E(mathbb{F}_{q})$. In particular, we show that the elliptic curve $y^{2}=x^{3}-1$ over

APA, Harvard, Vancouver, ISO, and other styles

14

Garapati, Kumar Vijay. "Structural Analysis of Poloidal and Toroidal Plasmons and Fields of Multilayer Nanorings." Scholar Commons, 2017. http://scholarcommons.usf.edu/etd/6843.

Full text

Abstract:

Multilayered metallo-dielectric nanoparticles are increasingly considered in various applications to control the spatial and temporal behavior of electromagnetic fields. In particular, the surface mode excitation by photons or electrons in metal nanorings finds significant applications because of the implied field distribution and electromagnetic energy confinement. However, most solid nanorings that are multilayered and/or embedded in a medium have non-simply connected geometry resulting in surface modes which are not linearly independent. That is, unlike particle plasmon eigenmodes in other

APA, Harvard, Vancouver, ISO, and other styles

15

Fransson, Jonas. "Lower ramification numbers of wildly ramified power series." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-35313.

Full text

Abstract:

In this thesis we study lower ramification numbers of power series tan- gent to the identity that are defined over fields of positive characteristics. Let f be such a series, then f has a fixed point at the origin and the corresponding lower ramification numbers of f are then, up to a constant, the multiplicity of zero as a fixed point of iterates of f. In this thesis we classify power series having ‘small’ ramification numbers. The results are then used to study ramification numbers of polynomials not tangent to the identity. We also state a few conjectures motivated by computer experiments t

APA, Harvard, Vancouver, ISO, and other styles

16

Phayal, Anup. "MASS FEARS, STRONG LEADERS AND THE RISK OF RENEWED CONFLICT: THREE ESSAYS ON POST-CONFLICT ELECTIONS." UKnowledge, 2016. http://uknowledge.uky.edu/polysci_etds/19.

Full text

Abstract:

Countries emerging out of armed conflicts face immense challenges in their efforts to build electoral democracies. Contrary to our intuition that elections can transform violent competition to peaceful political contests, past research suggests that holding post-conflict elections only increases the chance of renewed violence. Why are elections unable to build sustainable democracies as expected? In this dissertation, I examine the question by focusing on two levels of analysis. First, I study the effects of violence on political behavior of mass publics at the individual level using the World

APA, Harvard, Vancouver, ISO, and other styles

17

Benouahmane, Brahim. "Approximants de Padé et polynômes orthogonaux à deux variables." Rouen, 1992. http://www.theses.fr/1992ROUES051.

Full text

Abstract:

On construit les approximants de type Padé d'une série double en choisissant un polynôme arbitraire comme polynôme générateur de l'approximant. Comme dans le cas d'une variable on montre l'existence d'une liaison naturelle entre la théorie des polynômes orthogonaux et celle des approximants de Padé à deux variables en imposant des conditions supplémentaires sur les polynômes générateurs. Les polynômes orthogonaux par rapport à une fonctionnelle linéaire sont caractérisés par le fait qu'ils vérifient des relations de récurrences. D'autres algorithmes que ces relations pour calculer les approxim

APA, Harvard, Vancouver, ISO, and other styles

18

Duda, Rodrigo. "MATEMÁTICA FINANCEIRA E PLANILHAS ELETRÔNICAS: UMA ABORDAGEM COM A INCORPORAÇÃO DE RECURSOS COMPUTACIONAIS." UNIVERSIDADE ESTADUAL DE PONTA GROSSA, 2014. http://tede2.uepg.br/jspui/handle/prefix/1522.

Full text

Abstract:

Made available in DSpace on 2017-07-21T20:56:32Z (GMT). No. of bitstreams: 1 Rodrigo Duda.pdf: 3245133 bytes, checksum: 15c17194349c83759b9a18c4b36749a0 (MD5) Previous issue date: 2014-02-24<br>This paper has as its goal to propose a new alternative approach to the progressions and financial math teaching, with the incorporation of technological resources. Financial math is a theme of great relevance, since it is a field of direct application of various mathematical concepts studied throughout school education. One of the concepts that used is the study of geometric and arithmetic progressio

APA, Harvard, Vancouver, ISO, and other styles

19

Zozaya, Carole. "Déterminants des trajectoires de détresse pendant la première année qui suit l'annonce d'un cancer primitif ou récidivant." Thesis, Bordeaux 2, 2011. http://www.theses.fr/2011BOR21811/document.

Full text

Abstract:

Introduction. La détresse émotionnelle est inhérente au parcours du patient à qui l’on annonce un cancer primitif ou récidivant. Cette étude a deux objectifs fondamentaux : (1) identifier différentes trajectoires de détresse de patients présentant un cancer et (2) identifier et étudier les déterminants de ces trajectoires de détresse émotionnelle de ces patients de l’annonce d’un cancer primitif ou d’une récidive et durant les neuf mois de traitement qui suiventMéthode. 286 patients ont été évalués un mois, 3, 6 et 9 mois après le diagnostic de cancer. Les variables de personnalité (névrosisme

APA, Harvard, Vancouver, ISO, and other styles

20

Nunes, Josiani Batista. "Limitantes para os zeros de polinômios gerados por uma relação de recorrência de três termos /." São José do Rio Preto : [s.n.], 2009. http://hdl.handle.net/11449/94251.

Full text

Abstract:

Orientador: Eliana Xavier Linhares de Andrade<br>Banca: Alagacone Sri Ranga<br>Banca: Andre Piranhe da Silva<br>Resumo: Este trabalho trata do estudo da localização dos zeros dos polinômios gerados por uma determinada relação de recorrência de três termos. O objetivo principal é estudar limitantes, em termos dos coeficientes da relação de recorrência, para as regiões onde os zeros estão localizados. Os zeros são explorados atravé do problema de autovalor associado a uma matriz de Hessenberg. As aplicações são consideradas para polinômios de Szeg"o fSng, alguns polinômios para- ortogonais ½Sn(z

APA, Harvard, Vancouver, ISO, and other styles

21

Souza, Márcia Erondina Dias de. "UMA PROPOSTA DE ABORDAGEM AO PROBLEMA DE FLÁVIO JOSEFO APLICADA AO ENSINO MÉDIO." Universidade Federal de Santa Maria, 2013. http://repositorio.ufsm.br/handle/1/10935.

Full text

Abstract:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>In this paper, we presents a didactic sequence of activities designed for a group of students of high school, their age were about 15 and 18 years old, with the main objective to study the problem proposed by the mathematician Flávio Josefo, in mid-year 64. The legend tells that a group of rebels, including Flávio Josefo, was trapped in a cave by the enemy army. Preferring the suicide to capture, the rebels decided to form a circle and, counting over this, to kill each third person of the rest of the group. Josefo was contrary of t

APA, Harvard, Vancouver, ISO, and other styles

22

Silva, Andrea Piranhe da. "Um estudo dos zeros de polinômios ortogonais na reta real e no círculo unitário e outros polinômios relacionados." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-18122017-110406/.

Full text

Abstract:

O principal objetivo deste trabalho 6 estudar o comportamento dos zeros de polinômios ortogonais e similares. Inicialmente, consideramos uma relação entre duas sequências ele polinômios ortogonais, onde as medidas associadas estão relacionadas entre si. Usamos esta relação para estudar as propriedades de monotonicidade dos zeros dos polinômios ortogonais relacionados a uma medida obtida através da generalização da medida associada a uma outra sequência de polinômios ortogonais. Apresentamos, como exemplos, os polinômios ortogonais obtidos a partir da generalização das medidas associadas aos po

APA, Harvard, Vancouver, ISO, and other styles

23

Nunes, Josiani Batista [UNESP]. "Limitantes para os zeros de polinômios gerados por uma relação de recorrência de três termos." Universidade Estadual Paulista (UNESP), 2009. http://hdl.handle.net/11449/94251.

Full text

Abstract:

Made available in DSpace on 2014-06-11T19:26:56Z (GMT). No. of bitstreams: 0 Previous issue date: 2009-02-27Bitstream added on 2014-06-13T20:16:04Z : No. of bitstreams: 1 nunes_jb_me_sjrp.pdf: 1005590 bytes, checksum: 7da54a97a1f2ab452a315062071f2c4e (MD5)<br>Este trabalho trata do estudo da localização dos zeros dos polinômios gerados por uma determinada relação de recorrência de três termos. O objetivo principal é estudar limitantes, em termos dos coeficientes da relação de recorrência, para as regiões onde os zeros estão localizados. Os zeros são explorados atravé do problema de autovalor

APA, Harvard, Vancouver, ISO, and other styles

24

Hameurlain, Abdelkader. "L'inference dans les bases de donnees relationnelles." Toulouse 3, 1987. http://www.theses.fr/1987TOU30281.

Full text

Abstract:

Presentation des diverses methodes de traitement de requetes recursives. Des strategies d'optimisation sont etudiees et plusieurs facteurs influant les performances des methodes de traitement de requetes recursives sont mis en evidence. Une methode de traitement de requetes manipulant des relations virtuelles est proposee

APA, Harvard, Vancouver, ISO, and other styles

25

Moalla, Borhane. "Approximants de Padé, polynômes orthogonaux (cas matriciel)." Rouen, 1995. http://www.theses.fr/1995ROUES052.

Full text

Abstract:

Ce travail est consacré aux approximants de Padé. On commence par une amélioration du calcul des coefficients des polynômes orthogonaux par rapport à une fonctionnelle linéaire quelconque en utilisant la méthode Cestac de J. Vignes. On étend les notions d'approximants de Padé en deux points des séries formelles aux séries de fonctions. On étend également la méthode de C. Brezinski, pour l'estimation de l'erreur des approximants de Padé en un point dans le cas normal, au cas non normal et au cas des approximants de Padé en deux points. On étudie la stabilité et la convergence des formules de qu

APA, Harvard, Vancouver, ISO, and other styles

26

Ahmad, Khan Mumtaz, Khan Abdul Hakim, and Naeem Ahmad. "A study of modified Hermite polynomials of two variables." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/96096.

Full text

Abstract:

The present paper is a study of modied Hermite polynomials of two variables Hn(x; y; a) which for a = e reduces to Hermite polynomials of two variables Hn(x; y) due to M.A. Khan and G.S. Abukhammash.<br>El presente artculo se estudian polinomios modicados de Hermite de dos variables Hn(x; y; a) que para a = e se reducen a los polinomios de Hermite de dos variables Hn(x; y) introducidos por M.A. Khan y G.S.Abukhammash.

APA, Harvard, Vancouver, ISO, and other styles

27

Chuang, Ching-hui, and 莊淨惠. "Applications of recurrence relation." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/37146191241047135862.

Full text

Abstract:

碩士<br>國立中山大學<br>應用數學系研究所<br>95<br>Sequences often occur in many branches of applied mathematics. Recurrence relation is a powerful tool to characterize and study sequences. Some commonly used methods for solving recurrence relations will be investigated. Many examples with applications in algorithm, combination, algebra, analysis, probability, etc, will be discussed. Finally, some well-known contest problems related to recurrence relations will be addressed.

APA, Harvard, Vancouver, ISO, and other styles

28

Hsu, Ting, and 徐鼎. "Orthogonal polynomials and their recurrence relations." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/71594792130033652364.

Full text

Abstract:

碩士<br>國立中山大學<br>應用數學系研究所<br>104<br>It is well known that orthogonal polynomials satisfy some recurrence relations. In this thesis, we show that the converse is also valid. That is, if a monic polynomial sequence {P_{n}} with deg(P_{n}) = n satisfies a recurrence relation P_{n + 1}(x) = (x - α_{n})P_{n}(x) - β_{n}P_{n - 1}(x) for all n ∈ N ∪ {0}, and P_{-1}(x) = 0, P_{0}(x) = 1, then there exists some Borel measure μ on R such that the polynomials P_{n} are orthogonal with respect to μ. Moreover, we discuss the uniqueness of this measure, and also the true interval of orthogonality for the poly

APA, Harvard, Vancouver, ISO, and other styles

29

Engelbrecht, Kevin Peter. "Orthogonal polynomials and three-term recurrence relations." Thesis, 1991. http://hdl.handle.net/10539/22720.

Full text

Abstract:

A research report submitted to the Faculty of Science of the University of the Witwatersrand, in partial fufillment of the degree of Master of Science, Johannesburg 1991.<br>Orthogonal polynomials have had a long history. They have featured in the work of Legendre on planetary motion, continued fractions of Stieltjes, mechanical quadrature of Gauss etc. After the publication of 'Orthogonal Polynomials' by Gabor Szego in 1938 relatively little was published on orthogonal polynomials. This changed in the 1970's when increased interest in approximation theory brought about by the incredi

APA, Harvard, Vancouver, ISO, and other styles

30

Kumar, Yogesh. "Properties of cryptographic primitives : integer recurrence relations & permutations." Thesis, 2017. http://localhost:8080/xmlui/handle/12345678/7430.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

HSU, CHING-CHIH, and 許青之. "On a Study of Recurrence Relations of Some Statistic-Polynomials on 231-avoiding Permutations." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/5j9557.

Full text

Abstract:

碩士<br>國立屏東大學<br>應用數學系碩士班<br>107<br>We consider the bivariate polynomials of the 231-avoiding permutations with respect to major index and descent number, and make use a method of Dokos, Dwyer, johnson, Sagan, Selsor to prove a recurrence relation for the polynomials. We also consider the polynomials of the 231-avoiding permutations with respect to inversion number and the number of right-to-left minima. Then we use two methods to prove a recurrence relation for the polynomials in terms of Dyck paths and binary trees, respectively. Finally, we discuss a bijection between 231-avoiding permutatio

APA, Harvard, Vancouver, ISO, and other styles

32

Tzeng, Lynn Yuling, and 曾于綾. "From the External to the Internal: The Relation between Recurrent Images and Identity-crisis in Willa Cather’s My Ántonia." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/23015974836601583910.

Full text

Abstract:

碩士<br>輔仁大學<br>英國語文學系<br>95<br>As Willa Cather maintains, “The higher processes of art are all processes of simplification. The novelist must learn to write, and then he must unlearn it; just as the modern painter learns to draw, and then learns when utterly to disregard his accomplishment, when to subordinate it to a higher and truer effect.” (“The Novel” 48-9). What is essential is “the inexplicable presence of the thing not named” (50)—that “is there to the reader’s consciousness as much as if it were in type on the page” (Cather, On Writing 102). Whenever reading Willa Cather’s novels, espe

APA, Harvard, Vancouver, ISO, and other styles

33

黃振順. "A Pilot Study of Trigger-based Animated Instructional Design ---Recurrence Relation for High School Mathematics." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/10594518041049719366.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Andrews, Emad Abdel-Thalooth. "Inferring Genetic Regulatory Networks Using Cost-based Abduction and Its Relation to Bayesian Inference." Thesis, 2014. http://hdl.handle.net/1807/65634.

Full text

Abstract:

Inferring Genetic Regulatory Networks (GRN) from multiple data sources is a fundamental problem in computational biology. Computational models for GRN range from simple Boolean networks to stochastic differential equations. To successfully model GRN, a computational method has to be scalable and capable of integrating different biological data sources effectively and homogeneously. In this thesis, we introduce a novel method to model GRN using Cost-Based Abduction (CBA) and study the relation between CBA and Bayesian inference. CBA is an important AI formalism for reasoning under uncertainty t

APA, Harvard, Vancouver, ISO, and other styles

35

Chen, Wei-Shin, and 陳緯新. "The Relation between the Persistence and the Stock Return of Recurring Nonrecurring Items－Evidence form Listed Firms in Taiwan." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/06504557402420694602.

Full text

Abstract:

碩士<br>國立臺灣大學<br>會計學研究所<br>100<br>Generally speaking, we call the earnings which are unusual in nature or infrequency of occurrence as “nonrecurring items.” The nonrecurring items consist of three components: (1) extraordinary items, (2) discontinued operations and (3) special items. Recently, many of the prior literatures and the financial press are replete with articles addressing the increased incidence of repetitive nonrecurring items, among which special items are most serious. In Taiwan stock market, special items recognized by the listed firms have increased since 1991. Cready et al. (20

APA, Harvard, Vancouver, ISO, and other styles

36

de, Zwart Francesco. "Predicting firm sustainability through governance: the relational corporate governance approach." Thesis, 2014. http://hdl.handle.net/2440/85505.

Full text

Abstract:

The relational corporate governance approach presented in this thesis is a tool which complements and enhances the explanatory power of the existing principal ‘law and economics’ theories and models of the firm. It maps the effectiveness of corporate Governance Variables in use in corporate Governance Codes and laws around the world and assesses reform proposals in the field. The approach can be used by regulators, policymakers, law reformers and corporate actors as a diagnostic tool to analyse the governance health of individual companies and the governance actions required to remedy sub-opti

APA, Harvard, Vancouver, ISO, and other styles

37

BILOTTA, STEFANO. "Pattern avoiding words and cross-bifix-free sets: a general approach." Doctoral thesis, 2013. http://hdl.handle.net/2158/804481.

Full text

Abstract:

In this thesis we determine an algorithmic unified approach, based on the concept of succession rule, for the construction and the enumeration, according to the number of ones, of binary words in {0, 1} having the number of 1’s greater than or equal to the number of 0’s, and which can be applied to any forbidden pattern. Moreover, we extend this approach to the class of binary words in {0, 1} having the number of 1’s greater than or equal to the number of 0’s, and avoiding a set of forbidden patterns. In the second line of research, succession rules are studied posing a specific relevance o

APA, Harvard, Vancouver, ISO, and other styles

38

McLellan, Karyn Anne. "Periodic Coefficients and Random Fibonacci Sequences." 2012. http://hdl.handle.net/10222/15381.

Full text

Abstract:

The random Fibonacci sequence is defined by t_1 = t_2 = 1 and t_n = ± t_{n–1} + t_{n–2} , for n ? 3, where each ± sign is chosen at random with P(+) = P(–) = 1/2. We can think of all possible such sequences as forming a binary tree T. Viswanath has shown that almost all random Fibonacci sequences grow exponentially at the rate 1.13198824.... He was only able to find 8 decimal places of this constant through the use of random matrix theory and a fractal measure, although Bai has extended the constant by 5 decimal places. Numerical experimentation is inefficient because the convergence is so

APA, Harvard, Vancouver, ISO, and other styles

39

NDIKUBWAYO, INNOCENT. "Topics in polynomial sequences defined by linear recurrences." Licentiate thesis, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-176124.

Full text

Abstract:

This licentiate consists of two papers treating polynomial sequences defined by linear recurrences. In paper I, we establish necessary and sufficient conditions for the reality of all the zeros in a polynomial sequence {P_i} generated by a three-term recurrence relation P_i(x)+ Q_1(x)P_{i-1}(x) +Q_2(x) P_{i-2}(x)=0 with the standard initial conditions P_{0}(x)=1, P_{-1}(x)=0, where Q_1(x) and Q_2(x) are arbitrary real polynomials. In paper II, we study the root distribution of a sequence of polynomials {P_n(z)} with the rational generating function \sum_{n=0}^{\infty} P_n(z)t^n= \frac{1}{1+ B(

APA, Harvard, Vancouver, ISO, and other styles

40

Aghaebrahimian, Ahmad. "Hybridní hluboké metody pro automatické odpovídání na otázky." Doctoral thesis, 2019. http://www.nusl.cz/ntk/nusl-393809.

Full text

Abstract:

Title: Hybrid Deep Question Answering Author: Ahmad Aghaebrahimian Institute: Institute of Formal and Applied Linguistics Supervisor: RNDr. Martin Holub, Ph.D., Institute of Formal and Applied Lin- guistics Abstract: As one of the oldest tasks of Natural Language Processing, Question Answering is one of the most exciting and challenging research areas with lots of scientific and commercial applications. Question Answering as a discipline in the conjunction of computer science, statistics, linguistics, and cognitive science is concerned with building systems that automatically retrieve answers

APA, Harvard, Vancouver, ISO, and other styles

41

BŘEZINOVÁ, Jiřina. "Kombinatorické principy ve školské matematice." Master's thesis, 2010. http://www.nusl.cz/ntk/nusl-54458.

Full text

Abstract:

The thesis includes delatiled explanation of combinatorial principles used in school mathematics. The single principles are explained in details and practicised. The tasks at the end of the chapter serve readers for testing acquired knoledge.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!