Gotowa bibliografia na temat „Infinite”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Infinite”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Infinite"
Деев, Г. Е., i С. В. Ермаков. "Bi-Infinite Calculating Automaton". Успехи кибернетики / Russian Journal of Cybernetics, nr 3(11) (30.09.2022): 52–62. http://dx.doi.org/10.51790/2712-9942-2022-3-3-6.
Pełny tekst źródłaHolub, Štěpán. "Words with unbounded periodicity complexity". International Journal of Algebra and Computation 24, nr 06 (wrzesień 2014): 827–36. http://dx.doi.org/10.1142/s0218196714500362.
Pełny tekst źródłaLove, William P. "Infinity: The Twilight Zone of Mathematics". Mathematics Teacher 82, nr 4 (kwiecień 1989): 284–92. http://dx.doi.org/10.5951/mt.82.4.0284.
Pełny tekst źródłaFriedlander, Alex. "Stories about Never-Ending Sums". Mathematics Teaching in the Middle School 15, nr 5 (grudzień 2009): 274–80. http://dx.doi.org/10.5951/mtms.15.5.0274.
Pełny tekst źródłaWood, Daniel A. "On the Implications of the Idea of Infinity for Postmodern Fundamental Theology". Pacifica: Australasian Theological Studies 25, nr 1 (luty 2012): 67–81. http://dx.doi.org/10.1177/1030570x1202500106.
Pełny tekst źródłaKatz, Mikhail, David Sherry i Monica Ugaglia. "When Does a Hyperbola Meet Its Asymptote? Bounded Infinities, Fictions, and Contradictions in Leibniz". Revista Latinoamericana de Filosofía 49, nr 2 (9.11.2023): 241–58. http://dx.doi.org/10.36446/rlf2023359.
Pełny tekst źródłaBurgin, Mark. "Introduction to Hyperspaces". International Journal of Pure Mathematics 7 (8.02.2021): 36–42. http://dx.doi.org/10.46300/91019.2020.7.5.
Pełny tekst źródłaStrydom, Piet. "Infinity, infinite processes and limit concepts". Philosophy & Social Criticism 43, nr 8 (29.08.2017): 793–811. http://dx.doi.org/10.1177/0191453717692845.
Pełny tekst źródłaSabatier, Jocelyn. "Fractional Order Models Are Doubly Infinite Dimensional Models and thus of Infinite Memory: Consequences on Initialization and Some Solutions". Symmetry 13, nr 6 (21.06.2021): 1099. http://dx.doi.org/10.3390/sym13061099.
Pełny tekst źródłaMagnot, Jean-Pierre. "The Mean Value for Infinite Volume Measures, Infinite Products, and Heuristic Infinite Dimensional Lebesgue Measures". Journal of Mathematics 2017 (2017): 1–14. http://dx.doi.org/10.1155/2017/9853672.
Pełny tekst źródłaRozprawy doktorskie na temat "Infinite"
Widmer, Steven. "Topics in word complexity". Thesis, Lyon 1, 2010. http://www.theses.fr/2010LYO10287/document.
Pełny tekst źródłaThe main topics of interest in this thesis will be two types of complexity, abelian complexity and permutation complexity. Abelian complexity has been investigated over the past decades. Permutation complexity is a relatively new type of word complexity which investigates lexicographical ordering of shifts of an aperiodic word. We will investigate two topics in the area of abelian complexity. Firstly we will consider an abelian variation of maximal pattern complexity. Secondly we consider an upper bound for words with the C-balance property. In the area of permutation complexity, we compute the permutation complexity function for a number of words. A formula for the complexity of Thue-Morse word is established by studying patterns in subpermutations and the action of the Thue-Morse morphism on the subpermutations. We then give a method to calculate the complexity of the image of certain words under the doubling map. The permutation complexity function of the image of the Thue-Morse word under the doubling map and the image of a Sturmian word under the doubling map are established
Wierst, Pauline Manninne Anna van. "Paradoxes of the applied infinite : infinite idealizations in Physics". Doctoral thesis, Scuola Normale Superiore, 2018. http://hdl.handle.net/11384/86153.
Pełny tekst źródłaYe, Jinglong. "Infinite semipositone systems". Diss., Mississippi State : Mississippi State University, 2009. http://library.msstate.edu/etd/show.asp?etd=etd-07072009-132254.
Pełny tekst źródłaHernon, Hiatt K. "INFINITE JEST 2". Ohio University Honors Tutorial College / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ouhonors1526633419508737.
Pełny tekst źródłaAurand, Eric William. "Infinite Planar Graphs". Thesis, University of North Texas, 2000. https://digital.library.unt.edu/ark:/67531/metadc2545/.
Pełny tekst źródłaPenrod, Keith. "Infinite product groups /". Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1977.pdf.
Pełny tekst źródłaPenrod, Keith G. "Infinite Product Group". BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/976.
Pełny tekst źródłaMiraftab, Babak [Verfasser], i Reinhard [Akademischer Betreuer] Diestel. "On infinite graphs and infinite groups / Babak Miraftab ; Betreuer: Reinhard Diestel". Hamburg : Staats- und Universitätsbibliothek Hamburg, 2019. http://d-nb.info/1196295921/34.
Pełny tekst źródłaLemonidis, Panayiotis. "Global optimization algorithms for semi-infinite and generalized semi-infinite programs". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/43200.
Pełny tekst źródłaIncludes bibliographical references (p. 235-249).
The goals of this thesis are the development of global optimization algorithms for semi-infinite and generalized semi-infinite programs and the application of these algorithms to kinetic model reduction. The outstanding issue with semi-infinite programming (SIP) was a methodology that could provide a certificate of global optimality on finite termination for SIP with nonconvex functions participating. We have developed the first methodology that can generate guaranteed feasible points for SIP and provide e-global optimality on finite termination. The algorithm has been implemented in a branch-and-bound (B&B) framework and uses discretization coupled with convexification for the lower bounding problem and the interval constrained reformulation for the upper bounding problem. Within the framework of SIP we have also proposed a number of feasible-point methods that all rely on the same basic principle; the relaxation of the lower-level problem causes a restriction of the outer problem and vice versa. All these methodologies were tested using the Watson test set. It was concluded that the concave overestimation of the SIP constraint using McCormcick relaxations and a KKT treatment of the resulting expression is the most computationally expensive method but provides tighter bounds than the interval constrained reformulation or a concave overestimator of the SIP constraint followed by linearization. All methods can work very efficiently for small problems (1-3 parameters) but suffer from the drawback that in order to converge to the global solution value the parameter set needs to subdivided. Therefore, for problems with more than 4 parameters, intractable subproblems arise very high in the B&B tree and render global solution of the whole problem infeasible.
(cont.) The second contribution of the thesis was the development of the first finite procedure that generates guaranteed feasible points and a certificate of e-global optimality for generalized semi-infinite programs (GSIP) with nonconvex functions participating. The algorithm employs interval extensions on the lower-level inequality constraints and then uses discretization and the interval constrained reformulation for the lower and upper bounding subproblems, respectively. We have demonstrated that our method can handle the irregular behavior of GSIP, such as the non-closedness of the feasible set, the existence of re-entrant corner points, the infimum not being attained and above all, problems with nonconvex functions participating. Finally, we have proposed an extensive test set consisting of both literature an original examples. Similar to the case of SIP, to guarantee e-convergence the parameter set needs to be subdivided and therefore, only small examples (1-3 parameters) can be handled in this framework in reasonable computational times (at present). The final contribution of the thesis was the development of techniques to provide optimal ranges of valid reduction between full and reduced kinetic models. First of all, we demonstrated that kinetic model reduction is a design centering problem and explored alternative optimization formulations such as SIP, GSIP and bilevel programming. Secondly, we showed that our SIP and GSIP techniques are probably not capable of handling large-scale systems, even if kinetic model reduction has a very special structure, because of the need for subdivision which leads to an explosion in the number of constraints. Finally, we propose alternative ways of estimating feasible regions of valid reduction using interval theory, critical points and line minimization.
by Panayiotis Lemonidis.
Ph.D.
Miraftab, Babak Verfasser], i Reinhard [Akademischer Betreuer] [Diestel. "On infinite graphs and infinite groups / Babak Miraftab ; Betreuer: Reinhard Diestel". Hamburg : Staats- und Universitätsbibliothek Hamburg, 2019. http://nbn-resolving.de/urn:nbn:de:gbv:18-99812.
Pełny tekst źródłaKsiążki na temat "Infinite"
W, Moore A. The infinite. London: Routledge, 1990.
Znajdź pełny tekst źródłaBianco, Gabriella. Infinitas lunas, infinitos soles: Autobiografía literaria y poética = infinite moons, infinite suns. Buenos Aires: Editorial Dunken, 2010.
Znajdź pełny tekst źródłaWallace, David Foster. Everything and more: A compact history of infinity. New York: Atlas Book, 2010.
Znajdź pełny tekst źródłaShih, Cheng-yen. Infinite teachings, infinite meanings. Redaktorzy Jing Si Publications i Tzu Chi Publisitorial Team. Taipei: Jing Si Publications Co., Ltd., 2015.
Znajdź pełny tekst źródłaMeadows, Jodi. Infinite. New York: Katherine Tegen Books/HarperCollins, 2014.
Znajdź pełny tekst źródłaFabian, Karina L. Infinite space, infinite God II. Kingsport, Tenn: Twilight Times Books, 2010.
Znajdź pełny tekst źródłaInfinitas lunas, infinitos soles: Infinite Moons, Infinite Suns. Argentina: Editorial Dunken - Buenos Aires, 2010.
Znajdź pełny tekst źródłaBrown, E., i Marian Osborne. Infinite Infinity Omnibus. Independently Published, 2019.
Znajdź pełny tekst źródłaGrignolo, Maura. Infinite Volte Infinito. Independently Published, 2017.
Znajdź pełny tekst źródłaGrignolo, Maura. Infinite Volte Infinito. Independently Published, 2017.
Znajdź pełny tekst źródłaCzęści książek na temat "Infinite"
Martín-Vide, Carlos. "Infinitely Many Infinities". W Finite Versus Infinite, 217–30. London: Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0751-4_14.
Pełny tekst źródłaMilner, E. C. "Infinite Sets and Infinite Graphs". W Graphs and Order, 559–65. Dordrecht: Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-009-5315-4_22.
Pełny tekst źródłaPólya, George, i Gabor Szegö. "Infinite Series and Infinite Sequences". W Problems and Theorems in Analysis I, 173–229. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-642-61983-0_16.
Pełny tekst źródłaProtter, Murray H., i Charles B. Morrey. "Infinite Sequences and Infinite Series". W A First Course in Real Analysis, 211–62. New York, NY: Springer New York, 1991. http://dx.doi.org/10.1007/978-1-4419-8744-0_9.
Pełny tekst źródłaChen, Yiyun, i Michael J. O'Donnell. "Infinite terms and infinite rewritings". W Conditional and Typed Rewriting Systems, 115–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54317-1_84.
Pełny tekst źródłaTurner, Pamela Taylor. "Auspicious Beginnings". W Infinite Animation, 1–17. Boca Raton, FL : CRC Press, Taylor & Francis Group, 2019.: CRC Press, 2019. http://dx.doi.org/10.1201/9781351209397-1.
Pełny tekst źródłaTurner, Pamela Taylor. "Transitions". W Infinite Animation, 19–41. Boca Raton, FL : CRC Press, Taylor & Francis Group, 2019.: CRC Press, 2019. http://dx.doi.org/10.1201/9781351209397-2.
Pełny tekst źródłaTurner, Pamela Taylor. "The “Idealistic Young Mystic” at Antioch College". W Infinite Animation, 43–57. Boca Raton, FL : CRC Press, Taylor & Francis Group, 2019.: CRC Press, 2019. http://dx.doi.org/10.1201/9781351209397-3.
Pełny tekst źródłaTurner, Pamela Taylor. "Two Letters and a New School". W Infinite Animation, 59–89. Boca Raton, FL : CRC Press, Taylor & Francis Group, 2019.: CRC Press, 2019. http://dx.doi.org/10.1201/9781351209397-4.
Pełny tekst źródłaTurner, Pamela Taylor. "The Evolving Artist in Eden". W Infinite Animation, 91–110. Boca Raton, FL : CRC Press, Taylor & Francis Group, 2019.: CRC Press, 2019. http://dx.doi.org/10.1201/9781351209397-5.
Pełny tekst źródłaStreszczenia konferencji na temat "Infinite"
Hazelden, K. "Infinite Infants". W Visual Languages and Human-Centric Computing (VL/HCC'06). IEEE, 2006. http://dx.doi.org/10.1109/vlhcc.2006.26.
Pełny tekst źródłaNagao, Ryohei, Keigo Matsumoto, Takuji Narumi, Tomohiro Tanikawa i Michitaka Hirose. "Infinite stairs". W SIGGRAPH '17: Special Interest Group on Computer Graphics and Interactive Techniques Conference. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3084822.3084838.
Pełny tekst źródłaTsuchiya, A., T. Eguchi i M. Jimbo. "Infinite Analysis". W RIMS PROJECT 1991. WORLD SCIENTIFIC, 1992. http://dx.doi.org/10.1142/9789812798282.
Pełny tekst źródłaMikesh, Elizabeth, i Barba Aldis Patton. "Infinite Learning". W London International Conference on Education. Infonomics Society, 2021. http://dx.doi.org/10.20533/lice.2021.0012.
Pełny tekst źródłaDeng, Xiaotie, i Sanjeev Mahajan. "Infinite games". W the twenty-third annual ACM symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/103418.103451.
Pełny tekst źródłaHo, Xavier, i Stephen Krol. "Infinite Colours". W SA Art Gallery '23: ACM SIGGRAPH Asia 2023 Art Gallery. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3610537.3622958.
Pełny tekst źródłaBozinovski, Stevo, i Adrijan Bozinovski. "Artificial Intelligence and infinity: Infinite series generated by Turing Machines". W SoutheastCon 2017. IEEE, 2017. http://dx.doi.org/10.1109/secon.2017.7925371.
Pełny tekst źródłaKhlopin, Dmitry. "On boundary conditions at infinity for infinite horizon control problem". W 2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA). IEEE, 2017. http://dx.doi.org/10.1109/cnsa.2017.7973969.
Pełny tekst źródłaMartins, Pedro Henrique, Zita Marinho i Andre Martins. "∞-former: Infinite Memory Transformer-former: Infinite Memory Transformer". W Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Stroudsburg, PA, USA: Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.acl-long.375.
Pełny tekst źródłaInoue, Seiichi, Mamoru Komachi, Toshinobu Ogiso, Hiroya Takamura i Daichi Mochihashi. "Infinite SCAN: An Infinite Model of Diachronic Semantic Change". W Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing. Stroudsburg, PA, USA: Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.emnlp-main.104.
Pełny tekst źródłaRaporty organizacyjne na temat "Infinite"
Choi, Sun Young. Infinite symmetry. Ames: Iowa State University, Digital Repository, wrzesień 2016. http://dx.doi.org/10.31274/itaa_proceedings-180814-1591.
Pełny tekst źródłaHu, Hui. Semi-Infinite Programming. Fort Belvoir, VA: Defense Technical Information Center, marzec 1989. http://dx.doi.org/10.21236/ada207403.
Pełny tekst źródłaNagle, J. On Packet Switches With Infinite Storage. RFC Editor, grudzień 1985. http://dx.doi.org/10.17487/rfc0970.
Pełny tekst źródłaChristey, S. The Infinite Monkey Protocol Suite (IMPS). RFC Editor, kwiecień 2000. http://dx.doi.org/10.17487/rfc2795.
Pełny tekst źródłaMaqsood, Elham, i King Abdul. Alom wa Ebnatoha in Infinite Blue. Ames: Iowa State University, Digital Repository, 2014. http://dx.doi.org/10.31274/itaa_proceedings-180814-987.
Pełny tekst źródłaFreyberger, Joachim, i Matthew Masten. Compactness of infinite dimensional parameter spaces. Institute for Fiscal Studies, styczeń 2016. http://dx.doi.org/10.1920/wp.cem.2016.0116.
Pełny tekst źródłaKocherlakota, Narayana. Infinite Debt Rollover in Stochastic Economies. Cambridge, MA: National Bureau of Economic Research, sierpień 2022. http://dx.doi.org/10.3386/w30409.
Pełny tekst źródłaDemkowicz, L., i Jie Shen. A Few New (?) Facts About Infinite Elements. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2005. http://dx.doi.org/10.21236/ada437980.
Pełny tekst źródłaSandstede, Bjorn. Geometric Methods for Infinite-Dimensional Dynamical Systems. Fort Belvoir, VA: Defense Technical Information Center, sierpień 2012. http://dx.doi.org/10.21236/ada566477.
Pełny tekst źródłaIto, K., i F. Kappel. Approximation of Infinite Delay and Volterra Type Equations. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1986. http://dx.doi.org/10.21236/ada177116.
Pełny tekst źródła