Academic literature on the topic 'Splajny'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Splajny.'
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.
Journal articles on the topic "Splajny"
Zellma, Marek, and Agata Załęska-Fornal. "Application of B Splines to Identifi cation of the Movement Equations of the Floating Objects." Naše more 68, no. 1 (February 2021): 58–64. http://dx.doi.org/10.17818/nm/2021/1.7.
Full textKAN KILINÇ, Betül, and Huruy DEBESSAY ASFHA. "Selection of Splines Models in the Presence of Multicollinearity and Outliers." Turkiye Klinikleri Journal of Biostatistics 12, no. 2 (2020): 183–92. http://dx.doi.org/10.5336/biostatic.2020-74122.
Full textGascoyne, Sue. "Squelchy pies and splatty cakes." Child Care 10, no. 10 (October 2013): 8–9. http://dx.doi.org/10.12968/chca.2013.10.10.8.
Full textAshford, Elizabeth. "A Response to Splawn." Utilitas 13, no. 3 (November 2001): 334–41. http://dx.doi.org/10.1017/s0953820800003216.
Full textBuchel'nikov, Vasilii D., Aleksandr N. Vasil'ev, V. V. Koledov, S. V. Taskaev, V. V. Khovailo, and Vladimir G. Shavrov. "Magnetic shape-memory alloys: phase transitions and functional properties." Uspekhi Fizicheskih Nauk 176, no. 8 (2006): 900. http://dx.doi.org/10.3367/ufnr.0176.200608j.0900.
Full textTsoy, V. I. "Splay-splay transition in bistable nematic liquid crystals." Technical Physics 47, no. 1 (January 2002): 34–37. http://dx.doi.org/10.1134/1.1435887.
Full textEnserink, Martin. "Holland's giant wavemaker has splashy debut." Science 350, no. 6256 (October 1, 2015): 21. http://dx.doi.org/10.1126/science.350.6256.21.
Full textEnsign, David E., and James S. Bowman. "New Ethics Journal Makes Splashy Debut." Public Administration Review 57, no. 1 (January 1997): 92. http://dx.doi.org/10.2307/976697.
Full textPowell, E., A. M. Anch, J. Dyche, C. Bloom, and R. R. Richter. "The Splay Angle." Physiology & Behavior 67, no. 5 (November 1999): 819–21. http://dx.doi.org/10.1016/s0031-9384(99)00127-4.
Full textHeidarzadeh, Mohammad, Takeo Ishibe, Tomoya Harada, Danny Hilman Natawidjaja, Ignatius Ryan Pranantyo, and Bayu Triyogo Widyantoro. "High Potential for Splay Faulting in the Molucca Sea, Indonesia: November 2019 Mw 7.2 Earthquake and Tsunami." Seismological Research Letters 92, no. 5 (April 14, 2021): 2915–26. http://dx.doi.org/10.1785/0220200442.
Full textDissertations / Theses on the topic "Splajny"
Antas, Vilém. "Yield Curve Constructions." Master's thesis, Vysoká škola ekonomická v Praze, 2016. http://www.nusl.cz/ntk/nusl-264627.
Full textŠpiřík, Jan. "Modul pro generování "atomů" pro přeparametrizovanou reprezentaci signálu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218234.
Full textOchulo, Ikechi. "Optimalizace tvaru mazací mezery hydrodynamického ložiska." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-451223.
Full textKlimeš, Ondřej. "Komprimované vzorkování pro efektivní sledování objektu senzorovou sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2019. http://www.nusl.cz/ntk/nusl-400432.
Full textSayed, Hassan Adelyar. "The Complexity of Splay Trees and Skip Lists." Thesis, University of the Western Cape, 2008. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_6858_1263424080.
Full textOur main results are that splay trees are faster for sorted insertion, where AVL trees are faster for random insertion. For searching, skip lists are faster than single class top-down splay trees, but two-class and multi-class top-down splay trees can behave better than skip lists.
Nesky, Amy Lynn. "Stability of Splay States in Coupled Oscillator Networks." Thesis, Boston College, 2013. http://hdl.handle.net/2345/3022.
Full textThere are countless occurrences of oscillating systems in nature. Climate cycles and planetary orbits are a few that humans experience daily. Man has also incorporated, to his benefit, oscillation into his craft; the grandfather clock, for example, can keep track of time with astounding accuracy using the period of a long pendulum. Such systems can range in complexity in a number of ways. The governing equation for a given oscillator could be as simple as a sine curve, or its motion could appear so erratic that oscillatory motion is undetectable to viewers. The number of oscillators in a system can also vary, and oscillators can be coupled; that is, oscillators can be affected by the motion of neighboring oscillators. It is this last case we wish to study. We will briefly look at the case of finitely many oscillators and then move to analyzing a model consisting of infinitely many identical oscillators. Synchrony is the simplest collective behavior. We will study a more complicated pattern called splay states in which oscillators are equally staggered in phase, i.e. phase locked such that the system will return to this pattern if it is disturbed by an arbitrarily small amount. Mathematically, this requires us to find attracting fixed points in the system. We will approximate the local behavior of our model by linearizing the system near its fixed points. We will then apply our findings to a few specific cases of such models including: uniform density, linear distribution, alpha-function pulses, and integrate-and-fire
Thesis (BS) — Boston College, 2013
Submitted to: Boston College. College of Arts and Sciences
Discipline: College Honors Program
Discipline: Mathematics
Esposito, Christopher. "Differential Sedimentation In A Mississippi River Crevasse Splay." ScholarWorks@UNO, 2011. http://scholarworks.uno.edu/td/1308.
Full textDavis, Leena. "Architecture of Deep-Marine Interchannel Deposits: Isaac Formation, Windermere Supergroup (Neoproterozoic), Southern Canadian Cordillera." Thesis, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19756.
Full textKrejčík, Jan. "Funkce Sinumeriku Operate při programování CNC obráběcích strojů." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-444266.
Full textHolanda, Pedro Thiago Timbó. "SPST-Index : a self pruning splay tree index for database cracking." reponame:Repositório Institucional da UFPR, 2017. http://hdl.handle.net/1884/46126.
Full textDissertação (mestrado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa: Curitiba, 24/02/2017
Inclui referências : f. 41-43
Área de concentração: Ciência da computação
Resumo: Em Database Cracking, uma coluna de banco de dados se organiza fisicamente, de maneira autônoma, em partições, um índice é então criado para otimizar o acesso a essas partições. A árvore AVL é a estrutura de dados utilizada para implementar esse índice. Contudo, em termos de cache, ela é particularmente ineficiente para consultas de intervalos, já que seus nós acessados apenas algumas vezes e os nós frequentemente acessados estão espalhados por toda a árvore. Esse trabalho apresenta a Self-Pruning Splay Tree (SPST) que é uma estrutura de dados capaz de reorganizar os dados mais e menos acessados, melhorando o tempo de acesso para as partições mais acessadas. Para cada consulta de intervalo, a SPST rotaciona para a raiz os nós que apontam para os valores do predicado da consulta e o valor médio do intervalo. Eventualmente, os nós mais acessados da árvore irão permanecer próximos a raíz, melhorando a utilização da CPU e a atividade de cache. Os nós menos acessados permanecerão próximos às folhas e serão removidos para limparmos dados que não são utilizados, diminuindo o tamanho do índice e obtendo custos de leitura e atualização menores. Palavras-chave: Database Cracking, Índice para Cracking , Árvore Splay.
Abstract: In database cracking, a database is physically self-organized into cracked partitions with cracker indices boosting the access to these partitions. The AVL Tree is the current data structure of choice to implement cracker indices. However, it is particularly cache-inefficient for range queries, because the nodes accessed only for a few times (i.e, "Cold Data") and the most accessed ones (i.e, "Hot Data") are spread all over the index. This work presents the Self-Pruning Splay Tree (SPST) data structure to index database cracking and reorganize "Hot Data" and "Cold Data" to boost the access to the cracked partitions. To every range query, the SPST rotates to the root the nodes pointing to the edges and to the middle value of the predicate interval. Eventually, the most accessed tree nodes remain close to the root improving CPU and cache activity. On the other hand, the least accessed tree nodes remain close to the leaves and are pruned to clean up unused data in order to diminish the storage footprint with significant improvements: smaller lookup/update costs. Keywords: Database Cracking, Cracker Index, Splay Tree.
Books on the topic "Splajny"
Zavʹi͡alov, I͡Uriĭ Semenovich. Splaĭny v inzhenernoĭ geometrii. Moskva: "Mashinostroenie", 1985.
Find full textSvinʹin, S. F. Bazisnye splaĭny v teorii otschetov signalov. Sankt-Peterburg: Nauka, 2003.
Find full textBlackaby, Susan. Splishy, splashy mammals. Columbus, Ohio: School Specialty Pub., 2007.
Find full textill, Ewers Joe, and Children's Television Workshop, eds. Splish-splashy day. [Racine, Wis.]: Western Pub. Co. in conjunction with Children's Television Workshop, 1989.
Find full textKechin, V. A. T͡S︡inkovye splavy. Moskva: "Metallurgii͡a︡", 1986.
Find full textZavʹi︠a︡lov, I︠U︡riĭ Semenovich, and V. L. Miroshnichenko. Splaĭny i ikh prilozhenii︠a︡: Sbornik nauchnykh trudov. Novosibirsk: Rossiĭskai︠a︡ akademii︠a︡ nauk, Sibirskoe otd-nie, In-t matematiki im. S.L. Soboleva, 1995.
Find full textK, Demʹi͡anovich I͡U. Lokalʹnai͡a approksimat͡sii͡a na mnogoobrazii i minimalʹnye splaĭny. Sankt-Peterburg: Izd-vo S.-Peterburgskogo universiteta, 1994.
Find full textIgnatov, M. I. Naturalʹnye splaĭny mnogikh peremennykh. Leningrad: "Nauka," Leningradskoe otd-nie, 1991.
Find full textMalozemov, V. N. Polinomialʹnye splaĭny: Uchebnoe posobie. Leningrad: Izd-vo Leningradskogo universiteta, 1986.
Find full textErzhanova, M. S. Splavnye katalizatory gidrogenizat͡s︡ii furfurola. Alma-Ata: Gylym, 1992.
Find full textBook chapters on the topic "Splajny"
Kerkstra, Randy, and Steve Brammer. "Splay." In Injection Molding Advanced Troubleshooting Guide, 413–29. München: Carl Hanser Verlag GmbH & Co. KG, 2018. http://dx.doi.org/10.3139/9781569906460.042.
Full textGooch, Jan W. "Splay." In Encyclopedic Dictionary of Polymers, 691. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-6247-8_11037.
Full textKerkstra, Randy, and Steve Brammer. "Splay." In Injection Molding Advanced Troubleshooting Guide, 425–41. 2nd ed. München: Carl Hanser Verlag GmbH & Co. KG, 2021. http://dx.doi.org/10.3139/9781569908358.042.
Full textHargitai, Henrik. "Crevasse Splay." In Encyclopedia of Planetary Landforms, 1–3. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4614-9213-9_82-1.
Full textHargitai, Henrik. "Crevasse Splay." In Encyclopedia of Planetary Landforms, 467–69. New York, NY: Springer New York, 2015. http://dx.doi.org/10.1007/978-1-4614-3134-3_82.
Full textKozen, Dexter C. "Splay Trees." In The Design and Analysis of Algorithms, 58–64. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4400-4_12.
Full textLeutgeb, Lorenz, Georg Moser, and Florian Zuleger. "ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures." In Computer Aided Verification, 99–122. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_5.
Full textGeorgakopoulos, George F. "How to Splay for loglogN-Competitiveness." In Experimental and Efficient Algorithms, 570–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11427186_49.
Full textPort, Graeme, and Alistair Moffat. "A fast algorithm for melding splay trees." In Lecture Notes in Computer Science, 450–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51542-9_37.
Full textGeorgakopoulos, G. F., and D. J. McClurkin. "General Splay: A Basic Theory and Calculus." In Algorithms and Computation, 4–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46632-0_2.
Full textConference papers on the topic "Splajny"
Verma, Pranav, Dominique E. Meyer, Hanyang Xu, and Falko Kuester. "Splatty- A Unified Image Demosaicing and Rectification Method." In 2021 IEEE Winter Conference on Applications of Computer Vision (WACV). IEEE, 2021. http://dx.doi.org/10.1109/wacv48630.2021.00083.
Full textJhun, Chul Gyu, Yi-Jun Kim, Kwan-Sik Min, Jae Chang Kim, and Soon-Bum Kwon. "Twist to Splay Transition by Horizontal Electric Field in Bistable Chiral Splay Nematic Device." In 2007 Conference on Lasers and Electro-Optics - Pacific Rim. IEEE, 2007. http://dx.doi.org/10.1109/cleopr.2007.4391787.
Full textInkane, Nilesh S., Siddhi A. Kotak, and Amitkumar S. Manekar. "Splay: A Lightweight Video Streaming Application." In 2019 International Conference on Innovative Trends and Advances in Engineering and Technology (ICITAET). IEEE, 2019. http://dx.doi.org/10.1109/icitaet47105.2019.9170209.
Full textDas, Payal, R. C. Jisha, and G. P. Sajeev. "Adaptive web personalization system using splay tree." In 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI). IEEE, 2017. http://dx.doi.org/10.1109/icacci.2017.8126067.
Full textAmuedo, K. C., B. R. Williams, J. D. Flood, and A. L. Johns. "STOVL Hot Gas Ingestion Control Technology." In ASME 1989 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1989. http://dx.doi.org/10.1115/89-gt-323.
Full text"UL''TRAMELKOZERNISTYE SPLAVY Ti-Nb, Zr-Nb: MIKROSTRUKTURA, SVOYSTVA, MODELI." In Fizicheskaya mezomekhanika. Materialy s mnogourovnevoy ierarkhicheski organizovannoy strukturoy i intellektual'nye proizvodstvennye tekhnologii. Tomsk State University, 2020. http://dx.doi.org/10.17223/9785946219242/210.
Full textCole, R. "On the dynamic finger conjecture for splay trees." In the twenty-second annual ACM symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/100216.100218.
Full textRiviere, Etienne. "Simplifying Hands-On Teaching of Distributed Algorithms with SPLAY." In 2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2012. http://dx.doi.org/10.1109/ipdpsw.2012.162.
Full textJiang, Wei, Chen Ding, and Roland Cheng. "Memory access analysis and optimization approaches on splay trees." In the 7th workshop. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1066650.1066655.
Full textLin, Tsung-Hsien, Chun-Wei Chen, Duan-Yi Guo, and Li-Min Chang. "Achromatic polarization rotator based on splay-twist liquid crystal." In Liquid Crystals XXV, edited by Iam Choon Khoo. SPIE, 2021. http://dx.doi.org/10.1117/12.2596414.
Full textReports on the topic "Splajny"
Civale, L., L. Krusin-Elbaum, A. D. Marwick, F. Holtzberg, C. Feild, J. R. Thompson, R. Wheeler, M. A. Kirk, and Y. R. Sun. Arresting vortex motion in YBaCuO crystals with splay in columnar defects. Office of Scientific and Technical Information (OSTI), January 1994. http://dx.doi.org/10.2172/204571.
Full textCommonwealth Bank - Head Office cnr Pitt Street & Martin Place - Construction - Splay cornice fire escape on the fifth floor - 4 November 1915 (plate 616). Reserve Bank of Australia, March 2021. http://dx.doi.org/10.47688/rba_archives_pn-000745.
Full text