Gotowa bibliografia na temat „Maximum order complexity”
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 „Maximum order complexity”.
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 "Maximum order complexity"
Işık, Leyla, i Arne Winterhof. "Maximum-Order Complexity and Correlation Measures". Cryptography 1, nr 1 (13.05.2017): 7. http://dx.doi.org/10.3390/cryptography1010007.
Pełny tekst źródłaChen, Zhixiong, Ana I. Gómez, Domingo Gómez-Pérez i Andrew Tirkel. "Correlation measure, linear complexity and maximum order complexity for families of binary sequences". Finite Fields and Their Applications 78 (luty 2022): 101977. http://dx.doi.org/10.1016/j.ffa.2021.101977.
Pełny tekst źródłaSun, Zhimin, i Arne Winterhof. "On the Maximum Order Complexity of the Thue-Morse and Rudin-Shapiro Sequence". Uniform distribution theory 14, nr 2 (1.12.2019): 33–42. http://dx.doi.org/10.2478/udt-2019-0012.
Pełny tekst źródłaSun, Zhimin, Xiangyong Zeng i Da Lin. "On the Nth maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence". Cryptography and Communications 12, nr 3 (13.09.2019): 415–26. http://dx.doi.org/10.1007/s12095-019-00396-0.
Pełny tekst źródłaPopoli, Pierre. "On the Maximum Order Complexity of Thue–Morse and Rudin–Shapiro Sequences along Polynomial Values". Uniform distribution theory 15, nr 2 (1.12.2020): 9–22. http://dx.doi.org/10.2478/udt-2020-0008.
Pełny tekst źródłaChannon, Alastair. "Maximum Individual Complexity is Indefinitely Scalable in Geb". Artificial Life 25, nr 2 (maj 2019): 134–44. http://dx.doi.org/10.1162/artl_a_00285.
Pełny tekst źródłaCardone, Lorenzo, i Stefano Quer. "The Multi-Maximum and Quasi-Maximum Common Subgraph Problem". Computation 11, nr 4 (27.03.2023): 69. http://dx.doi.org/10.3390/computation11040069.
Pełny tekst źródłaZhang, Xinhe, Wenbo Lv i Haoran Tan. "Low-Complexity GSM Detection Based on Maximum Ratio Combining". Future Internet 14, nr 5 (23.05.2022): 159. http://dx.doi.org/10.3390/fi14050159.
Pełny tekst źródłaRen, Dongping, Jianxi Guo i Xiaoli Hao. "Bayesian network variable elimination method optimal elimination order construction". ITM Web of Conferences 45 (2022): 01012. http://dx.doi.org/10.1051/itmconf/20224501012.
Pełny tekst źródłaHe, Zai-Yin, Abderrahmane Abbes, Hadi Jahanshahi, Naif D. Alotaibi i Ye Wang. "Fractional-Order Discrete-Time SIR Epidemic Model with Vaccination: Chaos and Complexity". Mathematics 10, nr 2 (6.01.2022): 165. http://dx.doi.org/10.3390/math10020165.
Pełny tekst źródłaRozprawy doktorskie na temat "Maximum order complexity"
Popoli, Pierre. "Suites automatiques et morphiques de grande complexité le long des sous-suites". Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0195.
Pełny tekst źródłaThe topic of this thesis lies at the interface between mathematics and computer science. A pseudorandom sequence is a sequence generated by a deterministic algorithm that has properties similar to those of a random sequence. We are interested in various complexity measures for these pseudorandom sequences. Automatic and morphic sequences are not random or pseudorandom, but certain subsequences of these sequences, such as polynomial subsequences for instance, are more random than the original sequences. In the first part of the thesis, we establish a lower bound on the maximal order complexity of the Thue-Morse sequence and related sequences along polynomial subsequences. This answers a question of Sun and Winterhof (2019). We then study the problem in the Zeckendorf numeration system. Its sum of digits function is a morphic non-automatic sequence. We establish a lower bound on the maximal order complexity of the Fibonacci-Thue-Morse sequence along unitary polynomials. We calculate the complexity with the help of the Directed Acyclic Word Graph (DAWG). In the second part, we are interested in the binary sum of digits of squares. We take up the work of Hare, Laishram and Stoll (2011) who studied the problem to determine the odd integers whose Hamming weight is the same as the one of their square. We solve the problem in the majority of the remaining cases, and introduce new tools that might be helpful to completely solve the problem. Our methods range from number theory, combinatorics on words to implementations in the area of computer science. In the third part of the thesis, we study the correlations of the Rudin-Shapiro sequence. The correlations of order 2 are well understood for this sequence, the behavior of this sequence is rather random whereas the original sequence is completely deterministic. The correlation of higher orders of this sequence do not show this random behavior. Aloui, Mauduit and Mkaouar (2021) studied the correlation of the Thue-Morse sequence along prime numbers. We provide a result on the correlation of the Rudin-Shapiro sequence along prime numbers
Zaylaa, Amira. "Analyse et extraction de paramètres de complexité de signaux biomédicaux". Thesis, Tours, 2014. http://www.theses.fr/2014TOUR3315/document.
Pełny tekst źródłaThe analysis of biomedical time series derived from nonlinear dynamic systems is challenging due to the chaotic nature of these time series. Only few classical parameters can be detected by clinicians to opt the state of patients and fetuses. Though there exist valuable complexity invariants such as multi-fractal parameters, entropies and recurrence plot, they were unsatisfactory in certain cases. To overcome this limitation, we propose in this dissertation new entropy invariants, we contributed to multi-fractal analysis and we developed signal-based (unbiased) recurrence plots based on the dynamic transitions of time series. Principally, we aim to improve the discrimination between healthy and distressed biomedical systems, particularly fetuses by processing the time series using our techniques. These techniques were either validated on Lorenz system, logistic maps or fractional Brownian motions modeling chaotic and random time series. Then the techniques were applied to real fetus heart rate signals recorded in the third trimester of pregnancy. Statistical measures comprising the relative errors, standard deviation, sensitivity, specificity, precision or accuracy were employed to evaluate the performance of detection. Elevated discernment outcomes were realized by the high-order entropy invariants. Multi-fractal analysis using a structure function enhances the detection of medical fetal states. Unbiased cross-determinism invariant amended the discrimination process. The significance of our techniques lies behind their post-processing codes which could build up cutting-edge portable machines offering advanced discrimination and detection of Intrauterine Growth Restriction prior to fetal death. This work was devoted to Fetal Heart Rates but time series generated by alternative nonlinear dynamic systems should be further considered
Ennaoui, Karima. "Computational aspects of infinite automata simulation and closure system related issues". Thesis, Université Clermont Auvergne (2017-2020), 2017. http://www.theses.fr/2017CLFAC031/document.
Pełny tekst źródłaThis thesis investigates complexity and computational issues in two parts. The first concerns an issue related to web services composition problem: Deciding whether the behaviour of a web service can be composed out of an existing repository of web services. This question has been reduced to simulating a finite automata to the product closure of an automata set. We study the complexity of this problem considering two parameters; the number of considered instances in the composition and the presence of the so-called hybrid states (states that are both intermediate and final). The second part concerns closure systems and two related issues; Maximal extension of a closure system : we give an incremental polynomial algorithm that computes a lattice's maximal extension when the input is a binary relation. Candidate keys enumeration : we introduce the notion of key-ideal sets and prove that their enumeration is equivalent to candidate keys enumeration. We then give an efficient algorithm that generates all non-minimal key-ideal sets in a polynomial delay and all minimal ones in incremental polynomial time
Części książek na temat "Maximum order complexity"
Yuan, Leqi, Kun Cheng, Haozhi Bian, Yaping Liao i Chenxi Jiang. "Numerical Simulation of Flow Boiling Heat Transfer in Helical Tubes Under Marine Conditions". W Springer Proceedings in Physics, 1015–30. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-1023-6_86.
Pełny tekst źródłaXiao, Yancai, Kun Fu, Zhuang Li, Zhiping Zeng, Jian Bai, Zhibin Huang, Xudong Huang i Yu Yuan. "Research on Construction Process of Steel Beam Incremental Launching Based on Finite Element Method". W Lecture Notes in Civil Engineering, 254–62. Singapore: Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-1260-3_22.
Pełny tekst źródłaEriksen, Thomas Hylland, i Martina Visentin. "Threats to Diversity in a Overheated World". W Acceleration and Cultural Change, 27–45. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-33099-5_3.
Pełny tekst źródłaGreenlaw, Raymond, H. James Hoover i Walter L. Ruzzo. "Complexity". W Limits to Parallel Computation. Oxford University Press, 1995. http://dx.doi.org/10.1093/oso/9780195085914.003.0007.
Pełny tekst źródłaGracia Nirmala Rani D., J. Shanthi i S. Rajaram. "Machine Learning Optimization Techniques for 3D IC Physical Design". W Handbook of Research on Emerging Trends and Applications of Machine Learning, 47–61. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-5225-9643-1.ch003.
Pełny tekst źródłaElena Buruiana, Felicia, Lamiese Ismail, Federico Ferrari i Hooman Soleymani Majd. "The Role of Ultra-Radical Surgery in the Management of Advanced Ovarian Cancer: State or Art". W Ovarian Cancer - Updates in Tumour Biology and Therapeutics [Working Title]. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.97638.
Pełny tekst źródłaBishop, Christopher M., i Michael E. Tipping. "Latent Variable Models and Data Visualisation". W Statistics and Neural Networks, 147–64. Oxford University PressOxford, 2000. http://dx.doi.org/10.1093/oso/9780198524229.003.0006.
Pełny tekst źródłaEpstein, Irving R., i John A. Pojman. "Complex Oscillations and Chaos". W An Introduction to Nonlinear Chemical Dynamics. Oxford University Press, 1998. http://dx.doi.org/10.1093/oso/9780195096705.003.0014.
Pełny tekst źródłaGu, Pengfei, i Daao Yu. "OOD Problem Research in Biochemistry Based on Backdoor Adjustment". W Frontiers in Artificial Intelligence and Applications. IOS Press, 2024. http://dx.doi.org/10.3233/faia231392.
Pełny tekst źródłaBeris, Antony N., i Brian J. Edwards. "Symplectic Geometry in Optics". W Thermodynamics of Flowing Systems: with Internal Microstructure. Oxford University Press, 1994. http://dx.doi.org/10.1093/oso/9780195076943.003.0006.
Pełny tekst źródłaStreszczenia konferencji na temat "Maximum order complexity"
Kodera, Yuta, Takuya Kusaka, Takeru Miyazaki, Yasuyuki Nogamit, Satoshi Uehara i Robert H. Morelos-Zaragoza. "Evaluating the Maximum Order Complexity of a Uniformly Distributed Sequence Over Odd Characteristic". W 2018 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW). IEEE, 2018. http://dx.doi.org/10.1109/icce-china.2018.8448717.
Pełny tekst źródłaLiu, Jiuyu, Yi Ma i Rahim Tafazolli. "Achieving Maximum-likelihood Detection Performance with Square-order Complexity in Large Quasi-Symmetric MIMO Systems". W 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10207002.
Pełny tekst źródłaBanerjee, Jai Nath, Madhura Mundale, Adnan Sachche i Christopher McComb. "Complexity Reduction in Mass Customization to Facilitate Better Decision Support". W ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-97369.
Pełny tekst źródłaKarjalainen, J. P., R. Karjalainen i K. Huhtala. "An Extended Second Order Polynomial Model for Hydraulic Fluid Density". W ASME/BATH 2013 Symposium on Fluid Power and Motion Control. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/fpmc2013-4412.
Pełny tekst źródłaAntillon Moreira, Rodrigo, Ramanujan Jeughale, Toki Takahiro, Toma Motohiro, Kerron Andrews, Ryota Fujinaga, Salim Abdalla Al Ali i Mohamed Abdulrahman Alzaabi. "Best Practice to Improve Slim Hole Maximum Reservoir Contact Well Drilling Performance". W SPE/IADC Middle East Drilling Technology Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/202189-ms.
Pełny tekst źródłaRiggs, Marie K., Matt R. Bohm i Philip J. Mountain. "Examining Relationships Between Device Complexity and Failure Modes of Minimally Invasive Surgical Staplers". W ASME 2016 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/imece2016-66750.
Pełny tekst źródłaLiu, Jianbin, André Sitte i Jürgen Weber. "Adaptive Identification and Application of Flow Mapping for Electrohydraulic Valves". W SICFP’21 The 17:th Scandinavian International Conference on Fluid Power. Linköping University Electronic Press, 2021. http://dx.doi.org/10.3384/ecp182p173.
Pełny tekst źródłaDesmulliez, M. P. Y., P. W. Foulk i B. S. Wherrett. "Hybrid Technology for Optoelectronic Parallel Processing : Basic Considerations and Future Trends". W Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.otue.7.
Pełny tekst źródłaSchimanowski, Alex, i Josef Schlattmann. "Estimation of Impact Energy for Seat Seals in Spring-Operated Pressure Relief Valves During the Reseating Process Under Compressible Fluid Service Conditions". W ASME 2019 Pressure Vessels & Piping Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/pvp2019-93336.
Pełny tekst źródłaKainulainen, Martyna. "A simplified method for evaluation of robustness of bridges". W IABSE Workshop, Helsinki 2017: Ignorance, Uncertainty, and Human Errors in Structural Engineering. Zurich, Switzerland: International Association for Bridge and Structural Engineering (IABSE), 2017. http://dx.doi.org/10.2749/helsinki.2017.126.
Pełny tekst źródła