نتایج جستجو برای: actual infinity

تعداد نتایج: 141216  

1996
Aaron Sloman

This is a philosophical ‘position paper’, starting from the observation that we have an intuitive grasp of a family of related concepts of “possibility”, “causation” and “constraint” which we often use in thinking about complex mechanisms, and perhaps also in perceptual processes, which according to Gibson are primarily concerned with detecting positive and negative affordances, such as support...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اراک - دانشکده علوم انسانی 1389

abstract this study examines the relationship between reading anxiety and difficulty of texts as well as the relationship between reading anxiety and students perceived difficulty of the texts. since difficulty is a relative concept, i limited its definition by sticking to the readability formula. we also took students perceived difficulty levels into account. therefore, in the present study, ...

2009
Jessica Kiefer

This thesis explores the use and accuracy of several discrete-time image filters for the purpose of target tracking in Synthetic Aperture Radar imagery. Both extended targets and point targets are used for tracking, showing the need for different types of filters for each target type. Monte Carlo analysis is performed on the results of the extended target filter results to determine the absolut...

Journal: :Notre Dame Journal of Formal Logic 1977
Robert H. Cowen

1 Introduction D. Kόnig's famous lemma on trees has many applications; in graph theory it is used to extend certain results from finite to infinite graphs (see Nash-Williams [7]); in logic it can be used to prove that a denumerable set of propositional formulas is satisfiable if every finite subset is (see, for example, Van Fraassen [9]). This last result, known as the compactness theorem for p...

2004
Janne Lindqvist

Routing protocols have to deal with a known problem: the count-to-infinity. Counting to infinity can occur when a link breaks in the network, and the algorithm in the routing protocol tries to calculate new shortest paths. In this paper I survey the past and present solutions to the this problem.

Journal: :CoRR 2017
Ines Klimann

We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton. The study on how (semi)groups grow has been highlighted since Milnor’s question on the existence of groups of intermediate...

1999
Kyoko Makino Martin Berz

An overview over the features of version 7 of the code COSY INFINITY is given. Currently distributed to about 160 registered users, the code allows the computation and manipulation of maps of arbitrary order for arbitrary arrangements of elds. Besides the conventional analysis tools including various techniques for symplectic tracking, normal form methods, hardware and reconstructive aberration...

Journal: :Insurance Mathematics & Economics 2021

This paper considers linear fair risk sharing rules and the conditional mean rule for independent but heterogeneous losses that are gathered in an insurance pool. It studies asymptotic behavior of individual contributions to total when number participants pool tends infinity. is shown (i) at pure premium obtained infinitely large (ii) difference between actual contribution becomes ultimately No...

1999
Kyoko Makino Martin Berz

The latest version of the particle optics code COSY INFINITY is presented. Using Di!erential Algebraic (DA) methods, the code allows the computation of aberrations of arbitrary "eld arrangements to in principle unlimited order. Besides providing a general overview of the code, several recent techniques developed for speci"c applications are highlighted. These include new features for the direct...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید