87,909 Hits in 2.8 sec

Dynamical analysis of a class of Euclidean algorithms

Brigitte Vallée
2003 Theoretical Computer Science  
We develop a general framework for the analysis of algorithms of a broad Euclidean type.  ...  These methods also provide a unifying framework for the analysis of an entire class of gcd-like algorithms together with new results regarding the probable behaviour of their cost functions. (B.  ...  other nice ÿgures and his help for the computation of higher moments.  ... 
doi:10.1016/s0304-3975(02)00652-7 fatcat:ii5pkyesgnbhpmnzgisqrhntby

Automated Detection of Electric Energy Consumption Load Profile Patterns

Ignacio Benítez, José-Luis Díez
2022 Energies  
Additionally, a selection of dynamic clustering algorithms have been implemented and the performances compared using an available electric energy consumption load profile database.  ...  The performed review can be used as a guide for those interested in the automatic analysis and groups of behaviour detection within load profile databases.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/en15062176 fatcat:3gpewmzmybgudnhljzmxed2s2i

Android Apps Security Evaluation System in the Cloud [chapter]

Hao Wang, Tao Li, Tong Zhang, Jie Wang
2016 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
We adopt Euclidean distance-based similarity calculation algorithm to evaluate risk. The difference value determines the APP's malicious risk.  ...  For the Apps security evaluation, the paper proceed from the Android permission mechanism, proposes a classified dynamic security evaluation method.  ...  This paper selects the similarity analysis of the Euclidean distance algorithm is due to the algorithm can effectively distinguish the similarity of App.  ... 
doi:10.1007/978-3-319-28910-6_14 fatcat:5smxrbbus5fjrnu2tmiong6heu

Euclidean dynamics

Brigitte Vallée
2006 Discrete and Continuous Dynamical Systems. Series A  
We study a general class of Euclidean algorithms which compute the greatest common divisor [gcd], and we perform probabilistic analyses of their main parameters.  ...  Such dynamical analyses can be used to perform the average-case analysis of algorithms, but also (dynamical) analysis in distribution.  ...  Main results: Distribution Analysis of Euclidean Algorithms of the Good Class. The previous dynamical approach exhibits two main facts for algorithms of the Good Class.  ... 
doi:10.3934/dcds.2006.15.281 fatcat:wowhucwfhbd3hcfsrcaco7pywa

A Unifying Framework for the Analysis of a Class of Euclidean Algorithms [chapter]

Brigitte Vallée
2000 Lecture Notes in Computer Science  
We develop a general framework for the analysis of algorithms of a broad Euclidean type.  ...  These methods provide a unifying framework for the analysis of an entire class of gcd-like algorithms together with new results regarding the probable behaviour of their cost functions.  ...  I wish to thank Pierre Ducos for earlier discussions of 1992, Charlie Lem ee and J er emie Bourdon for their master's theses closely related to this work, Thomas Prellberg for his explanations of the inducing  ... 
doi:10.1007/10719839_34 fatcat:zqomwaxgpnhd7gxp6nkcapavw4

Mouse Dynamics as Continuous User Authentication Tool

2019 International journal of recent technology and engineering  
User Specific traits are a very strong methodto strengthen the security of any system as it makes thesystem connected to a specific individual instead of beingaccessed through some token, key, etc.  ...  We consider here the best results reported in terms of FalseRejection Rate (FRR) &False Acceptance Rate (FAR).  ...  ALGORITHMS USED FOR MOUSE DYNAMICS A.  ... 
doi:10.35940/ijrte.d4404.118419 fatcat:w3wio5nz2jgyxhusxtv3avcp74

Dynamic Classifier Selection for Data with Skewed Class Distribution Using Imbalance Ratio and Euclidean Distance [chapter]

Paweł Zyblewski, Michał Woźniak
2020 Lecture Notes in Computer Science  
This work aims to adapt the concept of Dynamic Classifier Selection (dcs) to the pattern classification task with the skewed class distribution.  ...  Imbalanced data analysis remains one of the critical challenges in machine learning.  ...  As a reference method, a single classifier, as well as stratified bagging and dynamic selection in the form of the knora-u algorithm were selected.  ... 
doi:10.1007/978-3-030-50423-6_5 fatcat:3hxxytch2zhmxpktzdx7eol6qi

Routing in Mobile Wireless Networks

Dominique Tschopp, Suhas Diggavi, Matthias Grossglauser
2008 2008 IEEE International Zurich Seminar on Communications  
(ii) We develop a worst-case analysis of the routing algorithm in terms of total routing overhead and route quality (stretch).  ...  Therefore, the doubling property has the potential to enable us to design and analyze algorithms for a general class of wireless networks.  ...  (ii) We develop a worst-case analysis of the routing algorithm in terms of total routing overhead and route quality (stretch).  ... 
doi:10.1109/izs.2008.4497262 fatcat:tj53twubdjdqlnejzbaisvsviy

Dynamical analysis of α-Euclidean algorithms

Jérémie Bourdon, Benoit Daireaux, Brigitte Vallée
2002 Journal of Algorithms  
We study a class of Euclidean algorithms related to divisions where the remainder is constrained to belong to [α −1, α], for some α ∈ [0, 1].  ...  This is a new instance of the so-called "dynamical analysis" method, where dynamical systems are made a deep use of.  ...  This work is partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT).  ... 
doi:10.1016/s0196-6774(02)00218-3 fatcat:wp4ssozrtvc6rd42l6vo3nbmda

Local Accuracy Measurement for Face Recognition System using Numerous Classifier (PCA, GA and ANN)

Md. ShahjahanKabir, Kh. Mohaimenul Kabir, Rabiul Islam
2015 International Journal of Computer Applications  
, Genetic Algorithm And Euclidean distance measure based on Principal Component Analysis dimensionality reduction technique.  ...  Here it is proposed a classifier local accuracy measurement technique which is used to dynamic classifier selection algorithm.  ...  Dynamic Classifier selection algorithm In this section a dynamic classifier selection algorithm is discussed according CLA measurement discussed above.  ... 
doi:10.5120/19889-1928 fatcat:7j6xo25qknfenar6rkfraj4jve

Metrics Based Quality Estimation of Speech Recognition Features

Rasa Lileikytė, Laimutis Telksnys
2013 Informatica  
The experimental results show that our method is suitable for recognition systems with back-end Euclidean space classifiers.  ...  The key component of our method is usage of metrics right after front-end features computation.  ...  It is a group of classifiers that use the Euclidean distance as a similarity measure.  ... 
doi:10.15388/informatica.2013.404 fatcat:a7dzebgob5arnebirh4qmfinqi

A Dynamic Swarm Firefly Algorithm Based on Chaos Theory and Max-Min Distance Algorithm

Xinmiao Lu, Qiong Wu, Ying Zhou, Yao Ma, Chaochen Song, Chi Ma
2019 Traitement du signal  
To solve the problem, this paper puts forward a dynamic swarm firefly algorithm based on chaos theory and max-min distance algorithm (FCMM).  ...  Firstly, the number of cluster centers, k, and their positions were determined by the maxi-min distance algorithm (MM).  ...  As a classical method of data mining and analysis [1, 2] , cluster analysis enjoys a huge application potential in pattern recognition, indoor positioning and statistics.  ... 
doi:10.18280/ts.360304 fatcat:cjblkpfh2naxjcvbyzkt5fziqm

Dynamic clustering of residential electricity consumption time series data based on Hausdorff distance

Ignacio Benítez, José-Luis Díez, Alfredo Quijano, Ignacio Delgado
2016 Electric power systems research  
A novel dynamic clustering algorithm is also presented, based on an initial segmentation of the energy consumption time series data in smaller surfaces, and the computation of a similarity measure among  ...  However, this analysis is usually limited to the analysis of single days.  ...  The second approach is designed as a Type 3 dynamic clustering of dynamic trajectories through time, with a fixed number of classes.  ... 
doi:10.1016/j.epsr.2016.05.023 fatcat:2gn7medmbvbw3da4lphslfbac4

Autonomous Terrain Classification for Planetary Rover [chapter]

Koki Fujita
2012 Advances in Spacecraft Systems and Orbit Determination  
Previous work on Dynamic Textures (Saisan et al., 2001) proposed to apply a suboptimal estimation algorithm utilizing a principal component analysis (PCA-ID) in order to decrease the dimensionality of  ...  " is introduced to estimate a class conditional probability density in an ambient Euclidean space.  ...  Advances in Spacecraft Systems and Orbit Determination The book also provides a detailed overview on Spacecraft Systems including reliability of low-cost AOCS, sliding mode controlling and a new view on  ... 
doi:10.5772/37453 fatcat:rqgo3sut6zf4dbv4kmnlvrdk64

Page 3626 of Mathematical Reviews Vol. , Issue 2004e [page]

2004 Mathematical Reviews  
Marc Deléglise (F-LYON; Villeurbanne) 2004e:11144 11Y16 11K50 68W40 Vallée, Brigitte (F-CAEN-GR; Caen) Dynamical analysis of a class of Euclidean algorithms.  ...  This class includes the Euclidean algorithm for computing the greatest common divisor of two numbers, as well as variants such as the least-remainder algorithm and algorithms to compute the Jacobi symbol  ... 
« Previous Showing results 1 — 15 out of 87,909 results