Добірка наукової літератури з теми "NUMEROUS ALGORITHMS"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "NUMEROUS ALGORITHMS".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "NUMEROUS ALGORITHMS"
1
Riyad, Wahidul Alam. "Comparative Evaluation of Numerous Optimization Algorithms for Compiling Travel Salesman Problem." Journal of Advanced Research in Dynamical and Control Systems 12, SP7 (July 25, 2020): 877–83. http://dx.doi.org/10.5373/jardcs/v12sp7/20202178.
Повний текст джерела
2
Thompson, William J. "Numerous Neat Algorithms for the Voigt Profile Function." Computers in Physics 7, no. 6 (1993): 627. http://dx.doi.org/10.1063/1.4823236.
Повний текст джерела
3
Ambhika, Ms. "Cost-effective Numerous Kernel Learning Algorithms using Low-Rank Interpretation." International Journal for Research in Applied Science and Engineering Technology 8, no. 6 (June 30, 2020): 136–49. http://dx.doi.org/10.22214/ijraset.2020.6021.
Повний текст джерела
4
Geetanjli. "Study of Power Control in CDMA System on the basis of optimization Technique." International Journal of Advanced Research in Computer Science and Software Engineering 7, no. 8 (August 30, 2017): 126. http://dx.doi.org/10.23956/ijarcsse.v7i8.38.
Повний текст джерелаАнотація:
The power control in CDMA systems, grant numerous users to share resources of the system uniformly between each other, leading to expand capacity. With convenient power control, capacity of CDMA system is immense in contrast of frequency division multiple access (FDMA) and time division multiple access (TDMA). If power control is not achieved numerous problems such as the near-far effect will start to monopolize and consequently will reduce the capacity of the CDMA system. However, when the power control in CDMA systems is implemented, it allows numerous users to share resources of the system uniformly between themselves, leading to increased capacity For power control in CDMA system optimization algorithms i.e. genetic algorithm & particle swarm algorithm can be used which regulate a convenient power vector. These power vector or power levels are dogged at the base station and announce to mobile units to alter their transmitting power in accordance to these levels. The performances of the algorithms are inspected through both analysis and computer simulations, and compared with well-known algorithms from the literature.
5
Gahman, Nicholas, and Vinayak Elangovan. "A Comparison of Document Similarity Algorithms." International Journal of Artificial Intelligence & Applications 14, no. 2 (March 30, 2023): 41–50. http://dx.doi.org/10.5121/ijaia.2023.14204.
Повний текст джерелаАнотація:
Document similarity is an important part of Natural Language Processing and is most commonly used forplagiarism-detection and text summarization. Thus, finding the overall most effective document similarity algorithm could have a major positive impact on the field of Natural Language Processing. This report setsout to examine the numerous document similarity algorithms, and determine which ones are the mostuseful. It addresses the most effective document similarity algorithm by categorizing them into 3 types ofdocument similarity algorithms: statistical algorithms, neural networks, and corpus/knowledge-basedalgorithms. The most effective algorithms in each category are also compared in our work using a series of benchmark datasets and evaluations that test every possible area that each algorithm could be used in.
6
Tsagris, Michail, and Ioannis Tsamardinos. "Feature selection with the R package MXM." F1000Research 7 (September 20, 2018): 1505. http://dx.doi.org/10.12688/f1000research.16216.1.
Повний текст джерелаАнотація:
Feature (or variable) selection is the process of identifying the minimal set of features with the highest predictive performance on the target variable of interest. Numerous feature selection algorithms have been developed over the years, but only few have been implemented in R as a package. The R package MXM is such an example, which not only offers a variety of feature selection algorithms, but has unique features that make it advantageous over its competitors: a) it contains feature selection algorithms that can treat numerous types of target variables, including continuous, percentages, time to event (survival), binary, nominal, ordinal, clustered, counts, left censored, etc; b) it contains a variety of regression models to plug into the feature selection algorithms; c) it includes an algorithm for detecting multiple solutions (many sets of equivalent features); and d) it includes memory efficient algorithms for high volume data, data that cannot be loaded into R. In this paper we qualitatively compare MXM with other relevant packages and discuss its advantages and disadvantages. We also provide a demonstration of its algorithms using real high-dimensional data from various applications.
7
Villuendas-Rey, Yenny, Eley Barroso-Cubas, Oscar Camacho-Nieto, and Cornelio Yáñez-Márquez. "A General Framework for Mixed and Incomplete Data Clustering Based on Swarm Intelligence Algorithms." Mathematics 9, no. 7 (April 6, 2021): 786. http://dx.doi.org/10.3390/math9070786.
Повний текст джерелаАнотація:
Swarm intelligence has appeared as an active field for solving numerous machine-learning tasks. In this paper, we address the problem of clustering data with missing values, where the patterns are described by mixed (or hybrid) features. We introduce a generic modification to three swarm intelligence algorithms (Artificial Bee Colony, Firefly Algorithm, and Novel Bat Algorithm). We experimentally obtain the adequate values of the parameters for these three modified algorithms, with the purpose of applying them in the clustering task. We also provide an unbiased comparison among several metaheuristics based clustering algorithms, concluding that the clusters obtained by our proposals are highly representative of the “natural structure” of data.
8
Dey, Nilanjan, and Amira S. Ashour. "Antenna Design and Direction of Arrival Estimation in Meta-Heuristic Paradigm." International Journal of Service Science, Management, Engineering, and Technology 7, no. 3 (July 2016): 1–18. http://dx.doi.org/10.4018/ijssmet.2016070101.
Повний текст джерелаАнотація:
Antennas are considered as a significant component in any wireless system. There are numerous factors and constraints that affect its design. Therefore, recently several algorithms are developed to allow the designers optimize the antenna with respect to numerous different criteria, general constraints and the desired performance characteristics. In recent years there has been an increasing attention to some novel evolutionary techniques, such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Bacteria-Foraging (BF), Biogeography Based Optimization (BBO), and Differential Evolution (DE) that used for antenna optimization. The current study discussed three popular population-based meta-heuristic algorithms for optimal antenna design and direction of arrival estimation. Basically, single and multi-objective population-based meta-heuristic algorithms are included. Besides hybrid methods are highlighted. This paper reviews antenna array design optimization as well as direction of arrival optimization problem for different antennas configurations.
9
Ge, Lina, Jie Wang, and Guifen Zhang. "Survey of Consensus Algorithms for Proof of Stake in Blockchain." Security and Communication Networks 2022 (May 29, 2022): 1–13. http://dx.doi.org/10.1155/2022/2812526.
Повний текст джерелаАнотація:
As the core of blockchain technology, the consensus algorithm directly affects the security, stability, and decentralisation of the blockchain and numerous other important characteristics. Choosing an appropriate consensus algorithm for different scenarios is currently a challenge in the implementation of blockchain applications. This paper classifies the improvement schemes of proof of stake (PoS) into three categories: PoS-based consensus algorithms, PoS- and PoW-based consensus algorithms, and PoS- and BFT-based consensus algorithms. First, the study introduces the PoS and PoS consensus algorithm variants and then summarises the core ideas, effects, advantages, and disadvantages of these algorithms. Subsequently, the performances of the improved algorithms are compared. Finally, the main improved methods are summarised, and the most common network security attacks are discussed. The study lays a foundation for the main improvement directions of PoS in the future, hoping to provide a reference for researchers to help them select and design consensus algorithms in different application scenarios while also helping the evolution of consensus algorithms and the implementation of blockchain applications.
10
Hendry Leo Kanickam, S., and L. Jayasimman. "Comparative Analysis of Hash Authentication Algorithms and ECC Based Security Algorithms in Cloud Data." Asian Journal of Computer Science and Technology 8, no. 1 (February 5, 2019): 53–61. http://dx.doi.org/10.51983/ajcst-2019.8.1.2118.
Повний текст джерелаАнотація:
Cloud computing is ensuring the security of stored data in cloud computing servers is one of the mainly demanding issues. In Cloud numerous security issues arises such as authentication, integrity and confidentiality. Different encryption techniques attempt to overcome these data security issues to an enormous extent. Hashing algorithm plays an important role in data integrity, message authentication, and digital signature in modern information security. For security purpose using encryption algorithm like ECC (Elliptic Curve Cryptography) and Authentication of data integrity using hashing algorithms like MD5, and SHA-512. This combination method provides data security, authentication and verification for secure cloud computing.
Дисертації з теми "NUMEROUS ALGORITHMS"
1
Souza, Lana Priscila. "Criptografia RSA: a teoria dos nÃmeros posta em prÃtica." Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14834.
Повний текст джерелаАнотація:
CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel SuperiorDesde o advento da escrita, o envio de mensagens secretas tem sido uma importante maneira de guardar sigilo de informaÃÃes confidenciais. A arte de elaborar mensagens a partir de cÃdigos secretos surge na figura da criptografia que, com o passar do tempo, estende os seus serviÃos Ãs transaÃÃes comerciais realizadas pela internet. O principal algoritmo utilizado pela internet recebe o nome de RSA. Assim, a criptografia RSA codifica nÃmeros de cartÃes de crÃditos, senhas de bancos, nÃmeros de contas e utiliza para isso elementos de uma importante Ãrea da MatemÃtica: a Teoria dos NÃmeros.
Since the advent of writing, sending secret messages has been an important way to maintain confidentiality of sensitive information. The art of crafting messages from secret codes appears in the figure of encryption that over time extends its services to commercial transactions over the Internet. The main algorithm used by the internet is called RSA. Thus, the RSA Encryption encodes credit card numbers, bank passwords, account numbers and uses for that elements of an important area of mathematics: number theory.
2
Gomes, Natanael Rodrigues. "Algoritmo sequencial para reconhecimento de numerais manuscritos desconectados utilizando redes neurais." [s.n.], 1996. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261491.
Повний текст джерелаАнотація:
Orientador: Lee Luan LingDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica
Made available in DSpace on 2018-07-21T03:38:05Z (GMT). No. of bitstreams: 1 Gomes_NatanaelRodrigues_M.pdf: 3843291 bytes, checksum: ea1c445465616bedc519575e7960e649 (MD5) Previous issue date: 1996
Resumo: A principal dificuldade em reconhecimento de caracteres manuscritos está em desenvolver métodos que possibilitem um ótimo índice de reconhecimento, apesar da grande variabilidade dos caracteres. Este trabalho apresenta um sistema para reconhecimento de numerais manuscritos desconectados, baseado na análise da topologia e distribuição pictorial de numerais e no emprego da rede de Hopfield discreta como memória associativa. O processo de classificação de numerais é dividido em dois estágios. No primeiro estágio, o numeral desconhecido é classificado de acordo com características extraídas de sua topologia e distribuição pictorial. Caso isto não seja possível, devido a distorções e ruídos na imagem do numeral desconhecido, a classificação é efetuada no segundo estágio de classificação do sistema, via rede de Hopfield. A rede de Hopfield é implementada de dois modos. No primeiro modo, a rede tem seus pesos calculados pelo método da projeção, no segundo modo, a rede tem os pesos calculados pelo método de síntese para sistemas lineares operando em modo saturado (LSSM). O sistema é testado com 1500 numerais manuscritos, sendo obtido uma taxa de 85% de reconhecimento com o sistema utilizando, no segundo estágio, a rede de Hopfield implementada conforme o primeiro modo. Uma taxa de reconhecimento de 84,4% é obtida com o sistema utilizando, no segundo estágio, a rede de Hopfield implementada de acordo com o segundo modo
Abstract: The main difficultyin handwritten character recognition consists in developing methods that provide a high recognition rate, although of the large degree of variability of the characteres. This work presents a system for recognition of disconnected handwritten numeraIs, based in analysis of the topology and distribution of pixels from the numerals, and application of a discrete Hopfield neural net used as associative memory. ln the system, the process of classification is divided in two stages. ln the first stage, the unknown numeral is classified considering features extracted from its topology and distribution of pixels. lf it is not possible, due to distortions and noise in numeral image, the classificationis effectuated in the second stage, via Hopfield netoThe Hopfield net is implemented of two manners. ln the first manner, the net has weights calculated by projection method and, in the second manner, the net has weights calculated by sinthesis procedures to linear systems operating in the saturated mode (LSSM systems). The system is tested with 1500 handwritten numerals. A recognition rate over 85% is obtained with the system making use in the second stage of the Hopfield net implemented by the first manner. A recognition rate over 84,4% is obtained with the system making use in the second stage of the Hopfield net implemented by the second manner
Mestrado
Mestre em Engenharia Elétrica
3
Yared, Glauco Ferreira Gazel. "Metodo para a determinação do numero de gaussianas em modelos ocultos de Markov para sistemas de reconhecimento de fala continua." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260523.
Повний текст джерелаАнотація:
Orientador: Fabio ViolaroTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-06T10:44:21Z (GMT). No. of bitstreams: 1 Yared_GlaucoFerreiraGazel_D.pdf: 5774867 bytes, checksum: 49a79d9495ce25c8a69ca34858a956ee (MD5) Previous issue date: 2006
Resumo: Atualmente os sistemas de reconhecimento de fala baseados em HMMs são utilizados em diversas aplicações em tempo real, desde telefones celulares até automóveis. Nesse contexto, um aspecto importante que deve ser considerado é a complexidade dos HMMs, a qual está diretamente relacionada com o custo computacional. Assim, no intuito de permitir a aplicação prática do sistema, é interessante otimizar a complexidade dos HMMs, impondo-se restrições em relação ao desempenho no reconhecimento. Além disso, a otimização da topologia é importante para uma estimação confiável dos parâmetros dos HMMs. Os trabalhos anteriores nesta área utilizam medidas de verossimilhança para a obtenção de sistemas que apresentem um melhor compromisso entre resolução acústica e robustez. Este trabalho apresenta o novo Algoritmo para Eliminação de Gaussianas (GEA), o qual é baseado em uma análise discriminativa e em uma análise interna, para a determinação da complexidade mais apropriada para os HMMs. O novo método é comparado com o Critério de Informação Bayesiano (BIC), com um método baseado em medidas de entropia, com um método discriminativo para o aumento da resolução acústica dos modelos e com os sistemas contendo um número fixo de Gaussianas por estado
Abstract: Nowadays, HMM-based speech recognition systems are used in many real time processing applications, from cell phones to auto mobile automation. In this context, one important aspect to be considered is the HMM complexity, which directly determines the system computational load. So, in order to make the system feasible for practical purposes, it is interesting to optimize the HMM size constrained to a minimum acceptable recognition performance. Furthermore, topology optimization is also important for reliable parameter estimation. Previous works in this area have used likelihood measures in order to obtain models with a better compromise between acoustic resolution and robustness. This work presents the new Gaussian Elimination Algorithm (GEA), which is based on a discriminative analysis and on an internal analysis, for determining the more suitable HMM complexity. The new approach is compared to the classical Bayesian Information Criterion (BIC), to an entropy based method, to a discriminative-based method for increasing the acoustic resolution of the HMMs and also to systems containing a fixed number of Gaussians per state
Doutorado
Telecomunicações e Telemática
Doutor em Engenharia Elétrica
4
Girjotas, Andrius. "Transporto priemonių numerių atpažinimo algoritmų analizė bei universalios atpažinimo sistemos teorija." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_193526-52512.
Повний текст джерелаАнотація:
Automatinis transporto priemonių registracijos numerio atpažinimas atlieka svarbų vaidmenį daugelyje programinių paketų, taikomų tiek valstybinėse institucijose, tiek ir privačiose kompanijose, kuriuose yra naudojamos įvairios atpažinimo algoritmų technologijos. Tačiau net ir dabar neįmanoma sukurti idealiai veikiančios sistemos, kuri palieka laisvę efektyviausių algoritmų paieškai. Šio tiriamojo darbo tikslas yra išanalizuoti alternatyvius automobilio numerio lokalizacijos ir kitų atpažinimo etapų algoritmus, jų efektyvumą bei adaptyvumą. Analizė atliekama juos realizuojant ir atliekant tyrimus su testiniais duomenimis bei iš jų gautais rezultatais. Iš realizuotos alternatyvių atpažinimo algoritmų sistemos gauti rezultatai parodė, kad kiekviena atpažinimo proceso grandis yra jautri įvairiems faktoriams, kurių kitimas lemia tarpinių bei galutinių rezultatų variaciją.Automatic license plate recognition plays an important role in numerous applications and a number of techniques have been proposed for public institutions or private companies. However, even now it is impossible to design a perfect and operational recognition system. It still leaves a space for creativity and research of the most effective algorithms. The main objective of this dissertation is to analyze alternatives of licese plate localization and other stages of recognition, their efficiency and adaptability. Selected means of this research are such as implementation of algorithms, analysis of testing data and test results. Every stage of recognition process is extremely sensitive to different factors which determinate variation of transitional and final results. This was proven by analysis of alternative algorithms functionality.
5
Kazlauskas, Tomas. "Transporto priemonių numerių atpažinimo algoritmų analizė bei universalios atpažinimo sistemos teorija." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_193534-66751.
Повний текст джерелаАнотація:
Automatinis transporto priemonių registracijos numerio atpažinimas atlieka svarbų vaidmenį daugelyje programinių paketų, taikomų tiek valstybinėse institucijose, tiek ir privačiose kompanijose, kuriuose yra naudojamos įvairios atpažinimo algoritmų technologijos. Tačiau net ir dabar neįmanoma sukurti idealiai veikiančios sistemos, kuri palieka laisvę efektyviausių algoritmų paieškai. Šio tiriamojo darbo tikslas yra išanalizuoti alternatyvius automobilio numerio lokalizacijos ir kitų atpažinimo etapų algoritmus, jų efektyvumą bei adaptyvumą. Analizė atliekama juos realizuojant ir atliekant tyrimus su testiniais duomenimis bei iš jų gautais rezultatais. Iš realizuotos alternatyvių atpažinimo algoritmų sistemos gauti rezultatai parodė, kad kiekviena atpažinimo proceso grandis yra jautri įvairiems faktoriams, kurių kitimas lemia tarpinių bei galutinių rezultatų variaciją.Automatic license plate recognition plays an important role in numerous applications and a number of techniques have been proposed for public institutions or private companies. However, even now it is impossible to design a perfect and operational recognition system. It still leaves a space for creativity and research of the most effective algorithms. The main objective of this dissertation is to analyze alternatives of licese plate localization and other stages of recognition, their efficiency and adaptability. Selected means of this research are such as implementation of algorithms, analysis of testing data and test results. Every stage of recognition process is extremely sensitive to different factors witch determinate variation of transitional and final results. This was proven by analysis of alternative algorithms functionality.
6
Cunha, Junior Lourival Carlos. "Matemática lúdica na educação de jovens e adultos do Centro de Progressão Penitenciária do Distrito Federal." Universidade Federal de Goiás, 2015. http://repositorio.bc.ufg.br/tede/handle/tede/4726.
Повний текст джерелаАнотація:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-22T13:38:57Z
No. of bitstreams: 2
Dissertação - Lourival Carlos Cunha Junior - 2015.pdf: 8702813 bytes, checksum: 307cfb19927718cfa7a667f109f4768f (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-22T13:42:02Z (GMT) No. of bitstreams: 2 Dissertação - Lourival Carlos Cunha Junior - 2015.pdf: 8702813 bytes, checksum: 307cfb19927718cfa7a667f109f4768f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2015-10-22T13:42:02Z (GMT). No. of bitstreams: 2 Dissertação - Lourival Carlos Cunha Junior - 2015.pdf: 8702813 bytes, checksum: 307cfb19927718cfa7a667f109f4768f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-05-25
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This dissertation aims to analyze how the use of mathematical tricks, educational games and alternative algorithms for multiplication and Division of integers contribute to learning of multiplication and Division operations between positive integers. Research participants were students of a class of adult and youth education of the 2o segment of the Central Penitentiary Progression of Distrito Federal (CPP-DF). The analysis of the results was made from questionnaires answered by the students and observations by the teacher during class. The introduction of mathematical operations took place initially by mathematical tricks, then were presented alternative ways to perform them later manipulation of new algorithms, unraveling the tricks and finally organizing with mathematical games. The participants demonstrated commitment, dedication and interest in the tricks, games and alternative algorithms. The objective of this work was achieved. We realized that there was in fact an improvement in pupils ’ learning.
Esta dissertação tem como objetivo analisar como o uso de truques matemáticos, jogos pedagógicos e algoritmos alternativos para a multiplicação e divisão de números inteiros contribuem para o aprendizado das operações multiplicação e divisão entre números inteiros positivos. Os participantes da pesquisa foram alunos de uma turma de Educação de Jovens e Adultos do 2o Segmento do Centro de Progressão Penitenciária do Distrito Federal (CPP-DF). A análise dos resultados foi feita a partir de questionários respondidos pelos alunos e observações realizadas pelo professor durante as aulas. A introdução das operações matemáticas ocorreu inicialmente por truques matemáticos, em seguida foram apresentadas formas alternativas de realizá-las, posteriormente a manipulação dos novos algoritmos, desvendando os truques e finalmente sistematizando com jogos matemáticos. Os participantes demonstraram empenho, dedicação e interesse em relação aos truques, jogos e aos algoritmos alternativos. O objetivo do trabalho foi alcançado. Percebemos que houve de fato uma melhoria na aprendizagem dos alunos.
7
Sousa, Antonio Nilson Laurindo [UNESP]. "Criptografia de chave pública, criptografia RSA." Universidade Estadual Paulista (UNESP), 2013. http://hdl.handle.net/11449/94349.
Повний текст джерелаАнотація:
Made available in DSpace on 2014-06-11T19:27:09Z (GMT). No. of bitstreams: 0
Previous issue date: 2013-08-16Bitstream added on 2014-06-13T20:35:15Z : No. of bitstreams: 1
sousa_anl_me_rcla.pdf: 535933 bytes, checksum: 76cd9ddeb4c3e3c566bae5395dfcaa14 (MD5)Este trabalho apresenta a criptografia, que é estudada desde a antiguidade e suas técnicas hoje consistem basicamente em conceitos matemáticos. Os números inteiros prestam um papel importante na criptografia de chave pública RSA, onde são apresentados alguns conceitos importantes, propriedades e resultados desse conjunto, destacando as relações com os números primos, a função de Euler e a operação módulo, conhecida como problema do logaritmo discreto. Apresentam-se os fundamentos da Criptografia de Chave Pública RSA, em que a base é a cifra assimétrica, mostrando a garantia da privacidade e assinatura das mensagens. Finaliza-se com a ideia do protocolo de criptografia RSA, a construção de um sistema de correios eletrônico, cuja essência é o método para estabelecer uma criptografia de chave pública RSA, baseada no conceito apresentado por Diffie e Hellman
This dissertation presents Cryptography, which is studied since the ancient times and whose techniques consist basically of mathematical concepts. The integers play an important role on the Public Key Cryptography RSA, for which are presented some important results and properties of this set, emphasizing its relations with prime numbers, Euler’s totient function and the modulo operation, also known as the problem of discrete logarithm. We present the foundations of the Public Key Cryptography RSA, whose basis is the asymmetric cipher, showing the privacy security of the messages. It ends with the idea of the RSA cryptography protocol, a construction of an electronic mail system, whose gist lies in the method used to establish a Public Key Criptography system RSA, based on the concept presented by Diffie and Hellman
8
Sousa, Antonio Nilson Laurindo. "Criptografia de chave pública, criptografia RSA /." Rio Claro, 2013. http://hdl.handle.net/11449/94349.
Повний текст джерелаАнотація:
Orientador: Eliris Cristina RizziolliBanca: Aldicio José Miranda
Banca: Henrique Lazari
Resumo: Este trabalho apresenta a criptografia, que é estudada desde a antiguidade e suas técnicas hoje consistem basicamente em conceitos matemáticos. Os números inteiros prestam um papel importante na criptografia de chave pública RSA, onde são apresentados alguns conceitos importantes, propriedades e resultados desse conjunto, destacando as relações com os números primos, a função de Euler e a operação módulo, conhecida como problema do logaritmo discreto. Apresentam-se os fundamentos da Criptografia de Chave Pública RSA, em que a base é a cifra assimétrica, mostrando a garantia da privacidade e assinatura das mensagens. Finaliza-se com a ideia do protocolo de criptografia RSA, a construção de um sistema de correios eletrônico, cuja essência é o método para estabelecer uma criptografia de chave pública RSA, baseada no conceito apresentado por Diffie e Hellman
Abstract: This dissertation presents Cryptography, which is studied since the ancient times and whose techniques consist basically of mathematical concepts. The integers play an important role on the Public Key Cryptography RSA, for which are presented some important results and properties of this set, emphasizing its relations with prime numbers, Euler's totient function and the modulo operation, also known as the problem of discrete logarithm. We present the foundations of the Public Key Cryptography RSA, whose basis is the asymmetric cipher, showing the privacy security of the messages. It ends with the idea of the RSA cryptography protocol, a construction of an electronic mail system, whose gist lies in the method used to establish a Public Key Criptography system RSA, based on the concept presented by Diffie and Hellman
Mestre
9
Silva, Rogerio Sigrist. "Algoritmos de sintese de Pipeline de processadores para sistemas embutidos : minimização de custos, numero de processadores e latencia." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260077.
Повний текст джерелаАнотація:
Orientador: Alice Maria B. H. TokarniaDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-07T23:40:08Z (GMT). No. of bitstreams: 1 Silva_RogerioSigrist_M.pdf: 816659 bytes, checksum: 206ce45bc9176489805fd6c7f8f0e260 (MD5) Previous issue date: 2006
Resumo: Este trabalho descreve três algoritmos para a síntese de sistemas embutidos atendendo à restrição de desempenho representada pela taxa de chegada dos dados, através de uma estrutura de pipeline de processadores para execução das tarefas, ao mesmo tempo em que minimizam diferentes parâmetros de qualidade dos sistemas: número de processadores; custo e latência total. Os algoritmos realizam o particionamento hardware-software das tarefas, a alocação dos processadores, o mapeamento e escalonamento das tarefas. A alocação de processadores e o mapeamento e escalonamento de tarefas são problemas classificados como NP-Completo e, portanto, foram aplicados métodos heurísticos para suas resoluções. Como exemplos de aplicação são apresentados os pipelines sintetizados pelos algoritmos para grafos sintéticos e para um compressor de áudio digital (AC3). Os pipelines sintetizados atingem métricas de qualidade superiores a outros algoritmos publicados
Abstract: This work presents three heuristics for sinthesizing pipelined embedded systems that satisfy a throughput constraint derived from the maximum input data are adopting a pipeline structure of processors while minimizing system quality parameters: cost, number of processors, or number of stages. The algorithms perform tasks hardware-software partitioning, processors allocation and task mapping and scheduling. Since processors allocation and task mapping and scheduling are NP-Complete problems, heuristics methods were applied. The examples present the pipelines synthesized by the algorithms for large synthetic systems comparing the quality parameters minimization results and for a real audio compressor (AC3) application. The pipelines reached quality metrics higher than other published algorithms
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
10
Rodrigues, Andressa Carla. "As quatro operações matemáticas : das dificuldades ao processo ensino e aprendizagem /." São José do Rio Preto, 2019. http://hdl.handle.net/11449/181901.
Повний текст джерелаАнотація:
Orientador: Rita de Cássia Pavan LamasBanca: Rúbia Barcelos Amaral Schio
Banca: Évelin Meneguesso Barbaresco
Resumo: No decorrer dos anos, pelas experiências vivenciadas em sala de aula, nos Anos Finais do Ensino Fundamental e no Ensino Médio, cada vez mais foram observadas dificuldades dos alunos nos cálculos simples, em problemas na matemática e na física. Erros conceituais, nos algoritmos, motivaram-nos a escrever este trabalho para auxiliar professores no processo ensino e aprendizagem das quatro operações no conjunto dos números naturais, a fim de amenizar as dificuldades dos alunos. O objetivo do trabalho é avaliar e diagnosticar dificuldades nos cálculos que envolvem as operações fundamentais e básicas da matemática, aprimorando a forma de ensiná-las aos alunos. Conceitos importantes serão apresentados, como o sistema de numeração decimal, a definição do conjunto dos números naturais e as quatro operações matemáticas. Os algoritmos da decomposição e usual serão explorados com o uso do ábaco de papel e com o material dourado, destacando-se as propriedades associativa e comutativa da adição, assim como as distributiva, associativa e comutativa da multiplicação. Considerando as dificuldades apresentadas no diagnóstico, propõem-se atividades com o material dourado explorando conceitos e instigando o uso dos algoritmos para a compreensão das trocas das ordens, quando necessário. Em síntese, este trabalho apresenta uma metodologia alternativa para melhorar o desempenho dos alunos nos cálculos que envolvem as quatro operações
Abstract: Over the years, experiences in the classroom, the Final Years of Elementary School and High School have seen more and more difficulties for students in simple calculations, problems in mathematics and in physics. Conceptual errors in the algorithms motivated us to write this work to help teachers in the teaching and learning process of the four operations in the set of natural numbers in order to ease the students' difficulties. The purpose of this paper is to evaluate and diagnose difficulties in calculations involving fundamental and basic mathematical operations, improving the way students are taught. Important concepts will be presented, such as the decimal numbering system, the definition of the set of natural numbers and the four mathematical operations. The usual decomposition algorithms will be explored with the use of the paper abacus and the gold material, emphasizing the associative and commutative properties of addition, as well as the distributive, associative and commutative multiplication. Considering the difficulties presented in the diagnosis, activities are proposed with the golden material exploring concepts and instigating the use of the algorithms to understand the order exchanges, when necessary. In summary, this paper presents an alternative methodology to improve students' performance in the calculations involving the four operations
Mestre
Книги з теми "NUMEROUS ALGORITHMS"
1
Image processing of edge and surface defects: Theoretical basis of adaptive algorithms with numerous practical applications. Heidelberg: Springer, 2009.
Знайти повний текст джерела
2
Hege, Hans-Christian. Mathematical Visualization: Algorithms, Applications and Numerics. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998.
Знайти повний текст джерела
3
1954-, Hege Hans-Christian, and Polthier Konrad, eds. Mathematical visualization: Algorithms, applications, and numerics. Berlin: Springer, 1998.
Знайти повний текст джерела
4
Analytic methods in the analysis and design of number-theoretic algorithms. Cambridge, Mass: MIT Press, 1985.
Знайти повний текст джерела
5
Krämer, Walter. Scientific Computing, Validated Numerics, Interval Methods. Boston, MA: Springer US, 2001.
Знайти повний текст джерела
6
Tantar, Emilia. EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Знайти повний текст джерела
7
Allard, André. Muhammad ibn Musa al-Khwarizmi: Le calcul indien (algorismus) : histoire des textes, édition critique, traduction et commentaire des plus anciennes versions latines remaniées du XIIe siècle. Namur: Société des Études Classique, 1992.
Знайти повний текст джерела
8
Khuwārizmī, Muḥammad ibn Mūsá. Le calcul indien (Algorismus): Histoire des textes, édition critique, traduction et commentaire des plus anciennes versions latines remaniées du XIIe siècle. Paris: A. Blanchard, 1992.
Знайти повний текст джерела
9
Vassiliadis, Vassilios, and Georgios Dounias. Algorithmic Trading based on Biologically Inspired Algorithms. Edited by Shu-Heng Chen, Mak Kaboudan, and Ye-Rong Du. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780199844371.013.11.
Повний текст джерелаАнотація:
The chapter discusses algorithmic trading, which refers to any automated process, consisting of a number of interconnected components, whose main aim is to perform financial transactions of any kind. Its chief advantage lies in the fact that human intervention is minimized to an acceptable extent. This is quite desirable because nowadays numerous factors affect financial decisions. Financial managers are able to deal with a limited amount of information. There are many ways to implement algorithmic trading systems. This chapter aims to highlight the efficiency of biologically inspired methodologies when incorporated in such systems. Biologically inspired intelligence comprises a range of algorithms whose common philosophy is based on the behavior of real-world, natural systems and networks. What is more, the performance of the applied nature-inspired intelligence (NII) methodologies is compared to traditional benchmark approaches such as the random portfolio construction.
10
Coolen, A. C. C., A. Annibale, and E. S. Roberts. Network growth algorithms. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0008.
Повний текст джерелаАнотація:
Growth processes are a fundamentally different approach compared to probability-driven exponential models covered in earlier chapters. This chapter studies how growth rules can be designed to mimic processes observed in the real world, and how the process can be mathematically analyzed in order to obtain information about the likely topological properties of the resulting networks. The configuration (stub joining) model is described, including a careful discussion of how bias can be introduced if backtracking is used instead of restarting if stubs join to form a self or double link. The second class of models looked at is preferential attachment. The simplest variants of this are analyzed with a master equation approach, in order to introduce this technique as a way of obtaining analytical information about the expected properties of the generated graphs. Extensive references are provided to the numerous variants and extensions of both of these models.
Частини книг з теми "NUMEROUS ALGORITHMS"
1
Mendy Nefale, Mpho, and Ritesh Ajoodha. "Using Numerous Biographical and Enrolling Observations to Predict Student Performance." In Algorithms for Intelligent Systems, 649–60. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-7041-2_55.
Повний текст джерела
2
Kumar, Karanam Sunil, and N. P. Kavya. "Computational Contextual Framework for Dynamic Tracking of Numerous Mobile Object." In Data Science and Algorithms in Systems, 751–61. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21438-7_63.
Повний текст джерела
3
Dave, Jay. "An Optimised Robust Model for Big Data Security on the Cloud Environment: The Numerous User-Level Data Compaction." In Algorithms for Intelligent Systems, 209–16. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-4936-6_23.
Повний текст джерела
4
Meyer, Ulrich, and Manuel Penschuck. "Generating Synthetic Graph Data from Random Network Models." In Lecture Notes in Computer Science, 21–38. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-21534-6_2.
Повний текст джерелаАнотація:
AbstractNetwork models are developed and used in various fields of science as their design and analysis can improve the understanding of the numerous complex systems we can observe on an everyday basis. From an algorithmics point of view, structural insights into networks can guide the engineering of tailor-made graph algorithms required to face the big data challenge.By design, network models describe graph classes and therefore can often provide meaningful synthetic instances whose applications include experimental case studies. While there exist public network libraries with numerous datasets, the available instances do not fully satisfy the needs of experimenters, especially pertaining to size and diversity. As several SPP 1736 projects engineered practical graph algorithms, multiple sampling algorithms for various graph models were designed and implemented to supplement experimental campaigns. In this chapter, we survey the results obtained for these so-called graph generators. This chapter is partially based on [43 SPP].
5
Yoshida, Yuichi. "Constant-Time Algorithms for Continuous Optimization Problems." In Sublinear Computation Paradigm, 31–45. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4095-7_3.
Повний текст джерелаАнотація:
AbstractIn this chapter, we consider constant-time algorithms for continuous optimization problems. Specifically, we consider quadratic function minimization and tensor decomposition, both of which have numerous applications in machine learning and data mining. The key component in our analysis is graph limit theory, which was originally developed to study graphs analytically.
6
Havlena, Vojtěch, Ondřej Lengál, Yong Li, Barbora Šmahlíková, and Andrea Turrini. "Modular Mix-and-Match Complementation of Büchi Automata." In Tools and Algorithms for the Construction and Analysis of Systems, 249–70. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_13.
Повний текст джерелаАнотація:
AbstractComplementation of nondeterministic Büchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis of programs, model checking, or in decision procedures of some logics. We build on ideas from a recent work on BA determinization by Li et al. and propose a new modular algorithm for BA complementation. Our algorithm allows to combine several BA complementation procedures together, with one procedure for a subset of the BA’s strongly connected components (SCCs). In this way, one can exploit the structure of particular SCCs (such as when they are inherently weak or deterministic) and use more efficient specialized algorithms, regardless of the structure of the whole BA. We give a general framework into which partial complementation procedures can be plugged in, and its instantiation with several algorithms. The framework can, in general, produce a complement with an Emerson-Lei acceptance condition, which can often be more compact. Using the algorithm, we were able to establish an exponentially better new upper bound of $$\mathcal {O}(4^n)$$ O ( 4 n ) for complementation of the recently introduced class of elevator automata. We implemented the algorithm in a prototype and performed a comprehensive set of experiments on a large set of benchmarks, showing that our framework complements well the state of the art and that it can serve as a basis for future efficient BA complementation and inclusion checking algorithms.
7
Cortes, João, Inês Lynce, and Vasco Manquinho. "New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization." In Tools and Algorithms for the Construction and Analysis of Systems, 55–73. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_7.
Повний текст джерелаАнотація:
Abstract In the last decade, numerous algorithms for single-objective Boolean optimization have been proposed that rely on the iterative usage of a highly effective Propositional Satisfiability (SAT) solver. But the use of SAT solvers in Multi-Objective Combinatorial Optimization (MOCO) algorithms is still scarce. Due to this shortage of efficient tools for MOCO, many real-world applications formulated as multi-objective are simplified to single-objective, using either a linear combination or a lexicographic ordering of the objective functions to optimize.In this paper, we extend the state of the art of MOCO solvers with two novel unsatisfiability-based algorithms. The first is a core-guided MOCO solver. The second is a hitting set-based MOCO solver. Experimental results in several sets of benchmark instances show that our new unsatisfiability-based algorithms can outperform state-of-the-art SAT-based algorithms for MOCO.
8
Greiner-Petter, André, Howard S. Cohl, Abdou Youssef, Moritz Schubotz, Avi Trost, Rajen Dey, Akiko Aizawa, and Bela Gipp. "Comparative Verification of the Digital Library of Mathematical Functions and Computer Algebra Systems." In Tools and Algorithms for the Construction and Analysis of Systems, 87–105. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_5.
Повний текст джерелаАнотація:
AbstractDigital mathematical libraries assemble the knowledge of years of mathematical research. Numerous disciplines (e.g., physics, engineering, pure and applied mathematics) rely heavily on compendia gathered findings. Likewise, modern research applications rely more and more on computational solutions, which are often calculated and verified by computer algebra systems. Hence, the correctness, accuracy, and reliability of both digital mathematical libraries and computer algebra systems is a crucial attribute for modern research. In this paper, we present a novel approach to verify a digital mathematical library and two computer algebra systems with one another by converting mathematical expressions from one system to the other. We use our previously developed conversion tool (referred to as "Image missing" ) to translate formulae from the NIST Digital Library of Mathematical Functions to the computer algebra systems and . The contributions of our presented work are as follows: (1) we present the most comprehensive verification of computer algebra systems and digital mathematical libraries with one another; (2) we significantly enhance the performance of the underlying translator in terms of coverage and accuracy; and (3) we provide open access to translations for and of the formulae in the NIST Digital Library of Mathematical Functions.
9
Tasneem, Rayeesa, and M. A. Jabbar. "An Insight into Load Balancing in Cloud Computing." In Proceeding of 2021 International Conference on Wireless Communications, Networking and Applications, 1125–40. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2456-9_113.
Повний текст джерелаАнотація:
AbstractCloud Computing has emerged as a High-performance computing model providing on-demand computing resources as services via the Internet. Services include applications, storage, processing power, allocation of resources and many more. It is a pay-per-use model. Despite of providing various services, it is also experiencing numerous challenges like data security, optimized resource utilization, performance management, cost management, Cloud migration and many more. Among all, Load Balancing is another key challenge faced by Cloud. Effective load balancing mechanism will optimize the utilization of resources and improve the cloud performance. Load balancing is a mechanism to identify the overloaded and under loaded nodes and then balance the load by uniformly distributing the workload among the nodes. Various load balancing mechanisms are proposed by various researchers by taking different performance metrics. However existing load balancing algorithms are suffering from various drawbacks. This paper emphasizes the comparative review of various algorithms on Load Balancing along with their advantages, shortcomings and mathematical models.
10
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. "Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis." In Programming Languages and Systems, 112–40. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_5.
Повний текст джерелаАнотація:
AbstractInterprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summaries are created, and (ii) an online (or query) phase, where analysis queries arrive on demand and the summaries are used to speed up answering queries.In this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are embarrassingly parallelizable, i.e. the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques.
Тези доповідей конференцій з теми "NUMEROUS ALGORITHMS"
1
Saraswat, Shipra, Neetu Faujdar, and Sachin Sharma. "Comparative Examination of Fake News Recognition Using an Ensemble of Numerous Machine Learning Algorithms." In 2023 6th International Conference on Information Systems and Computer Networks (ISCON). IEEE, 2023. http://dx.doi.org/10.1109/iscon57294.2023.10111965.
Повний текст джерела
2
Kwong, John Chris T., Felan Carlo C. Garcia, Patricia Angela R. Abu, and Rosula S. J. Reyes. "Emotion Recognition via Facial Expression: Utilization of Numerous Feature Descriptors in Different Machine Learning Algorithms." In TENCON 2018 - 2018 IEEE Region 10 Conference. IEEE, 2018. http://dx.doi.org/10.1109/tencon.2018.8650192.
Повний текст джерела
3
Kanungo, T., M. Y. Jaisimha, J. Palmer, and R. M. Haralick. "Methodology for analyzing the performance of detection tasks." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1992. http://dx.doi.org/10.1364/oam.1992.fcc3.
Повний текст джерелаАнотація:
There has been increasing interest in quantitative performance evaluation of computer vision algorithms. The usual method is to vary parameters of the input images or parameters of the algorithms and then construct operating curves that relate the probability of misdetection and false alarm for each parameter setting. Such an analysis does not integrate the performance of the numerous operating curves. In this paper we outline a methodology for summarizing many operating curves into a few performance curves. This methodology is adapted from the human psychophysics literature and is general to any detection algorithm. We demonstrated the methodology by comparing the performance of two line detection algorithms. The task was to detect the presence or absence of a vertical edge in the middle of an image containing a grating mask and additive Gaussian noise. We compared the Burns line finder and an algorithm using the facet edge detector and the Hough transform. To determine each algorithm's performance curve, we estimated the contrast necessary for an unbiased 75% correct detection as a function of the orientation of the grating mask. These functions were further characterized in terms of the algorithm's orientation selectivity and overall performance. An algorithm with the best overall performance need not have the best orientation selectivity. These performance curves can be used to optimize the design of algorithms.
4
Zhang, Yihan, Meikang Qiu, and Hongchang Gao. "Communication-Efficient Stochastic Gradient Descent Ascent with Momentum Algorithms." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/512.
Повний текст джерелаАнотація:
Numerous machine learning models can be formulated as a stochastic minimax optimization problem, such as imbalanced data classification with AUC maximization. Developing efficient algorithms to optimize such kinds of problems is of importance and necessity. However, most existing algorithms restrict their focus on the single-machine setting so that they are incapable of dealing with the large communication overhead in a distributed training system. Moreover, most existing communication-efficient optimization algorithms only focus on the traditional minimization problem, failing to handle the minimax optimization problem. To address these challenging issues, in this paper, we develop two novel communication-efficient stochastic gradient descent ascent with momentum algorithms for the distributed minimax optimization problem, which can significantly reduce the communication cost via the two-way compression scheme. However, the compressed momentum makes it considerably challenging to investigate the convergence rate of our algorithms, especially in the presence of the interaction between the minimization and maximization subproblems. In this paper, we successfully addressed these challenges and established the convergence rate of our algorithms for nonconvex-strongly-concave problems. To the best of our knowledge, our algorithms are the first communication-efficient algorithm with theoretical guarantees for the minimax optimization problem. Finally, we apply our algorithm to the distributed AUC maximization problem for the imbalanced data classification task. Extensive experimental results confirm the efficacy of our algorithm in saving communication costs.
5
Shellshear, Evan, Johan S. Carlson, and Robert Bohlin. "A Combinatorial Packing Algorithm and Standard Trunk Geometry for ISO Luggage Packing." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70778.
Повний текст джерелаАнотація:
Automated packing algorithms for luggage compartments in automobiles are of great interest. The difficulty of automatically computing the volume of a mesh representation of a boot according to the ISO 3832 standard restricts the design of vehicles required to meet minimal trunk volume specifications and also increases the cost of physical and virtual verification of the original design specifications. In our paper we present a new heuristic combinatorial packing algorithm for the ISO luggage packing standard. The algorithm presents numerous advantages over previous algorithms in terms of its simplicity and speed as well as producing high density of packed objects. The algorithm also solves the problem of requiring a fixed grid structure to position discrete objects in the boot and can also be used as an additional optimization on existing algorithms. In addition, we also provide the first comparison of state of the art packing algorithms for a simplified trunk geometry and propose a standard trunk geometry to enable future researchers to compare their results with other packing algorithms.
6
Gou, J. B., Y. X. Chu, and Z. X. Li. "A Geometric Theory for Form, Profile and Orientation Tolerances: Evaluation Algorithms and Simulation Results." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/dfm-5744.
Повний текст джерелаАнотація:
Abstract Using the geometric theory for formulation of form, profile and orientation tolerances, we develop a simple geometric algorithm, called the Symmetric Minimum Zone (SMZ) algorithm, to unify the computation of form, profile and orientation tolerances. First, using a technique of numerical analysis, we transform the non-differentiable minimization problem into a differentiable minimization problem over an extended configuration space. Then, we solve the latter problem by computing the solutions of a sequence of linear programming problems which can be easily derived using the geometric properties of SE(3)/G0. The SMZ algorithm is incorporated into a software package called GTPack for tolerance verification. Numerous simulation experiments show that the SMZ algorithm has several important features which could lead to its rapid acceptance in the industry: (1) consistency with the Y14.5M standard, (2) computational efficiency, (3) robustness with respect to variations in initial conditions; and (4) implementational simplicity. We also give extensive simulation results comparing the performances of the SMZ algorithm against the best known algorithms in the literature.
7
Aslanides, John, Jan Leike, and Marcus Hutter. "Universal Reinforcement Learning Algorithms: Survey and Experiments." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/194.
Повний текст джерелаАнотація:
Many state-of-the-art reinforcement learning (RL) algorithms typically assume that the environment is an ergodic Markov Decision Process (MDP). In contrast, the field of universal reinforcement learning (URL) is concerned with algorithms that make as few assumptions as possible about the environment. The universal Bayesian agent AIXI and a family of related URL algorithms have been developed in this setting. While numerous theoretical optimality results have been proven for these agents, there has been no empirical investigation of their behavior to date. We present a short and accessible survey of these URL algorithms under a unified notation and framework, along with results of some experiments that qualitatively illustrate some properties of the resulting policies, and their relative performance on partially-observable gridworld environments. We also present an open- source reference implementation of the algorithms which we hope will facilitate further understanding of, and experimentation with, these ideas.
8
West, A. C., and S. A. Sherif. "Optimization of Multistage Vapor Compression Systems Employing Genetic Algorithms." In ASME 2005 Summer Heat Transfer Conference collocated with the ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems. ASMEDC, 2005. http://dx.doi.org/10.1115/ht2005-72695.
Повний текст джерелаАнотація:
Genetic algorithms involve the coding of a solution into a binary string in the same manner that DNA is a biological coding. A population of binary strings are randomly created, evaluated, allowed to mate, and mutated to form a new generation of strings. There is a mating preference given to those strings which rate the highest to simulate the survival of the fittest theory that exists in nature. This process of evaluation, mating, and mutation is repeated until some termination criteria are met. A computer code was written to simulate the vapor compression systems and perpetuate the genetic algorithm. The genetic algorithm functioned adequately enough to provide general trends but it did not find a universal optimum. After numerous runs, the code produced data that suggest that systems which employ intercooler/flash tanks and operate at lower evaporating temperatures have a higher multistage effectiveness. Multistage effectiveness is a novel term defined as the ratio of the overall coefficient of performance (COP) of the multistage system and the combined coefficient of performance of a group of basic vapor compression systems with cooling capacities and evaporating temperatures that parallel the evaporators in the multistage system.
9
Matsugu, Shohei, Yasuhiro Fujiwara, and Hiroaki Shiokawa. "Uncovering the Largest Community in Social Networks at Scale." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/250.
Повний текст джерелаАнотація:
The Maximum k-Plex Search (MPS) can find the largest k-plex, which is a generalization of the largest clique. Although MPS is commonly used in AI to effectively discover real-world communities of social networks, existing MPS algorithms suffer from high computational costs because they iteratively scan numerous nodes to find the largest k-plex. Here, we present an efficient MPS algorithm called Branch-and-Merge (BnM), which outputs an exact maximum k-plex. BnM merges unnecessary nodes to explore a smaller graph than the original one. Extensive evaluations on real-world social networks demonstrate that BnM significantly outperforms other state-of-the-art MPS algorithms in terms of running time.
10
Tian, Yinghui, and Mark J. Cassidy. "Explicit and Implicit Integration Algorithms for an Elastoplastic Pipe-Soil Interaction Macroelement Model." In ASME 2008 27th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2008. http://dx.doi.org/10.1115/omae2008-57237.
Повний текст джерелаАнотація:
This paper presents the numerical formulation of an elastoplastic force-resultant model to numerically simulate the interaction of a pipe with the soil. This approach, which accounts for the load-displacement behaviour of the pipe-soil system on a macroelement level, is becoming increasingly popular in offshore engineering. The model consists of a yield surface, a non-associated flow rule, an isotropic hardening law and a description of purely elastic behaviour. It can be used to predict the behavior of one segment of pipe or numerous models can be attached to structural finite elements as nodal point elements. The latter allows the practical analysis of long pipelines. Further, by removing a number of macroelements from the pipeline, the effect of free span can be studied. To numerically incorporate large numbers of macroelements into a structural analysis, efficient and robust integration algorithms are essential. The use of both explicit and implicit integration algorithms are explored in this paper. In the explicit algorithm, the Euler forward integration scheme is adopted to achieve the real force state incrementally for each substep. On the other hand, the Euler backward integration scheme is adopted in the implicit algorithm. In this case the load state is iteratively “returned” back to the yield surface according to the end of the total displacement increment. Illustrative calculation examples are provided in this paper to demonstrate and compare the performance of the suggested algorithms.
Звіти організацій з теми "NUMEROUS ALGORITHMS"
1
Lorenz, Markus. Auswirkungen des Decoy-Effekts auf die Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850013.
Повний текст джерелаАнотація:
Limitations in the human decision-making process restrict the technological potential of algorithms, which is also referred to as "algorithm aversion". This study uses a laboratory experiment with participants to investigate whether a phenomenon known since 1982 as the "decoy effect" is suitable for reducing algorithm aversion. For numerous analogue products, such as cars, drinks or newspaper subscriptions, the Decoy Effect is known to have a strong influence on human decision-making behaviour. Surprisingly, the decisions between forecasts by humans and Robo Advisors (algorithms) investigated in this study are not influenced by the Decoy Effect at all. This is true both a priori and after observing forecast errors.
2
Breton, Daniel. A study on the Delta-Bullington irregular terrain radiofrequency propagation model : assessing model suitability for use in decision support tools. Engineer Research and Development Center (U.S.), January 2022. http://dx.doi.org/10.21079/11681/42780.
Повний текст джерелаАнотація:
Modeling the propagation of radiofrequency signals over irregular terrain is both challenging and critically important in numerous Army applications. One application of particular importance is the performance and radio connectivity of sensors deployed in scenarios where the terrain and the environment significantly impact signal propagation. This report investigates both the performance of and the algorithms and assumptions underlying the Delta-Bullington irregular terrain radiofrequency propagation model discussed in International Telecommunications Union Recommendation P.526-15. The aim is to determine its suitability for use within sensor-planning decision support tools. After reviewing free-space, spherical earth diffraction, and terrain obstacle diffraction losses, the report dis-cusses several important tests of the model, including reciprocity and geographic continuity of propagation loss over large areas of rugged terrain. Overall, the Delta-Bullington model performed well, providing reasonably rapid and geographically continuous propagation loss estimates with computational demands appropriate for operational use.
3
Grace, Dr Golla Reethi Shiny, Dr Anu K., Dr Pratyusha Choudary G., and Dr M. v. PATTERN OF THE HEMATOLOGICAL PARAMETERS IN COVID-19 PATIENTS. World Wide Journals, February 2023. http://dx.doi.org/10.36106/ijar/5106302.
Повний текст джерелаАнотація:
Background: The coronavirus (SARS CoV 2)-related viral disease COVID 19 causes acute respiratory disease with severe symptoms. Numerous biomarkers of infection and inammation have been found to inuence the severity of disease. Acute respiratory infection, fever, pneumonia, cough, tiredness, and inammation are frequent clinical ndings during hospitalisation. The severity of the disease and a possibility of disease progression can be determined by circulating biomarkers like TWBC count, NLR and CRP that reect inammation. This is a retrospective study conducted on eight Material and Methods: y COVID-19 positive patients admitted at Dr.Pinnamaneni Siddhartha Institute of Medical Sciences & RF, ChinnaAvutapally from 1st January 2021 to 30th June 2021. Results: Among the 80 COVID 19 patients studied, there are 63% males and 37% females. 46% of patients showed leucocytosis, 43% showed increased NLR and 60 % showed raised CRP. Hematological parameters in COVID 19 are important for di Conclusion: agnosis, complication management, prognosis, and patient recovery. These parameters must be effectively integrated into clinical algorithms and therapeutic decision making in addition to clinical assessment
4
Pound, B. G. GRI-99-0000 Gap Analysis of the GRI Research Program on Internal Corrosion. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), December 1999. http://dx.doi.org/10.55274/r0010720.
Повний текст джерелаАнотація:
Extensive information on the corrosion of steel in aqueous CO2 systems is now available from this program and numerous other sources. This information was reviewed to identify what research has been performed and what research remains to be undertaken to develop a expert system/risk management program. Four areas were examined: corrosion mechanisms, mitigation strategies, monitoring techniques, and models/risk assessment. There were five gaps in mechanisms (two for bacteria and one each for flow rate/chloride concentration, hydrocarbons, and organic acids) and four gaps in mitigation (antibiofilm additives, antibacterial corrosion inhibitors, antibiofilm coatings, and UV light). Monitoring techniques have one principal gap, which is the lack of a single sensor that can indicate the type of corrosion and whether bacteria are involved. Various gaps were found in the approaches used for modeling and risk assessment: semiempirical and mechanistic models (deficient in their ability to treat films, H2S, and bacteria); thermodynamic models (incomplete range of key chemical species); statistical models (limited testing); probabilistic risk assessment (lack of usable data); and ranking risk assessment (lack of appropriate algorithms for internal corrosion).
5
Saltus, Christina, Molly Reif, and Richard Johansen. waterquality for ArcGIS Pro Toolbox. Engineer Research and Development Center (U.S.), October 2021. http://dx.doi.org/10.21079/11681/42240.
Повний текст джерелаАнотація:
Monitoring water quality of small inland lakes and reservoirs is a critical component of USACE water quality management plans. However, limited resources for traditional field-based monitoring of numerous lakes and reservoirs that cover vast geographic areas often leads to reactional responses to harmful algal bloom (HAB) outbreaks. Satellite remote sensing methodologies using HAB indicators is a good low-cost option to traditional methods and has been proven to maximize and complement current field-based approaches while providing a synoptic view of water quality (Beck et al. 2016; Beck et al. 2017; Beck et al. 2019; Johansen et al. 2019; Mishra et al. 2019; Stumpf and Tomlinson 2007; Wang et al. 2020; Xu et al. 2019; Reif 2011). To assist USACE water quality management, we developed an ESRI ArcGIS Pro desktop software toolbox (waterquality for ArcGIS Pro) that was founded on the design and research established in the waterquality R software package (Johansen et al. 2019; Johansen 2020). The toolbox enables the detection, monitoring, and quantification of HAB indicators (chlorophyll-a, phycocyanin, and turbidity) using Sentinel-2 satellite imagery. Four tools are available 1) to automate the download of Sentinel-2 Level-2A imagery, 2) to create stacked image with options for cloud and non-water features masks, 3) to apply water quality algorithms to generate relative estimations of one to three water quality parameters (chlorophyll-a, phycocyanin, and turbidity), and 4) to create linear regression graphs and statistics comparing in situ data (from field-based water sampling) to relative estimation data. This document serves as a user's guide for the waterquality for ArcGIS Pro toolbox and includes instructions on toolbox installation and descriptions of each tool's inputs, outputs, and troubleshooting guidance.
6
Saltus, Christina, Molly Reif, and Richard Johansen. waterquality for ArcGIS Pro Toolbox : user's guide. Engineer Research and Development Center (U.S.), September 2022. http://dx.doi.org/10.21079/11681/45362.
Повний текст джерелаАнотація:
Monitoring water quality of small inland lakes and reservoirs is a critical component of the US Army Corps of Engineers (USACE) water quality management plans. However, limited resources for traditional field-based monitoring of numerous lakes and reservoirs covering vast geographic areas often leads to reactional responses to harmful algal bloom (HAB) outbreaks. Satellite remote sensing methodologies using HAB indicators is a good low-cost option to traditional methods and has been proven to maximize and complement current field-based approaches while providing a synoptic view of water quality (Beck et al. 2016; Beck et al. 2017; Beck et al. 2019; Johansen et al. 2019; Mishra et al. 2019; Stumpf and Tomlinson 2007; Wang et al. 2020; Xu et al. 2019; Reif 2011). To assist USACE water quality management, we developed an Environmental Systems Research Institute (ESRI) ArcGIS Pro desktop software toolbox (waterquality for ArcGIS Pro) founded on the design and research established in the waterquality R software package (Johansen et al. 2019; Johansen 2020). The toolbox enables the detection, monitoring, and quantification of HAB indicators (chlorophyll-a, phycocyanin, and turbidity) using Sentinel-2 satellite imagery. Four tools are available: (1) automating the download of Sentinel-2 Level-2A imagery, (2) creating stacked image with options for cloud and non-water features masks, (3) applying water quality algorithms to generate relative estimations of one to three water quality parameters (chlorophyll-a, phycocyanin, and turbidity), and (4) creating linear regression graphs and statistics comparing in situ data (from field-based water sampling) to relative estimation data. This document serves as a user’s guide for the waterquality for ArcGIS Pro toolbox and includes instructions on toolbox installation and descriptions of each tool’s inputs, outputs, and troubleshooting guidance.
7
Bourdeau, J. E., and R. D. Dyer. Regional-scale lake-sediment sampling and analytical protocols with examples from the Geological Survey of Canada. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331911.
Повний текст джерелаАнотація:
Regional-scale lake sediment surveys have been successfully used since the 1970s as a means for reconnaissance geochemical exploration. Lake sediment sampling is typically performed in areas with a lack of streams and an overabundance of small-sized (=5 km across) lakes. Lake sediments are known to have major, minor and trace element concentrations that reflect the local geology. Overall, lake sediment surveys are planned and conducted following four distinct stages: 1) background research, 2) orientation survey, 3) regional survey, and 4) detailed survey. At the Geological Survey of Canada, samples are usually collected from a helicopter with floats. Sample density ranges from 1 sample per 6 - 13 km2. Samples are collected from the centre of the lake using a gravity torpedo sampler which corresponds to a hollow-pipe, butterfly bottom-valved sampler attached by a rope to the helicopter. Collected sediment samples are then placed in labelled bags and left to air dry. Detailed field notes and additional samples (field duplicates), for the purpose of an adequate quality assurance and quality control program, are also taken. Samples are then milled and sent to analytical laboratories for element determination. Commonly used analytical methods include: X-ray fluorescence (XRF), atomic absorption spectroscopy (AAS), inductively coupled plasma-atomic emission spectrometry (ICP-AES) and -mass spectrometry (ICP-MS), instrumental neutron activation analysis (INAA), and/or determination of volatile compounds and organic carbon using Loss on Ignition (LOI). Analytical data is first evaluated for quality (contamination, accuracy and precision). Numerous options for the analysis of lake sediment data exist, ranging from simple basic element concentration maps and statistical graphical displays together with summary statistics, to employing multivariate methodologies, and, more recently, using machine learning algorithms. By adopting the set of guidelines and examples presented in this manual, scientific researchers, exploration geologists, geochemists and citizen scientists will be able to directly compare lake sediment datasets from anywhere in Canada.
8
Zhang, Yongping, Wen Cheng, and Xudong Jia. Enhancement of Multimodal Traffic Safety in High-Quality Transit Areas. Mineta Transportation Institute, February 2021. http://dx.doi.org/10.31979/mti.2021.1920.
Повний текст джерелаАнотація:
Numerous extant studies are dedicated to enhancing the safety of active transportation modes, but very few studies are devoted to safety analysis surrounding transit stations, which serve as an important modal interface for pedestrians and bicyclists. This study bridges the gap by developing joint models based on the multivariate conditionally autoregressive (MCAR) priors with a distance-oriented neighboring weight matrix. For this purpose, transit-station-centered data in Los Angeles County were used for model development. Feature selection relying on both random forest and correlation analyses was employed, which leads to different covariate inputs to each of the two jointed models, resulting in increased model flexibility. Utilizing an Integrated Nested Laplace Approximation (INLA) algorithm and various evaluation criteria, the results demonstrate that models with a correlation effect between pedestrians and bicyclists perform much better than the models without such an effect. The joint models also aid in identifying significant covariates contributing to the safety of each of the two active transportation modes. The research results can furnish transportation professionals with additional insights to create safer access to transit and thus promote active transportation.
9
Fourie and Tullmin. L51912 Corrosion-CP Monitoring of Locations Remote from a Test Station. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), April 2002. http://dx.doi.org/10.55274/r0010624.
Повний текст джерелаАнотація:
It is accepted that many situations exist on pipelines where a significant length of the pipeline (typically 2000 ft to 5 miles) is either totally inaccessible or access is so difficult or expensive that monitoring is not done at the required frequency. The need for finding a technique to allow the corrosion engineer to monitor CP levels of inaccessible locations from an accessible remote location has therefore been identified. A study to investigate all possible techniques available to achieve the above objective and to analyze typical scenarios requiring this approach has therefore been undertaken. Numerous techniques varying from pipe-to-soil type measurements, above ground current attenuation measurements, direct measurement of pipeline current, and measurement of the AC impedance response of the inaccessible section of pipeline were identified. In addition, some novel remote monitoring methods applicable to hostile inaccessible locations were identified. Analysis of these techniques in relation to the problem lead to the development of an algorithm to facilitate the choice of possible techniques under specific conditions.