Littérature scientifique sur le sujet « LMS ALGORITHMS »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « LMS ALGORITHMS ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "LMS ALGORITHMS"
Liu, Ningning, Yuedong Sun, Yansong Wang, Hui Guo, Bin Gao, Tianpei Feng et Pei Sun. « Active control for vehicle interior noise using the improved iterative variable step-size and variable tap-length LMS algorithms ». Noise Control Engineering Journal 67, no 6 (1 novembre 2019) : 405–14. http://dx.doi.org/10.3397/1/376737.
Texte intégralYing-Chang Liang et F. P. S. Chin. « Coherent LMS algorithms ». IEEE Communications Letters 4, no 3 (mars 2000) : 92–94. http://dx.doi.org/10.1109/4234.831035.
Texte intégralKostromitsky, S. M., I. N. Davydzenko et A. A. Dyatko. « Equivalent forms of writing of processing algorithms of adaptive antenna array ». Proceedings of the National Academy of Sciences of Belarus, Physical-Technical Series 67, no 2 (2 juillet 2022) : 230–38. http://dx.doi.org/10.29235/1561-8358-2022-67-2-230-238.
Texte intégralGodavarti, M., et A. O. Hero. « Partial update LMS algorithms ». IEEE Transactions on Signal Processing 53, no 7 (juillet 2005) : 2382–99. http://dx.doi.org/10.1109/tsp.2005.849167.
Texte intégralRusu, Alexandru-George, Silviu Ciochina, Constantin Paleologu et Jacob Benesty. « An Optimized Differential Step-Size LMS Algorithm ». Algorithms 12, no 8 (24 juillet 2019) : 147. http://dx.doi.org/10.3390/a12080147.
Texte intégralZhao, Sihai, Jiangye Xu et Yuyan Zhang. « A Variable Step-Size Leaky LMS Algorithm ». Wireless Communications and Mobile Computing 2021 (9 novembre 2021) : 1–11. http://dx.doi.org/10.1155/2021/7951643.
Texte intégralKalkar, Purvika, et John Sahaya Rani Alex. « FIELD PROGRAMMABLE GATE ARRAY IMPLEMENTATION OF A VARIABLE LEAKY LEAST MEAN SQUARE ADAPTIVE ALGORITHM ». Asian Journal of Pharmaceutical and Clinical Research 10, no 13 (1 avril 2017) : 69. http://dx.doi.org/10.22159/ajpcr.2017.v10s1.19566.
Texte intégralChen, Yuan Yuan, Run Jie Liu, Jin Yuan Shen et Dan Dan He. « The Use of Adaptive Algorithms on Smart Antenna Device ». Advanced Materials Research 548 (juillet 2012) : 730–34. http://dx.doi.org/10.4028/www.scientific.net/amr.548.730.
Texte intégralJaved, Shazia, et Noor Atinah Ahmad. « Optimal preconditioned regularization of least mean squares algorithm for robust online learning1 ». Journal of Intelligent & ; Fuzzy Systems 39, no 3 (7 octobre 2020) : 3375–85. http://dx.doi.org/10.3233/jifs-191728.
Texte intégralEgiazarian, Karen, Pauli Kuosmanen et Ciprian Bilcu. « Variable step-size LMS adaptive filters for CDMA multiuser detection ». Facta universitatis - series : Electronics and Energetics 17, no 1 (2004) : 21–32. http://dx.doi.org/10.2298/fuee0401021e.
Texte intégralThèses sur le sujet "LMS ALGORITHMS"
Johansson, Sven. « Active Control of Propeller-Induced Noise in Aircraft : Algorithms & ; Methods ». Doctoral thesis, Karlskrona, Ronneby : Blekinge Institute of Technology, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00171.
Texte intégralBuller i vår dagliga miljö kan ha en negativ inverkan på vår hälsa. I många sammanhang, i tex bilar, båtar och flygplan, förekommer lågfrekvent buller. Lågfrekvent buller är oftast inte skadligt för hörseln, men kan vara tröttande och försvåra konversationen mellan personer som vistas i en utsatt miljö. En dämpning av bullernivån medför en förbättrad taluppfattbarhet samt en komfortökning. Att dämpa lågfrekvent buller med traditionella passiva metoder, tex absorbenter och reflektorer, är oftast ineffektivt. Det krävs stora, skrymmande absorbenter för att dämpa denna typ av buller samt tunga skiljeväggar för att förhindra att bullret transmitteras vidare från ett utrymme till ett annat. Metoder som är mera lämpade vid dämpning av lågfrekvent buller är de aktiva. De aktiva metoderna baseras på att en vågrörelse som ligger i motfas med en annan överlagras och de släcker ut varandra. Bullerdämpningen erhålls genom att ett ljudfält genereras som är lika starkt som bullret men i motfas med detta. De aktiva bullerdämpningsmetoderna medför en effektiv dämpning av lågfrekvent buller samtidigt som volymen, tex hos bilkupen eller båt/flygplanskabinen ej påverkas nämnvärt. Dessutom kan fordonets/farkostens vikt reduceras vilket är tacksamt för bränsleförbrukningen. I de flesta tillämpningar varierar bullrets karaktär, dvs styrka och frekvensinnehåll. För att följa dessa variationer krävs ett adaptivt (självinställande) reglersystem som styr genereringen av motljudet. I propellerflygplan är de dominerande frekvenserna i kabinbullret relaterat till propellrarnas varvtal, man känner alltså till frekvenserna som skall dämpas. Man utnyttjar en varvtalssignal för att generera signaler, så kallade referenssignaler, med de frekvenser som skall dämpas. Dessa bearbetas av ett reglersystem som generar signaler till högtalarna som i sin tur generar motljudet. För att ställa in högtalarsignalerna så att en effektiv dämpning erhålls, används mikrofoner utplacerade i kabinen som mäter bullret. För att åstadkomma en effektiv bullerdämpning i ett rum, tex i en flygplanskabin, behövs flera högtalare och mikrofoner, vilket kräver ett avancerat reglersystem. I doktorsavhandlingen ''Active Control of Propeller-Induced Noise in Aircraft'' behandlas olika metoder för att reducera kabinbuller härrörande från propellrarna. Här presenteras olika strukturer på reglersystem samt beräkningsalgoritmer för att ställa in systemet. För stora system där många högtalare och mikrofoner används, samt flera frekvenser skall dämpas, är det viktigt att systemet inte behöver för stor beräkningskapacitet för att generera motljudet. Metoderna som behandlas ger en effektiv dämpning till låg beräkningskostnad. Delar av materialet som presenteras i avhandlingen har ingått i ett EU-projekt med inriktning mot bullerundertryckning i propellerflygplan. I projektet har flera europeiska flygplanstillverkare deltagit. Avhandlingen behandlar även aktiv bullerdämpning i headset, som används av helikopterpiloter. I denna tillämpning har aktiv bullerdämpning används för att öka taluppfattbarheten.
Callahan, Michael J. « Estimating Channel Identification Quality in Passive Radar Using LMS Algorithms ». Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1503508289044109.
Texte intégralDabeer, Onkar. « Convergence analysis of the LMS and the constant modulus algorithms / ». Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3055781.
Texte intégralDuan, Jie. « Active Control of Vehicle Powertrain Noise Applying Frequency Domain Filtered-x LMS Algorithm ». University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1243614246.
Texte intégralSigrist, Zoé. « Contribution à l'identification de systèmes non-linéaires en milieu bruité pour la modélisation de structures mécaniques soumises à des excitations vibratoires ». Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14655/document.
Texte intégralThis PhD deals with the caracterisation of mechanical structures, by its structural parameters, when only noisy observations disturbed by additive measurement noises, assumed to be zero-mean white and Gaussian, are available. For this purpose, we suggest using discrete-time models with distinct linear and nonlinear parts. The first one allows the structural parameters to be retrieved whereas the second one gives information on the nonlinearity. When dealing with non-recursive Volterra series, we propose an errors-in-variables (EIV) method to jointly estimate the noise variances and the Volterra kernels. We also suggest a modified unbiased LMS algorithm to estimate the model parameters provided that the input-noise variance is known. When dealing with recursive polynomial model, we propose two methods using evolutionary algorithms. The first includes a stop protocol that takes into account the output-noise variance. In the second one, the fitness functions are based on correlation criteria in which the noise influence is removed or compensated
Ting, L. K. « Algorithms and FPGA implementation of adaptive LMS-based predictors for radar pulse identification ». Thesis, Queen's University Belfast, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.395207.
Texte intégralNguyen, Ngoc Hung, Majid Dowlatnia et Azhar Sarfraz. « Implementation of the LMS and NLMS algorithms for Acoustic Echo Cancellationin teleconference systemusing MATLAB ». Thesis, Växjö University, School of Mathematics and Systems Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-6368.
Texte intégralIn hands-free telephony and in teleconference systems, the main aim is to provide agood free voice quality when two or more people communicate from different places.The problem often arises during the conversation is the creation of acoustic echo. Thisproblem will cause the bad quality of voice signal and thus talkers could not hearclearly the content of the conversation, even thought lost the important information.This acoustic echo is actually the noise which is created by the reflection of soundwaves by the wall of the room and the other things exist in the room. The mainobjective for engineers is the cancellation of this acoustic echo and provides an echofree environment for speakers during conversation. For this purpose, scientists designdifferent adaptive filter algorithms. Our thesis is also to study and simulate theacoustics echo cancellation by using different adaptive algorithms.
Lo, Ming Jengis. « Performance investigation of adaptive filter algorithms and their implementation for MIMO systems ». Thesis, University of Canterbury. Electrical and Computer Engineering, 2005. http://hdl.handle.net/10092/1136.
Texte intégralCastelo, Branco César Augusto Santana. « Algoritmos adaptativos LMS normalizados proporcionais : proposta de novos algoritmos para identificação de plantas esparsas ». Universidade Federal do Maranhão, 2016. http://tedebc.ufma.br:8080/jspui/handle/tede/1688.
Texte intégralMade available in DSpace on 2017-06-23T20:42:44Z (GMT). No. of bitstreams: 1 CesarCasteloBranco.pdf: 11257769 bytes, checksum: 911c33f2f0ba5c1c0948888e713724f6 (MD5) Previous issue date: 2016-12-12
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPQ)
This work proposes new methodologies to optimize the choice of the parameters of the proportionate normalized least-mean-square (PNLMS) adaptive algorithms. The proposed approaches use procedures based on two optimization methods, namely, the golden section and tabu search methods. Such procedures are applied to determine the optimal parameters in each iteration of the adaptation process of the PNLMS and improved PNLMS (IPNLMS) algorithms. The objective function for the proposed procedures is based on the a posteriori estimation error. Performance studies carried out to evaluate the impact of the PNLMS and IPNLMS parameters in the behavior of these algorithms shows that, with the aid of optimization techniques to choose properly such parameters, the performance of these algorithms may be improved in terms of convergence speed for the identification of plants with high sparseness degree. The main goal of the proposed methodologies is to improve the distribution of the adaptation energy between the coefficients of the PNLMS and IPNLMS algorithms, using parameter values that lead to the minimal estimation error of each iteration of the adaptation process. Numerical tests performed (considering various scenarios in which the plant impulse response is sparse) show that the proposed methodologies achieve convergence speeds faster than the PNLMS and IPNLMS algorithms, and other algorithms of the PNLMS class, such as the sparseness controlled IPNLMS (SC-IPNLMS) algorithm.
Neste trabalho, novas metodologias para otimizar a escolha dos parâmetros dos algoritmos adaptativos LMS normalizados proporcionais (PNLMS) são propostas. As abordagens propostas usam procedimentos baseados em dois métodos de otimização, a saber, os métodos da razão áurea e da busca tabu. Tais procedimentos são empregados para determinar os parâmetros ótimos em cada iteração do processo de adaptação dos algoritmos PNLMS e PNLMS melhorado (IPNLMS). A função objetivo adotada pelos procedimentos propostos é baseada no erro de estimação a posteriori. O estudo de desempenho realizado para avaliar o impacto dos parâmetros dos algoritmos PNLMS e IPNLMS no comportamento dos mesmos mostram que, com o auxílio de técnicas de otimização para escolher adequadamente tais parâmetros, o desempenho destes algoritmos pode ser melhorado, em termos de velocidade de convergência, para a identificação de plantas com elevado grau de esparsidade. O principal objetivo das metodologias propostas é melhorar a distribuição da energia de ativação entre os coeficientes dos algoritmos PNLMS e IPNLMS, usando valores de parâmetros que levam ao erro de estimação mínimo em cada iteração do processo de adaptação. Testes numéricos realizados (considerando diversos cenários nos quais a resposta impulsiva da planta é esparsa) mostram que as metodologias propostas alcançam velocidades de convergência superiores às dos algoritmos PNLMS e IPNLMS, além de outros algoritmos da classe PNLMS, tais como o algoritmo IPNLMS com controle de esparsidade (SCIPNLMS).
Hua, Fei. « Adaptation et apprentissage sur des réseaux et des graphiques multitâches ». Thesis, Université Côte d'Azur, 2020. http://www.theses.fr/2020COAZ4037.
Texte intégralMultitask learning has received considerable attention in signal processing and machine learning communities. It aims at simultaneously learning several related tasks other than the traditional single-task problems. There also have witnessed a wide spectrum of data processing problems that are network- or graph-structured and require adaptation ability to streaming data and time-varying dynamics. Distributed adaptive learning strategies over networks enable a collection of interconnected agents to accomplish a certain task, such as parameter estimation, collaboratively through local computation and cooperation among neighboring agents. Further, they endow the agents with continuous adaptation and learning ability to track possible drifts in the underlying model. Despite the heterogeneous nature and the fact that each agent may solve a different task in multitask network, it could still benefit from a collaboration between agents to improve the estimation accuracy by leveraging the relations and capitalizing on inductive transfer between them. The objective of this thesis is to devise and analyze multitask adaptive learning strategies over networks and graphs. First, we consider multitask estimation problems where each agent is interested in estimating its own parameter vector and where the parameter vectors at neighboring agents are related linearly according to a set of constraints. Based on the penalty method, an unconstrained optimization problem is reformulated and a distributed algorithm is derived. The behavior of the algorithm in the mean and in the mean-square-error sense is analyzed. Next, we relax the local constraints assumption and consider the multitask problem with non-local constraints. We devise the distributed algorithm by employing a multi-hop relay protocol across the agents. We prove that the algorithm will continue to converge and provide theoretical performance analysis. In the third part, we extend the distributed learning strategies to the emerging graph signal processing applications where the signal itself is network-structured. Several graph diffusion LMS strategies are proposed to cope with streaming graph signals. We also extend the multitask model to graph filters and propose an on-line clustering mechanism. Last, we consider the problem of modeling graph signals by using a combination of multiple graph filters. An efficient algorithm is proposed to simultaneously learn coefficients of multiple graph filters and perform model selection. Simulation and numerical results are provided to illustrate the effectiveness of all proposed algorithms and validate the theoretical analyses
Livres sur le sujet "LMS ALGORITHMS"
Gavin, Joseph Mark. Parametric modelling of narrowband signals using LMS and MSANF algorithms. [s.l : The Author], 1994.
Trouver le texte intégralHernert, Patrice. Les algorithmes. Paris : Presses universitaires de France, 1995.
Trouver le texte intégralPair, C. Construire les algorithmes : Les améliorer, les connaître, les évaluer. [Paris] : Dunod, 1988.
Trouver le texte intégralK, Kokula Krishna Hari, dir. Cancellation of Power Line Interference in ECG using Adaptive LMS Algorithm : ICIEMS 2014. India : Association of Scientists, Developers and Faculties, 2014.
Trouver le texte intégralSalomon, C. Los algoritmos del tecnoecistencialismo : Las esquematizaciones autoanulatorias del pensamiento de las masas. Argentina : Ediciones Suarez, 2007.
Trouver le texte intégralSalomon, C. Los algoritmos del tecnoecistencialismo : Las esquematizaciones autoanulatorias del pensamiento de las masas. Argentina : Ediciones Suarez, 2007.
Trouver le texte intégralTorres Ortega, Jesús Alfonso. Introducción a los métodos numéricos. Bogotá. Colombia : Universidad de La Salle. Ediciones Unisalle, 2012. http://dx.doi.org/10.19052/9789585148314.
Texte intégralACM Symposium on Parallelism in Algorithms and Architectures (17th 2005 Las Vegas, Nev.). SPAA 2005 : Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA. New York, NY : Association for Computing Machinery, 2005.
Trouver le texte intégralNelson, P. A. MINT, the multiple error LMS algorithm, and the design of inverse filters for multi-channel sound reproduction systems. Southampton, England : University of Southampton, 1992.
Trouver le texte intégralLa programmation linéaire dans les modèles de production. Paris : Masson, 1988.
Trouver le texte intégralChapitres de livres sur le sujet "LMS ALGORITHMS"
Ramirez, Paulo Sergio. « LMS-Based Algorithms ». Dans The Kluwer International Series in Engineering and Computer Science, 139–93. Boston, MA : Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3637-3_4.
Texte intégralDiniz, Paulo Sergio Ramirez. « LMS-Based Algorithms ». Dans Adaptive Filtering, 133–81. Boston, MA : Springer US, 1997. http://dx.doi.org/10.1007/978-1-4419-8660-3_4.
Texte intégralDiniz, Paulo S. R. « LMS-Based Algorithms ». Dans Adaptive Filtering, 103–55. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29057-3_4.
Texte intégralDiniz, Paulo S. R. « LMS-Based Algorithms ». Dans Adaptive Filtering, 137–207. Boston, MA : Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-4106-9_4.
Texte intégralDiniz, Paulo S. R. « Lms-Based Algorithms ». Dans Adaptive Filtering, 1–63. Boston, MA : Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-68606-6_4.
Texte intégralWagner, Kevin, et Miloš Doroslovački. « LMS Analysis Techniques ». Dans Proportionate-Type Normalized Least Mean Square Algorithms, 13–27. Hoboken, NJ USA : John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118579558.ch2.
Texte intégralSridhar, Bharath, I. Akram Sheriff, K. A. Narayanan Kutty et S. Sathish Kumar. « Comparison of Cascaded LMS-RLS, LMS and RLS Adaptive Filters in Non-Stationary Environments ». Dans Novel Algorithms and Techniques in Telecommunications and Networking, 495–99. Dordrecht : Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-3662-9_85.
Texte intégralSridevi, K., et A. Jhansi Rani. « Performance Analysis of LMS and Fractional LMS Algorithms for Smart Antenna System ». Dans Lecture Notes in Electrical Engineering, 181–87. Singapore : Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1906-8_20.
Texte intégralRamirez, Paulo Sergio. « Quantization Effects in the LMS and RLS Algorithms ». Dans The Kluwer International Series in Engineering and Computer Science, 527–58. Boston, MA : Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3637-3_12.
Texte intégralSharma, Ritika, Anupama Senapati et Jibendu Sekhar Roy. « Design of Smart Antenna Using Normalized Leaky LMS and Sign Leaky LMS Algorithms—A Comparative Study ». Dans Advances in Computer, Communication and Control, 143–53. Singapore : Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-3122-0_15.
Texte intégralActes de conférences sur le sujet "LMS ALGORITHMS"
Diniz, Paulo S. R., Hamed Yazdanpanah et Markus V. S. Lima. « Feature LMS Algorithms ». Dans ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8461674.
Texte intégralHosseini, Kianoush, Aman Montazeri, Hooman Alikhanian et Mohammad H. Kahaei. « New Classes of LMS and LMF Adaptive Algorithms ». Dans Communication Technologies : from Theory to Applications (ICTTA). IEEE, 2008. http://dx.doi.org/10.1109/ictta.2008.4530045.
Texte intégralYazdanpanah, Hamed, et Jose A. Apolinario. « Feature Normalized Lms Algorithms ». Dans 2019 53rd Asilomar Conference on Signals, Systems, and Computers. IEEE, 2019. http://dx.doi.org/10.1109/ieeeconf44664.2019.9048952.
Texte intégralTsinos, Christos G., et Paulo S. R. Diniz. « Data-selective LMS-Newton and LMS-Quasi-Newton Algorithms ». Dans ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2019. http://dx.doi.org/10.1109/icassp.2019.8683076.
Texte intégralYazdanpanah, Hamed, Jose A. Apolinario, Paulo S. R. Diniz et Markus V. S. Lima. « l0-NORM FEATURE LMS ALGORITHMS ». Dans 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2018. http://dx.doi.org/10.1109/globalsip.2018.8646465.
Texte intégralDogariu, Laura-Maria, Constantin Paleologu, Jacob Benesty, Cristina Oprea et Silviu Ciochina. « LMS Algorithms for Multilinear Forms ». Dans 2020 International Symposium on Electronics and Telecommunications (ISETC). IEEE, 2020. http://dx.doi.org/10.1109/isetc50328.2020.9301133.
Texte intégralCheong Took, Clive, Danilo Mandic et Jacob Benesty. « Study of the quaternion LMS and four-channel LMS algorithms ». Dans ICASSP 2009 - 2009 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2009. http://dx.doi.org/10.1109/icassp.2009.4960282.
Texte intégralGogineni, Vinay Chakravarthi, Subrahmanyam Mula, Rajib Lochan Das et Mrityunjoy Chakraborty. « Performance analysis of proportionate-type LMS algorithms ». Dans 2016 Signal Processing : Algorithms, Architectures, Arrangements and Applications (SPA). IEEE, 2016. http://dx.doi.org/10.1109/spa.2016.7763608.
Texte intégralCattivelli, Federico S., et Ali H. Sayed. « Diffusion LMS algorithms with information exchange ». Dans 2008 42nd Asilomar Conference on Signals, Systems and Computers. IEEE, 2008. http://dx.doi.org/10.1109/acssc.2008.5074402.
Texte intégralDouglas, Scott C., et Danilo P. Mandic. « Performance analysis of the conventional complex LMS and augmented complex LMS algorithms ». Dans 2010 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2010. http://dx.doi.org/10.1109/icassp.2010.5495851.
Texte intégralRapports d'organisations sur le sujet "LMS ALGORITHMS"
Pirohov, Vladyslav M., Anna M. Horlo et Iryna S. Mintii. Software development of the algorithm of adaptating of the website design for people with color-blindness. [б. в.], décembre 2018. http://dx.doi.org/10.31812/123456789/2888.
Texte intégralMintii, Iryna S., Svitlana V. Shokaliuk, Tetiana A. Vakaliuk, Mykhailo M. Mintii et Vladimir N. Soloviev. Import test questions into Moodle LMS. [б. в.], septembre 2019. http://dx.doi.org/10.31812/123456789/3271.
Texte intégralCooper, David A., Daniel C. Apon, Quynh H. Dang, Michael S. Davidson, Morris J. Dworkin et Carl A. Miller. Recommendation for Stateful Hash-Based Signature Schemes. National Institute of Standards and Technology, octobre 2020. http://dx.doi.org/10.6028/nist.sp.800-208.
Texte intégralHatke, Gary F., et Stuart C. Schwartz. A Robust Adaptive Array Structure Using the Soft Constrained LMS algorithm. Fort Belvoir, VA : Defense Technical Information Center, juillet 1988. http://dx.doi.org/10.21236/ada203959.
Texte intégralOrtega-Castro, Fabio, Freddy Cepeda-López et Constanza Martínez-Ventura. Heterogeneidad en el uso de las fuentes de liquidez intradía en el sistema de pagos de alto valor. Banco de la República, août 2021. http://dx.doi.org/10.32468/be.1166.
Texte intégralHousley, R. Use of the HSS/LMS Hash-Based Signature Algorithm in the Cryptographic Message Syntax (CMS). RFC Editor, février 2020. http://dx.doi.org/10.17487/rfc8708.
Texte intégralPeñaloza, Rafael, et Anni-Yasmin Turhan. Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL⁰¹. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.175.
Texte intégralHousley, R. Use of the HSS/LMS Hash-Based Signature Algorithm with CBOR Object Signing and Encryption (COSE). RFC Editor, avril 2020. http://dx.doi.org/10.17487/rfc8778.
Texte intégralPatterson, J. M. Dose algorithm determination for the Los Alamos National Laboratory personnel dosimetry system. Office of Scientific and Technical Information (OSTI), décembre 1995. http://dx.doi.org/10.2172/672131.
Texte intégralPsenak, P., S. Zandi et G. Dawra. Border Gateway Protocol - Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement. Sous la direction de K. Talaulikar. RFC Editor, février 2023. http://dx.doi.org/10.17487/rfc9351.
Texte intégral