Bibliographies thématiques / Entropy algorithms

Sommaire

  1. Articles de revues
  2. Thèses
  3. Livres
  4. Chapitres de livres
  5. Actes de conférences
  6. Rapports d'organisations

Littérature scientifique sur le sujet « Entropy algorithms »

Auteur : Grafiati
Publié le 17 mai 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

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 « Entropy 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 "Entropy algorithms"

1

Li, Yancang, et Wanqing Li. « Adaptive Ant Colony Optimization Algorithm Based on Information Entropy : Foundation and Application ». Fundamenta Informaticae 77, no 3 (janvier 2007) : 229–42. https://doi.org/10.3233/fun-2007-77303.

Texte intégral
Résumé :
In order to solve the premature convergence problem of the basic Ant Colony Optimization algorithm, a promising modification based on the information entropy is proposed. The main idea is to evaluate stability of the current space of represented solutions using information entropy, which is then applied to turning of the algorithm's parameters. The path selection and evolutional strategy are controlled by the information entropy self-adaptively. Simulation study and performance comparison with other Ant Colony Optimization algorithms and other meta-heuristics on Traveling Salesman Problem show that the improved algorithm, with high efficiency and robustness, appears self -adaptive and can converge at the global optimum with a high probability. The work proposes a more general approach to evolutionary-adaptive algorithms related to the population's entropy and has significance in theory and practice for solving the combinatorial optimization problems.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Turlykozhayeva, D. A. « ROUTING METRIC AND PROTOCOL FOR WIRELESS MESH NETWORK BASED ON INFORMATION ENTROPY THEORY ». Eurasian Physical Technical Journal 20, no 4 (46) (19 décembre 2023) : 90–98. http://dx.doi.org/10.31489/2023no4/90-98.

Texte intégral
Résumé :
In this work, the authors propose a routing algorithm based on information entropy theory for calculating the metric, considering theprobability of packet loss. Information entropy theory serves as a robust foundation for evaluating uncertainty and disorder in data transmission, facilitating the development of a more resilient and intelligent routing strategy. In contrast to existing algorithms, the proposed approach enables a more accurate assessment of data transmission quality within the network, optimizing the routing process for maximum efficiency. The experimental results demonstrate a significant enhancement in network service quality while maintaining high performance. To validate the algorithm's effectiveness, a series of experiments were conducted, evaluating key performance metrics such as throughput, delay, and packet loss. A comparative analysis with established routing algorithms was also carried out, allowing for the assessment of advantages and drawbacks in relation to well-known algorithms. The findings suggest that the proposed algorithm surpasses traditional routing methods in optimizing data transmission quality and overall network efficiency.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Zhang, Chuang, Yue-Han Pei, Xiao-Xue Wang, Hong-Yu Hou et Li-Hua Fu. « Symmetric cross-entropy multi-threshold color image segmentation based on improved pelican optimization algorithm ». PLOS ONE 18, no 6 (29 juin 2023) : e0287573. http://dx.doi.org/10.1371/journal.pone.0287573.

Texte intégral
Résumé :
To address the problems of low accuracy and slow convergence of traditional multilevel image segmentation methods, a symmetric cross-entropy multilevel thresholding image segmentation method (MSIPOA) with multi-strategy improved pelican optimization algorithm is proposed for global optimization and image segmentation tasks. First, Sine chaotic mapping is used to improve the quality and distribution uniformity of the initial population. A spiral search mechanism incorporating a sine cosine optimization algorithm improves the algorithm’s search diversity, local pioneering ability, and convergence accuracy. A levy flight strategy further improves the algorithm’s ability to jump out of local minima. In this paper, 12 benchmark test functions and 8 other newer swarm intelligence algorithms are compared in terms of convergence speed and convergence accuracy to evaluate the performance of the MSIPOA algorithm. By non-parametric statistical analysis, MSIPOA shows a greater superiority over other optimization algorithms. The MSIPOA algorithm is then experimented with symmetric cross-entropy multilevel threshold image segmentation, and eight images from BSDS300 are selected as the test set to evaluate MSIPOA. According to different performance metrics and Fridman test, MSIPOA algorithm outperforms similar algorithms in global optimization and image segmentation, and the symmetric cross entropy of MSIPOA algorithm for multilevel thresholding image segmentation method can be effectively applied to multilevel thresholding image segmentation tasks.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Manis, George, Md Aktaruzzaman et Roberto Sassi. « Low Computational Cost for Sample Entropy ». Entropy 20, no 1 (13 janvier 2018) : 61. http://dx.doi.org/10.3390/e20010061.

Texte intégral
Résumé :
Sample Entropy is the most popular definition of entropy and is widely used as a measure of the regularity/complexity of a time series. On the other hand, it is a computationally expensive method which may require a large amount of time when used in long series or with a large number of signals. The computationally intensive part is the similarity check between points in m dimensional space. In this paper, we propose new algorithms or extend already proposed ones, aiming to compute Sample Entropy quickly. All algorithms return exactly the same value for Sample Entropy, and no approximation techniques are used. We compare and evaluate them using cardiac inter-beat (RR) time series. We investigate three algorithms. The first one is an extension of the k d -trees algorithm, customized for Sample Entropy. The second one is an extension of an algorithm initially proposed for Approximate Entropy, again customized for Sample Entropy, but also improved to present even faster results. The last one is a completely new algorithm, presenting the fastest execution times for specific values of m, r, time series length, and signal characteristics. These algorithms are compared with the straightforward implementation, directly resulting from the definition of Sample Entropy, in order to give a clear image of the speedups achieved. All algorithms assume the classical approach to the metric, in which the maximum norm is used. The key idea of the two last suggested algorithms is to avoid unnecessary comparisons by detecting them early. We use the term unnecessary to refer to those comparisons for which we know a priori that they will fail at the similarity check. The number of avoided comparisons is proved to be very large, resulting in an analogous large reduction of execution time, making them the fastest algorithms available today for the computation of Sample Entropy.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Liu, Jing, Huibin Lu, Xiuru Zhang, Xiaoli Li, Lei Wang, Shimin Yin et Dong Cui. « Which Multivariate Multi-Scale Entropy Algorithm Is More Suitable for Analyzing the EEG Characteristics of Mild Cognitive Impairment ? » Entropy 25, no 3 (21 février 2023) : 396. http://dx.doi.org/10.3390/e25030396.

Texte intégral
Résumé :
So far, most articles using the multivariate multi-scale entropy algorithm mainly use algorithms to analyze the multivariable signal complexity without clearly describing what characteristics of signals these algorithms measure and what factors affect these algorithms. This paper analyzes six commonly used multivariate multi-scale entropy algorithms from a new perspective. It clarifies for the first time what characteristics of signals these algorithms measure and which factors affect them. It also studies which algorithm is more suitable for analyzing mild cognitive impairment (MCI) electroencephalograph (EEG) signals. The simulation results show that the multivariate multi-scale sample entropy (mvMSE), multivariate multi-scale fuzzy entropy (mvMFE), and refined composite multivariate multi-scale fuzzy entropy (RCmvMFE) algorithms can measure intra- and inter-channel correlation and multivariable signal complexity. In the joint analysis of coupling and complexity, they all decrease with the decrease in signal complexity and coupling strength, highlighting their advantages in processing related multi-channel signals, which is a discovery in the simulation. Among them, the RCmvMFE algorithm can better distinguish different complexity signals and correlations between channels. It also performs well in anti-noise and length analysis of multi-channel data simultaneously. Therefore, we use the RCmvMFE algorithm to analyze EEG signals from twenty subjects (eight control subjects and twelve MCI subjects). The results show that the MCI group had lower entropy than the control group on the short scale and the opposite on the long scale. Moreover, frontal entropy correlates significantly positively with the Montreal Cognitive Assessment score and Auditory Verbal Learning Test delayed recall score on the short scale.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Ji, Binghui, Xiaona Sun, Peimiao Chen, Siyu Wang, Shangfa Song et Bo He. « An Integrated Navigation Algorithm for Underwater Vehicles Improved by a Variational Bayesian and Minimum Mixed Error Entropy Unscented Kalman Filter ». Electronics 13, no 23 (29 novembre 2024) : 4727. http://dx.doi.org/10.3390/electronics13234727.

Texte intégral
Résumé :
In complex marine environments, autonomous underwater vehicles (AUVs) rely on robust navigation and positioning. Traditional algorithms face challenges from sensor outliers and non-Gaussian noise, leading to significant prediction errors and filter divergence. Outliers in sensor observations also impact positioning accuracy. The original unscented Kalman filter (UKF) based on the minimum mean square error (MMSE) criterion suffers from performance degradation under these conditions. This paper enhances the minimum error entropy unscented Kalman filter algorithm using variational Bayesian (VB) methods and mixed entropy functions. By implementing minimum error entropy (MEE) and mixed kernel functions in the UKF, the algorithm’s robustness under complex underwater conditions is improved. The VB method adaptively fits the measurement noise covariance, enhancing adaptability to marine environments. Simulations and sea trials validate the proposed algorithm’s performance, showing significant improvements in navigation accuracy and root mean square error (RMSE). In environments with complex noise, our algorithm improves the overall navigation accuracy by at least 10% over other existing algorithms. This demonstrates the high accuracy and robustness of the algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Du, Xinzhi. « A Robust and High-Dimensional Clustering Algorithm Based on Feature Weight and Entropy ». Entropy 25, no 3 (16 mars 2023) : 510. http://dx.doi.org/10.3390/e25030510.

Texte intégral
Résumé :
Since the Fuzzy C-Means algorithm is incapable of considering the influence of different features and exponential constraints on high-dimensional and complex data, a fuzzy clustering algorithm based on non-Euclidean distance combining feature weights and entropy weights is proposed. The proposed algorithm is based on the Fuzzy C-Means soft clustering algorithm to deal with high-dimensional and complex data. The objective function of the new algorithm is modified with the help of two different entropy terms and a non-Euclidean way of computing the distance. The distance calculation formula enhances the efficiency of extracting the contribution of different features. The first entropy term helps to minimize the clusters’ dispersion and maximize the negative entropy to control the clustering process, which also promotes the association between the samples. The second entropy term helps to control the weights of features since different features have different weights in the clustering process. Experiments on real-world datasets indicate that the proposed algorithm gives better clustering results than other algorithms. The experiments demonstrate the proposed algorithm’s robustness by analyzing the parameters’ sensitivity and comparing the computational distance formulas. In summary, the improved algorithm improves classification performance under noisy interference and high-dimensional datasets, increases computational efficiency, performs well in real-world high-dimensional datasets, and encourages the development of robust noise-resistant high-dimensional fuzzy clustering algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Morozov, Denys. « Polynomial Representation of Binary Trees of Entropy Binary Codes ». Mohyla Mathematical Journal 4 (19 mai 2022) : 20–23. http://dx.doi.org/10.18523/2617-70804202120-23.

Texte intégral
Résumé :
An important component of streaming large amounts of information are algorithms for compressing information flow. Which in turn are divided into lossless compression algorithms (entropic) - Shannon, Huffman, arithmetic coding, conditional compression - LZW, and otherinformation cone injections and lossy compression algorithms - such as mp3, jpeg and others. It is important to follow a formal strategy when building a lossy compression algorithm. It can be formulated as follows. After describing the set of objects that are atomic elements of exchange in the information flow, it is necessary to build an abstract scheme of this description, which will determine the boundary for abstract sections of this scheme, which begins the allowable losses. Approaches to the detection of an abstract scheme that generates compression algorithms with allowable losses can be obtained from the context of the subject area. For example, an audio stream compression algorithm can divide a signal into simple harmonics and leave among them those that are within a certain range of perception. Thus, the output signal is a certain abstraction of the input, which contains important information in accordance with the context of auditory perception of the audio stream and is represented by less information. A similar approach is used in the mp3 format, which is a compressed representation. Unlike lossy compression algorithms, entropic compression algorithms do not require contextanalysis, but can be built according to the frequency picture. Among the known algorithms for constructing such codes are the Shannon-Fano algorithm, the Huffman algorithm and arithmetic coding. Finding the information entropy for a given Shannon code is a trivial task. The inverse problem, namely finding the appropriate Shannon codes that have a predetermined entropy and with probabilities that are negative integer powers of two, is quite complex. It can be solved by direct search, but a significant disadvantage of this approach is its computational complexity. This article offers an alternative technique for finding such codes.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Crysdian, Cahyo. « The Evaluation of Entropy-based Algorithm towards the Production of Closed-Loop Edge ». JOIV : International Journal on Informatics Visualization 7, no 4 (31 décembre 2023) : 2481. http://dx.doi.org/10.62527/joiv.7.4.1727.

Texte intégral
Résumé :
This research concerns the common problem of edge detection that produces a disjointed and incomplete edge, leading to the misdetection of visual objects. The entropy-based algorithm can potentially solve this problem by classifying the pixel belonging to which objects in an image. Hence, the paper aims to evaluate the performance of entropy-based algorithm to produce the closed-loop edge representing the formation of object boundary. The research utilizes the concept of Entropy to sense the uncertainty of pixel membership to the existing objects to classify pixels as the edge or object. Six entropy-based algorithms are evaluated, i.e., the optimum Entropy based on Shannon formula, the optimum of relative-entropy based on Kullback-Leibler divergence, the maximum of optimum entropy neighbor, the minimum of optimum relative-entropy neighbor, the thinning of optimum entropy neighbor, and the thinning of optimum relative-entropy neighbor. The experiment is held to compare the developed algorithms against Canny as a benchmark by employing five performance parameters, i.e., the average number of detected objects, the average number of detected edge pixels, the average size of detected objects, the ratio of the number of edge pixel per object, and the average of ten biggest sizes. The experiment shows that the entropy-based algorithms significantly improve the production of closed-loop edges, and the optimum of relative-entropy neighbor based on Kullback-Leibler divergence becomes the most desired approach among others due to the production of more considerable closed-loop edge in the average. This finding suggests that the entropy-based algorithm is the best choice for edge-based segmentation. The effectiveness of Entropy in the segmentation task is addressed for further research.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Crysdian, Cahyo. « The Evaluation of Entropy-based Algorithm towards the Production of Closed-Loop Edge ». JOIV : International Journal on Informatics Visualization 7, no 4 (31 décembre 2023) : 2481. http://dx.doi.org/10.30630/joiv.7.4.01727.

Texte intégral
Résumé :
This research concerns the common problem of edge detection that produces a disjointed and incomplete edge, leading to the misdetection of visual objects. The entropy-based algorithm can potentially solve this problem by classifying the pixel belonging to which objects in an image. Hence, the paper aims to evaluate the performance of entropy-based algorithm to produce the closed-loop edge representing the formation of object boundary. The research utilizes the concept of Entropy to sense the uncertainty of pixel membership to the existing objects to classify pixels as the edge or object. Six entropy-based algorithms are evaluated, i.e., the optimum Entropy based on Shannon formula, the optimum of relative-entropy based on Kullback-Leibler divergence, the maximum of optimum entropy neighbor, the minimum of optimum relative-entropy neighbor, the thinning of optimum entropy neighbor, and the thinning of optimum relative-entropy neighbor. The experiment is held to compare the developed algorithms against Canny as a benchmark by employing five performance parameters, i.e., the average number of detected objects, the average number of detected edge pixels, the average size of detected objects, the ratio of the number of edge pixel per object, and the average of ten biggest sizes. The experiment shows that the entropy-based algorithms significantly improve the production of closed-loop edges, and the optimum of relative-entropy neighbor based on Kullback-Leibler divergence becomes the most desired approach among others due to the production of more considerable closed-loop edge in the average. This finding suggests that the entropy-based algorithm is the best choice for edge-based segmentation. The effectiveness of Entropy in the segmentation task is addressed for further research.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Entropy algorithms"

1

Höns, Robin. « Estimation of distribution algorithms and minimum relative entropy ». [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980407877.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Luo, Shen. « Interior-Point Algorithms Based on Primal-Dual Entropy ». Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1181.

Texte intégral
Résumé :
We propose a family of search directions based on primal-dual entropy in the context of interior point methods for linear programming. This new family contains previously proposed search directions in the context of primal-dual entropy. We analyze the new family of search directions by studying their primal-dual affine-scaling and constant-gap centering components. We then design primal-dual interior-point algorithms by utilizing our search directions in a homogeneous and self-dual framework. We present iteration complexity analysis of our algorithms and provide the results of computational experiments on NETLIB problems.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Fellman, Laura Suzanne. « The Genetic Algorithm and Maximum Entropy Dice ». PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5247.

Texte intégral
Résumé :
The Brandeis dice problem, originally introduced in 1962 by Jaynes as an illustration of the principle of maximum entropy, was solved using the genetic algorithm, and the resulting solution was compared with that obtained analytically. The effect of varying the genetic algorithm parameters was observed, and the optimum values for population size, mutation rate, and mutation interval were determined for this problem. The optimum genetic algorithm program was then compared to a completely random method of search and optimization. Finally, the genetic algorithm approach was extended to several variations of the original problem for which an analytical approach would be impractical.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Meehan, Timothy J. « Joint demodulation of low-entropy narrow band cochannel signals ». Thesis, Monterey, Calif. : Naval Postgraduate School, 2006. http://bosun.nps.edu/uhtbin/hyperion.exe/06Dec%5FMeehan%5FPhD.pdf.

Texte intégral
Résumé :
Thesis (Ph.D. in Electrical Engineering)--Naval Postgraduate School, December 2006.
Dissertation supervisor(s): Frank E. Kragh. "December 2006." Includes bibliographical references (p. 167-177). Also available in print.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Reimann, Axel. « Evolutionary algorithms and optimization ». Doctoral thesis, [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=969093497.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

JIMMY, TJEN. « Entropy-Based Sensor Selection Algorithms for Damage Detection in SHM Systems ». Doctoral thesis, Università degli Studi dell'Aquila, 2021. http://hdl.handle.net/11697/173561.

Texte intégral
Résumé :
It is often the case that small faults in a structure lead to irreparable damages that deliver a huge financial loss or even pose safety risks. Thus, an early fault detection is necessary, such that these unfortunate events can be avoided. In this thesis, the problem of structural damage detection is considered. In particular there are 3 main contributions: First, a novel sensors selection algorithm based on the concepts of entropy and information gain from information theory is developed, to reduce the number of sensors without affecting, or even improving, model accuracy; Second, a novel technique based on Kalman filtering and on a combination of Regression Trees theory from Machine Learning and Auto Regressive (AR) system identification from control theory is derived, to build models that can be used to detect structural damages. Finally, a new fault detection algorithm based on Poly-Exponential (PE) models and nonlinear Kalman filtering on the residual is introduced, which is able to enhance the sensitivity of the proposed fault detection algorithm and improve the data prediction quality for some accelerometers in a notably margin. The presented techniques are validated on three different experimental datasets, providing evidence that the proposed algorithms outperform some previous approaches, improving the prediction accuracy and the damage detection sensitivity while reducing the number of sensors.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Kirsch, Matthew Robert. « Signal Processing Algorithms for Analysis of Categorical and Numerical Time Series : Application to Sleep Study Data ». Case Western Reserve University School of Graduate Studies / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1278606480.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Molari, Marco. « Implementation of network entropy algorithms on hpc machines, with application to high-dimensional experimental data ». Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/6160/.

Texte intégral
Résumé :
Network Theory is a prolific and lively field, especially when it approaches Biology. New concepts from this theory find application in areas where extensive datasets are already available for analysis, without the need to invest money to collect them. The only tools that are necessary to accomplish an analysis are easily accessible: a computing machine and a good algorithm. As these two tools progress, thanks to technology advancement and human efforts, wider and wider datasets can be analysed. The aim of this paper is twofold. Firstly, to provide an overview of one of these concepts, which originates at the meeting point between Network Theory and Statistical Mechanics: the entropy of a network ensemble. This quantity has been described from different angles in the literature. Our approach tries to be a synthesis of the different points of view. The second part of the work is devoted to presenting a parallel algorithm that can evaluate this quantity over an extensive dataset. Eventually, the algorithm will also be used to analyse high-throughput data coming from biology.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Kotha, Aravind Eswar Ravi Raja, et Lakshmi Ratna Hima Rajitha Majety. « Performance Comparison of Image Enhancement Algorithms Evaluated on Poor Quality Images ». Thesis, Blekinge Tekniska Högskola, Institutionen för tillämpad signalbehandling, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13880.

Texte intégral
Résumé :
Many applications require automatic image analysis for different quality of the input images. In many cases, the quality of acquired images is suitable for the purpose of the application. However, in some cases the quality of the acquired image has to be modified according to needs of a specific application. A higher quality of the image can be achieved by Image Enhancement (IE) algorithms. The choice of IE technique is challenging as this choice varies with the application purpose. The goal of this research is to investigate the possibility of the selective application for the IE algorithms. The values of entropy and Peak Signal to Noise Ratio (PSNR) of the acquired image are considered as parameters for selectivity. Three algorithms such as Retinex, Bilateral filter and Bilateral tone adjustment have been chosen as IE techniques for evaluation in this work. Entropy and PSNR are used for the performance evaluation of selected IE algorithms. In this study, we considered the images from three fingerprint image databases as input images to investigate the algorithms. The decision to enhance an image in these databases by the considered algorithms is based on the empirically evaluated entropy and PSNR thresholds. Automatic Fingerprint Identification System (AFIS) has been selected as the application of interest. The evaluation results show that the performance of the investigated IE algorithms affects significantly the performance of AFIS. The second conclusion is that entropy and PSNR might be considered as indicators for required IE of the input image for AFIS.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Saraiva, Gustavo Francisco Rosalin. « Análise temporal da sinalização elétrica em plantas de soja submetidas a diferentes perturbações externas ». Universidade do Oeste Paulista, 2017. http://bdtd.unoeste.br:8080/jspui/handle/jspui/1087.

Texte intégral
Résumé :
Submitted by Michele Mologni (mologni@unoeste.br) on 2018-07-27T17:57:40Z No. of bitstreams: 1 Gustavo Francisco Rosalin Saraiva.pdf: 5041218 bytes, checksum: 30127a7816b12d3bd7e57182e6229bc2 (MD5)
Made available in DSpace on 2018-07-27T17:57:40Z (GMT). No. of bitstreams: 1 Gustavo Francisco Rosalin Saraiva.pdf: 5041218 bytes, checksum: 30127a7816b12d3bd7e57182e6229bc2 (MD5) Previous issue date: 2017-03-31
Plants are complex organisms with dynamic processes that, due to their sessile way of life, are influenced by environmental conditions at all times. Plants can accurately perceive and respond to different environmental stimuli intelligently, but this requires a complex and efficient signaling system. Electrical signaling in plants has been known for a long time, but has recently gained prominence with the understanding of the physiological processes of plants. The objective of this thesis was to test the following hypotheses: temporal series of data obtained from electrical signaling of plants have non-random information, with dynamic and oscillatory pattern, such dynamics being affected by environmental stimuli and that there are specific patterns in responses to stimuli. In a controlled environment, stressful environmental stimuli were applied in soybean plants, and the electrical signaling data were collected before and after the application of the stimulus. The time series obtained were analyzed using statistical and computational tools to determine Frequency Spectrum (FFT), Autocorrelation of Values and Approximate Entropy (ApEn). In order to verify the existence of patterns in the series, classification algorithms from the area of machine learning were used. The analysis of the time series showed that the electrical signals collected from plants presented oscillatory dynamics with frequency distribution pattern in power law. The results allow to differentiate with great efficiency series collected before and after the application of the stimuli. The PSD and autocorrelation analyzes showed a great difference in the dynamics of the electric signals before and after the application of the stimuli. The ApEn analysis showed that there was a decrease in the signal complexity after the application of the stimuli. The classification algorithms reached significant values in the accuracy of pattern detection and classification of the time series, showing that there are mathematical patterns in the different electrical responses of the plants. It is concluded that the time series of bioelectrical signals of plants contain discriminant information. The signals have oscillatory dynamics, having their properties altered by environmental stimuli. There are still mathematical patterns built into plant responses to specific stimuli.
As plantas são organismos complexos com processos dinâmicos que, devido ao seu modo séssil de vida, sofrem influência das condições ambientais todo o tempo. Plantas podem percebem e responder com precisão a diferentes estímulos ambientais de forma inteligente, mas para isso se faz necessário um complexo e eficiente sistema de sinalização. A sinalização elétrica em plantas já é conhecida há muito tempo, mas vem ganhando destaque recentemente com seu entendimento em relação aos processos fisiológicos das plantas. O objetivo desta tese foi testar as seguintes hipóteses: séries temporais de dados obtidos da sinalização elétrica de plantas possuem informação não aleatória, com padrão dinâmico e oscilatório, sendo tal dinâmica afetada por estímulos ambientais e que há padrões específicos nas respostas a estímulos. Em ambiente controlado, foram aplicados estímulos ambientais estressantes em plantas de soja, e captados os dados de sinalização elétrica antes e após a aplicação dos mesmos. As séries temporais obtidas foram analisadas utilizando ferramentas estatísticas e computacionais para se determinar o Espectro de Frequências (FFT), Autocorrelação dos valores e Entropia Aproximada (ApEn). Para se verificar a existência de padrões nas séries, foram utilizados algoritmos de classificação da área de aprendizado de máquina. A análise das séries temporais mostrou que os sinais elétricos coletados de plantas apresentaram dinâmica oscilatória com padrão de distribuição de frequências em lei de potência. Os resultados permitem diferenciar com grande eficácia séries coletadas antes e após a aplicação dos estímulos. As análises de PSD e autocorrelação mostraram grande diferença na dinâmica dos sinais elétricos antes e após a aplicação dos estímulos. A análise de ApEn mostrou haver diminuição da complexidade do sinal após a aplicação dos estímulos. Os algoritmos de classificação alcançaram valores significativos na acurácia de detecção de padrões e classificação das séries temporais, mostrando haver padrões matemáticos nas diferentes respostas elétricas das plantas. Conclui-se que as séries temporais de sinais bioelétricos de plantas possuem informação discriminante. Os sinais possuem dinâmica oscilatória, tendo suas propriedades alteradas por estímulos ambientais. Há ainda padrões matemáticos embutidos nas respostas da planta a estímulos específicos.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Entropy algorithms"

1

National Institute of Standards and Technology (U.S.), dir. Parallel algorithms for entropy-coding techniques. Gaithersburg, MD : U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1998.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Santos, Cícero Nogueira dos. Entropy guided transformation learning : Algorithms and applications. London : Springer, 2012.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

dos Santos, Cícero Nogueira, et Ruy Luiz Milidiú. Entropy Guided Transformation Learning : Algorithms and Applications. London : Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-2978-3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Luiz, Milidiu Ruy, et SpringerLink (Online service), dir. Entropy Guided Transformation Learning : Algorithms and Applications. London : Springer London, 2012.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Príncipe, J. C. Information theoretic learning : Renyi's entropy and kernel perspectives. New York : Springer, 2010.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

M, Le Thinh, Lian Yong et SpringerLink (Online service), dir. Entropy Coders of the H.264/AVC Standard : Algorithms and VLSI Architectures. Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2011.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

1954-, Mayer-Kress G., et International Workshop on "Dimensions and Entropies in Chaotic Systems" (1985 : Pecos River Ranch), dir. Dimensions and entropies in chaotic systems : Quantification of complex behavior : proceedings of an international workshop at the Pecos River Ranch, New Mexico, September 11-16, 1985. Berlin : Springer-Verlag, 1986.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Sbert, Mateu. Information theory tools for computer graphics. San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool Publishers, 2009.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

United States. National Aeronautics and Space Administration., dir. An adaptive numeric predictor-corrector guidance algorithm for atmospheric entry vehicles. Cambridge, Mass : The Charles Stark Draper Laboratories, Inc., 1987.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

United States. National Aeronautics and Space Administration., dir. Entry vehicle performance analysis and atmospheric guidance algorithm for precision landing on Mars. Cambridge, Mass : The Charles Stark Draper Laboratory, Inc., 1990.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Chapitres de livres sur le sujet "Entropy algorithms"

1

Pham, Tuan D. « Entropy Algorithms ». Dans Fuzzy Recurrence Plots and Networks with Applications in Biomedicine, 81–97. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-37530-0_6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Cardinal, Jean, Samuel Fiorini et Gwenaël Joret. « Minimum Entropy Coloring ». Dans Algorithms and Computation, 819–28. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11602613_82.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Masters, Timothy. « Information and Entropy ». Dans Data Mining Algorithms in C++, 1–73. Berkeley, CA : Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-3315-3_1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Li, C. H., C. K. Lee et P. K. S. Tam. « Entropic Thresholding Algorithms and their Optimizations ». Dans Entropy Measures, Maximum Entropy Principle and Emerging Applications, 199–208. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-36212-8_10.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Cordova, Joshimar, et Gonzalo Navarro. « Practical Dynamic Entropy-Compressed Bitvectors with Applications ». Dans Experimental Algorithms, 105–17. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-38851-9_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Farzan, Arash, Travis Gagie et Gonzalo Navarro. « Entropy-Bounded Representation of Point Grids ». Dans Algorithms and Computation, 327–38. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17514-5_28.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Ferragina, Paolo. « Data Structures : Time, I/Os, Entropy, Joules ! » Dans Algorithms – ESA 2010, 1–16. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15781-3_1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

dos Santos, Cícero Nogueira, et Ruy Luiz Milidiú. « Entropy Guided Transformation Learning ». Dans Entropy Guided Transformation Learning : Algorithms and Applications, 9–21. London : Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-2978-3_2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Cooke, D. E., V. Kreinovich et L. Longpré. « Which Algorithms are Feasible ? Maxent Approach ». Dans Maximum Entropy and Bayesian Methods, 25–33. Dordrecht : Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-011-5028-6_3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Shapiro, Jonathan L., Magnus Rattray et Adam PrüGel-Bennett. « Maximum Entropy Analysis of Genetic Algorithms ». Dans Maximum Entropy and Bayesian Methods, 303–10. Dordrecht : Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-011-5430-7_36.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Entropy algorithms"

1

Feng, Xilong, Guosheng Hao, Yi Zhu et Shijin Ren. « An Entropy Feedback Based Evolutionary Algorithms and its Application ». Dans 2024 6th International Conference on Data-driven Optimization of Complex Systems (DOCS), 685–95. IEEE, 2024. http://dx.doi.org/10.1109/docs63458.2024.10704514.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Kurt, İlke, Sezer Ulukaya, Oğuzhan Erdem, Sibel Güler et Cem Uzun. « Shannon Wavelet Entropy-based Machine Learning Applications in Parkinson’s Disease Diagnosis with Videonystagmography ». Dans 2024 Signal Processing : Algorithms, Architectures, Arrangements, and Applications (SPA), 127–31. IEEE, 2024. http://dx.doi.org/10.23919/spa61993.2024.10715608.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Antoneac, Andrada-Livia, Gheorghiţă Mutu et Dragoş-Teodor Gavriluţ. « Entropy-Driven Visualization in GView : Unveiling the Unknown in Binary File Formats ». Dans 2024 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 74–81. IEEE, 2024. https://doi.org/10.1109/synasc65383.2024.00025.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Lan, Rui, Liang Gao et Chao Liu. « Research on the evaluation model of human job matching based on improved entropy method ». Dans Fourth International Conference on Advanced Algorithms and Neural Networks (AANN 2024), sous la direction de Qinghua Lu et Weishan Zhang, 3. SPIE, 2024. http://dx.doi.org/10.1117/12.3049482.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Harvey, Nicholas J. A., Jelani Nelson et Krzysztof Onak. « Streaming algorithms for estimating entropy ». Dans 2008 IEEE Information Theory Workshop (ITW). IEEE, 2008. http://dx.doi.org/10.1109/itw.2008.4578656.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Suciu, Alin, Kinga Marton et Zoltan Antal. « Data Flow Entropy Collector ». Dans 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2008. http://dx.doi.org/10.1109/synasc.2008.25.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Nadar, Mariappan S., Philip J. Sementilli et Bobby R. Hunt. « A Projection-Onto-Convex-Sets Interpretation of Cross-Entropy Based Image Super-Resolution Algorithms ». Dans Signal Recovery and Synthesis. Washington, D.C. : Optica Publishing Group, 1995. http://dx.doi.org/10.1364/srs.1995.rwc3.

Texte intégral
Résumé :
Signal recovery problems are generally posed in the form of rigid constraints (constraint sets), flexible constraints (optimization functional) or a combination thereof. Minimum cross-entropy methods1,2 belong to this third category due to an implicit rigid non-negativity constraint. An elegant approach to solving problems of the first category for convex constraint sets is the Projection Onto Convex Sets (POCS)3 technique. POCS has been limited primarily to least-squares projections, although other distance measures have been proposed.4 In this paper, minimum cross-entropy methods are interpreted as parallel cross-entropic POCS algorithms. This interpretation provides a theoretical basis for including rigid constraints in iterative super-resolution algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Rothvoß, Thomas. « The Entropy Rounding Method in Approximation Algorithms ». Dans Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA : Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611973099.32.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Chang-Yong Lee. « Genetic algorithms with entropy-Boltzmann samplings ». Dans Proceedings of the 2001 Congress on Evolutionary Computation. IEEE, 2001. http://dx.doi.org/10.1109/cec.2001.934432.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Wentao Ma, Hua Qu, Jihong Zhao, Badong Chen et Jose C. Principe. « Sparsity aware minimum error entropy algorithms ». Dans ICASSP 2015 - 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2015. http://dx.doi.org/10.1109/icassp.2015.7178357.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Entropy algorithms"

1

Youssef, Abdou. Parallel algorithms for entropy-coding techniques. Gaithersburg, MD : National Institute of Standards and Technology, 1998. http://dx.doi.org/10.6028/nist.ir.6113.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Dolotii, Marharyta H., et Pavlo V. Merzlykin. Using the random number generator with a hardware entropy source for symmetric cryptography problems. [б. в.], décembre 2018. http://dx.doi.org/10.31812/123456789/2883.

Texte intégral
Résumé :
The aim of the research is to test the possibility of using the developed random number generator [1], which utilizes the sound card noise as an entropy source, in the symmetric cryptography algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Alwan, Iktimal, Dennis D. Spencer et Rafeed Alkawadri. Comparison of Machine Learning Algorithms in Sensorimotor Functional Mapping. Progress in Neurobiology, décembre 2023. http://dx.doi.org/10.60124/j.pneuro.2023.30.03.

Texte intégral
Résumé :
Objective: To compare the performance of popular machine learning algorithms (ML) in mapping the sensorimotor cortex (SM) and identifying the anterior lip of the central sulcus (CS). Methods: We evaluated support vector machines (SVMs), random forest (RF), decision trees (DT), single layer perceptron (SLP), and multilayer perceptron (MLP) against standard logistic regression (LR) to identify the SM cortex employing validated features from six-minute of NREM sleep icEEG data and applying standard common hyperparameters and 10-fold cross-validation. Each algorithm was tested using vetted features based on the statistical significance of classical univariate analysis (p<0.05) and extended () 17 features representing power/coherence of different frequency bands, entropy, and interelectrode-based distance. The analysis was performed before and after weight adjustment for imbalanced data (w). Results: 7 subjects and 376 contacts were included. Before optimization, ML algorithms performed comparably employing conventional features (median CS accuracy: 0.89, IQR [0.88-0.9]). After optimization, neural networks outperformed others in means of accuracy (MLP: 0.86), the area under the curve (AUC) (SLPw, MLPw, MLP: 0.91), recall (SLPw: 0.82, MLPw: 0.81), precision (SLPw: 0.84), and F1-scores (SLPw: 0.82). SVM achieved the best specificity performance. Extending the number of features and adjusting the weights improved recall, precision, and F1-scores by 48.27%, 27.15%, and 39.15%, respectively, with gains or no significant losses in specificity and AUC across CS and Function (correlation r=0.71 between the two clinical scenarios in all performance metrics, p<0.001). Interpretation: Computational passive sensorimotor mapping is feasible and reliable. Feature extension and weight adjustments improve the performance and counterbalance the accuracy paradox. Optimized neural networks outperform other ML algorithms even in binary classification tasks. The best-performing models and the MATLAB® routine employed in signal processing are available to the public at (Link 1).
Styles APA, Harvard, Vancouver, ISO, etc.
4

Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, juin 2021. http://dx.doi.org/10.18235/0003313.

Texte intégral
Résumé :
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Liu, Ju, Hector Gomez, John A. Evans, Thomas J. Hughes et Chad M. Landis. Functional Entropy Variables : A New Methodology for Deriving Thermodynamically Consistent Algorithms for Complex Fluids, with Particular Reference to the Isothermal Navier-Stokes-Korteweg Equations. Fort Belvoir, VA : Defense Technical Information Center, novembre 2012. http://dx.doi.org/10.21236/ada572015.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Fellman, Laura. The Genetic Algorithm and Maximum Entropy Dice. Portland State University Library, janvier 2000. http://dx.doi.org/10.15760/etd.7120.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Soloviev, Vladimir, Andrii Bielinskyi et Viktoria Solovieva. Entropy Analysis of Crisis Phenomena for DJIA Index. [б. в.], juin 2019. http://dx.doi.org/10.31812/123456789/3179.

Texte intégral
Résumé :
The Dow Jones Industrial Average (DJIA) index for the 125-year-old (since 1896) history has experienced many crises of different nature and, reflecting the dynamics of the world stock market, is an ideal model object for the study of quantitative indicators and precursors of crisis phenomena. In this paper, the classification and periodization of crisis events for the DJIA index have been carried out; crashes and critical events have been highlighted. Based on the modern paradigm of the theory of complexity, a spectrum of entropy indicators and precursors of crisis phenomena have been proposed. The entropy of a complex system is not only a measure of uncertainty (like Shannon's entropy) but also a measure of complexity (like the permutation and Tsallis entropy). The complexity of the system in a crisis changes significantly. This fact can be used as an indicator, and in the case of a proactive change as a precursor of a crisis. Complex systems also have the property of scale invariance, which can be taken into account by calculating the Multiscale entropy. The calculations were carried out within the framework of the sliding window algorithm with the subsequent comparison of the entropy measures of complexity with the dynamics of the DJIA index itself. It is shown that Shannon's entropy is an indicator, and the permutation and Tsallis entropy are the precursors of crisis phenomena to the same extent for both crashes and critical events.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Berney, Ernest, Naveen Ganesh, Andrew Ward, J. Newman et John Rushing. Methodology for remote assessment of pavement distresses from point cloud analysis. Engineer Research and Development Center (U.S.), avril 2021. http://dx.doi.org/10.21079/11681/40401.

Texte intégral
Résumé :
The ability to remotely assess road and airfield pavement condition is critical to dynamic basing, contingency deployment, convoy entry and sustainment, and post-attack reconnaissance. Current Army processes to evaluate surface condition are time-consuming and require Soldier presence. Recent developments in the area of photogrammetry and light detection and ranging (LiDAR) enable rapid generation of three-dimensional point cloud models of the pavement surface. Point clouds were generated from data collected on a series of asphalt, concrete, and unsurfaced pavements using ground- and aerial-based sensors. ERDC-developed algorithms automatically discretize the pavement surface into cross- and grid-based sections to identify physical surface distresses such as depressions, ruts, and cracks. Depressions can be sized from the point-to-point distances bounding each depression, and surface roughness is determined based on the point heights along a given cross section. Noted distresses are exported to a distress map file containing only the distress points and their locations for later visualization and quality control along with classification and quantification. Further research and automation into point cloud analysis is ongoing with the goal of enabling Soldiers with limited training the capability to rapidly assess pavement surface condition from a remote platform.
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Entropy algorithms » pour d’autres types de sources :
Articles de revues Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie