Articles de revues sur le sujet « Euclidean distance degree »
Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Euclidean distance degree.
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Euclidean distance degree ».
À 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.
Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.
1
Maxim, Laurentiu G., Jose Israel Rodriguez et Botong Wang. « Defect of Euclidean distance degree ». Advances in Applied Mathematics 121 (octobre 2020) : 102101. http://dx.doi.org/10.1016/j.aam.2020.102101.
Texte intégral
2
Lee, Hwangrae. « The Euclidean distance degree of Fermat hypersurfaces ». Journal of Symbolic Computation 80 (mai 2017) : 502–10. http://dx.doi.org/10.1016/j.jsc.2016.07.006.
Texte intégral
3
Maxim, Laurentiu G., Jose I. Rodriguez et Botong Wang. « Euclidean Distance Degree of the Multiview Variety ». SIAM Journal on Applied Algebra and Geometry 4, no 1 (janvier 2020) : 28–48. http://dx.doi.org/10.1137/18m1233406.
Texte intégral
4
Draisma, Jan, Emil Horobeţ, Giorgio Ottaviani, Bernd Sturmfels et Rekha R. Thomas. « The Euclidean Distance Degree of an Algebraic Variety ». Foundations of Computational Mathematics 16, no 1 (6 janvier 2015) : 99–149. http://dx.doi.org/10.1007/s10208-014-9240-x.
Texte intégral
5
Pham, Thu-Thuy. « Euclidean distance degree of zero-set of two polynomials ». Tạp chí Khoa học - Trường Đại học Sư phạm Hà Nội 2 1, no 2 (28 décembre 2022) : 68–75. http://dx.doi.org/10.56764/hpu2.jos.2022.1.2.68-75.
Texte intégralRésumé :
In this note, we recall the study of the Euclidean distance degree of an algebraic set X which is the zero-point set of a polynomial (see [BSW]). Specifically, consider a hypersurface defined by a general polynomial f with its support and contains the origin i.e 0 support of f. In the paper [BSW], the authors study about the Euclidean distance degree (EDD) and found that the EDD of this hypersurface is approximately by the mixed volume (MV) of some Newton polytopes. The main purpose of this note is to study the case that the manifold is defined by two polynomials . We show that the Euclidean distance degree is equal to the solution of the Lagrange multiplier equation. Furthermore, we also find out that the EDD of this variety is not greater than the mixed volume of Newton polytopes of the associated Lagrange multiplier equations.
6
Aluffi, Paolo, et Corey Harris. « The Euclidean distance degree of smooth complex projective varieties ». Algebra & ; Number Theory 12, no 8 (4 décembre 2018) : 2005–32. http://dx.doi.org/10.2140/ant.2018.12.2005.
Texte intégral
7
Drusvyatskiy, Dmitriy, Hon-Leung Lee, Giorgio Ottaviani et Rekha R. Thomas. « The euclidean distance degree of orthogonally invariant matrix varieties ». Israel Journal of Mathematics 221, no 1 (11 juillet 2017) : 291–316. http://dx.doi.org/10.1007/s11856-017-1545-4.
Texte intégral
8
DAS, GAUTAM, et PAUL J. HEFFERNAN. « CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES ». International Journal of Foundations of Computer Science 07, no 02 (juin 1996) : 121–35. http://dx.doi.org/10.1142/s0129054196000105.
Texte intégralRésumé :
Let V be any set of n points in k-dimensional Euclidean space. A subgraph of the complete Euclidean graph is a t-spanner if for all u and υ in V, the length of the shortest path from u to υ in the spanner is at most t times the Euclidean distance between u and υ. We show that for any δ>1, there exists a t-spanner (where t is a constant that depends only on δ and k) with the following properties: its maximum degree is 3, it has at most n·δ edges, its total edge weight is at most O(1) times the weight of the minimum spanning tree of V, and it can be constructed in O(n log n) time. The constants implicit in the O-notation depend on δ and k.
9
Zou, Yan, Weijie Chen, Mingyu Tong et Shuo Tao. « DEA Cross-Efficiency Aggregation with Deviation Degree Based on Standardized Euclidean Distance ». Mathematical Problems in Engineering 2021 (10 mars 2021) : 1–10. http://dx.doi.org/10.1155/2021/6682499.
Texte intégralRésumé :
Data envelopment analysis (DEA) has been extended to cross-efficiency to provide better discrimination and ranking of decision-making units (DMUs). Current researches about cross-efficiency mainly focus on the non-uniqueness of optimal solution of linear programming and information aggregation. As a common distance metric, standardized Euclidean distance is introduced to define the discrimination power between two vectors and the deviation degree for measuring the difference between the individual preference and group ideal preference. Based on above definitions, an alternative method is presented to compare multiple optimal solutions, and further, a universal weighted cross-efficiency model considering both dynamic adjustment of weights and preference formulation is constructed for evaluation and ranking. Two numerical examples are given to illustrate the effectiveness of the comparison method for multiple optimal solutions and weights determination method of DMUs, respectively. At last, a practical application aimed at evaluating environmental treatment efficiency in western area of China is given. Comparative analysis shows that our model could be more moderate, flexible, and general than some available models and methods, which can extend the theoretical research of cross-efficiency evaluation.
10
Remais, Justin, Adam Akullian, Lu Ding et Edmund Seto. « Analytical methods for quantifying environmental connectivity for the control and surveillance of infectious disease spread ». Journal of The Royal Society Interface 7, no 49 (17 février 2010) : 1181–93. http://dx.doi.org/10.1098/rsif.2009.0523.
Texte intégralRésumé :
The sustained transmission and spread of environmentally mediated infectious diseases is governed in part by the dispersal of parasites, disease vectors and intermediate hosts between sites of transmission. Functional geospatial models can be used to quantify and predict the degree to which environmental features facilitate or limit connectivity between target populations, yet typical models are limited in their geographical and analytical approach, providing simplistic, global measures of connectivity and lacking methods to assess the epidemiological implications of fine-scale heterogeneous landscapes. Here, functional spatial models are applied to problems of surveillance and control of the parasitic blood fluke Schistosoma japonicum and its intermediate snail host Oncomelania haupensis in western China. We advance functional connectivity methods by providing an analytical framework to (i) identify nodes of transmission where the degree of connectedness to other villages, and thus the potential for disease spread, is higher than is estimated using Euclidean distance alone and (ii) (re)organize transmission sites into disease surveillance units based on second-order relationships among nodes using non-Euclidean distance measures, termed effective geographical distance (EGD). Functional environmental models are parametrized using ecological information on the target organisms, and pair-wise distributions of inter-node EGD are estimated. A Monte Carlo rank product analysis is presented to identify nearby nodes under alternative distance models. Nodes are then iteratively embedded into EGD space and clustered using a k -means algorithm to group villages into ecologically meaningful surveillance groups. A consensus clustering approach is taken to derive the most stable cluster structure. The results indicate that novel relationships between nodes are revealed when non-Euclidean, ecologically determined distance measures are used to quantify connectivity in heterogeneous landscapes. These connections are not evident when analysing nodes in Euclidean space, and thus surveillance and control activities planned using Euclidean distance measures may be suboptimal. The methods developed here provide a quantitative framework for assessing the effectiveness of ecologically grounded surveillance systems and of control and prevention strategies for environmentally mediated diseases.
11
Onuean, Athita, Hanmin Jung et Krisana Chinnasarn. « Finding Optimal Stations Using Euclidean Distance and Adjustable Surrounding Sphere ». Applied Sciences 11, no 2 (18 janvier 2021) : 848. http://dx.doi.org/10.3390/app11020848.
Texte intégralRésumé :
Air quality monitoring network (AQMN) plays an important role in air pollution management. However, setting up an initial network in a city often lacks necessary information such as historical pollution and geographical data, which makes it challenging to establish an effective network. Meanwhile, cities with an existing one do not adequately represent spatial coverage of air pollution issues or face rapid urbanization where additional stations are needed. To resolve the two cases, we propose four methods for finding stations and constructing a network using Euclidean distance and the k-nearest neighbor algorithm, consisting of Euclidean Distance (ED), Fixed Surrounding Sphere (FSS), Euclidean Distance + Fixed Surrounding Sphere (ED + FSS), and Euclidean Distance + Adjustable Surrounding Sphere (ED + ASS). We introduce and apply a coverage percentage and weighted coverage degree for evaluating the results from our proposed methods. Our experiment result shows that ED + ASS is better than other methods for finding stations to enhance spatial coverage. In the case of setting up the initial networks, coverage percentages are improved up to 22%, 37%, and 56% compared with the existing network, and adding a station in the existing one improved up by 34%, 130%, and 39%, in Sejong, Bonn, and Bangkok cities, respectively. Our method depicts acceptable results and will be implemented as a guide for establishing a new network and can be a tool for improving spatial coverage of the existing network for future expansions in air monitoring.
12
Zhou, Yong, et Fang Wang. « A Research on the Coordinated Development of Affordable Housing and Commercial Housing in Xi’an ». Advanced Materials Research 838-841 (novembre 2013) : 3123–26. http://dx.doi.org/10.4028/www.scientific.net/amr.838-841.3123.
Texte intégralRésumé :
It was necessary to study the coordinated development of affordable housing and commercial housing. In this article, it used the Principal Component Analysis to calculate the development indexes of affordable housing and commercial housing. Then it established a model, adopting the Euclidean distance index method for their coordinated development, to identify their coordinated development degree. After analyzing their development coordination degrees, it draws the conclusion that the affordable housing development lagged behind commercial housing, and the coordination degree was on the decline, we should adopt appropriate policy measures for their coordinated development.
13
Jabbar Mansour al-Maliki, Riyadh. « The Estimation of the Degree of Genetic Divergence Using Cluster Analysis of the Varietiesof Wheat ». Al-Qadisiyah Journal For Agriculture Sciences (QJAS) (P-ISSN : 2077-5822 , E-ISSN : 2617-1479) 7, no 2 (14 avril 2018) : 112–22. http://dx.doi.org/10.33794/qjas.vol7.iss2.33.
Texte intégralRésumé :
A field experiment has beencarried out at eight different environmental sites in the province of Diwaniya for seasonal years in 2014 and 2015 to test nine varieties of different origin wheat (Triticum aestivum L) and assembled in homogeneous groups and assess the degree of divergence between them and estimate distances Euclidean using cluster analysis. The grain yield data analysis using hierarchical consolidation method (hierarchical) after it has been estimating the degree of similarity by creating a matrix of proximities. The result of the cluster analysis to combine items in five groups formed during the ten stages is every group consists of two varieties except the fifth group consists of one variety. The results of cluster analysis shows that cultivars sabah and Iba 99 have the most similarity the highest distance Euclidean This refers to the similarity of genes that control the yield grains, which indicate that the degree of divergence of genetic height and reflects the positive to perform tow variety and they possess some of the majorfavorite genes and crosses to take advantage of them in education programs, while Ibahas got less Euclidean distance Maxibak of the variety, which shows a genetic dimension of this product may be due to the different genetic origins. Varieties aredistributed to two main groups: the first group (A) includesvariety (4 and 5) while the second group (B) the rest of the totals and characterized by the average of the sum which is higher including than the first group when is an indication of the existence of favoritesgenes segregated for a recipe made in the categories for the second group which can benefit from segregation. divergent varieties genetically engineered can be used to improve the local varieties by transferring genes winning one of the superior ways of education breeding because the spacing will ensure that genetic similarity between genes tested varieties.
14
Helmer, Martin, et Bernd Sturmfels. « Nearest points on toric varieties ». MATHEMATICA SCANDINAVICA 122, no 2 (8 avril 2018) : 213. http://dx.doi.org/10.7146/math.scand.a-101478.
Texte intégralRésumé :
We determine the Euclidean distance degree of a projective toric variety. This extends the formula of Matsui and Takeuchi for the degree of the $A$-discriminant in terms of Euler obstructions. Our primary goal is the development of reliable algorithmic tools for computing the points on a real toric variety that are closest to a given data point.
15
Liu, Chaojie, Jie Lu, Wenjing Fu et Zhuoyi Zhou. « Second-hand housing batch evaluation model of zhengzhou city based on big data and MGWR model ». Journal of Intelligent & ; Fuzzy Systems 42, no 4 (4 mars 2022) : 4221–40. http://dx.doi.org/10.3233/jifs-210917.
Texte intégralRésumé :
How to better evaluate the value of urban real estate is a major issue in the reform of real estate tax system. So the establishment of an accurate and efficient housing batch evaluation model is crucial in evaluating the value of housing. In this paper the second-hand housing transaction data of Zhengzhou City from 2010 to 2019 was used to model housing prices and explanatory variables by using models of Ordinary Least Square (OLS), Spatial Error Model (SEM), Geographically Weighted Regression (GWR), Geographically and Temporally Weighted Regression (GTWR), and Multiscale Geographically Weighted Regression (MGWR). And a correction method of Barrier Line and Access Point (BLAAP) was constructed, and compared with three correction methods previously studied: Buffer Area (BA), Euclidean Distance (ED), and Non-Euclidean Distance, Travel Distance (ND, TT). The results showed: The fitting degree of GWR, MGWR and GTWR by BLAAP was 0.03–0.07 higher than by ND. The fitting degree of MGWR was the highest (0.883) by BLAAP but the smallest by Akaike Information Criterion (AIC), and 88.3% of second-hand housing data could be well interpreted by the model.
16
Liu, Hongzhao, Baixi Liu, Daning Yuan et Jianhua Rao. « Identification for Sucker-Rod Pumping System’s Damping Coefficients Based on Chain Code Method of Pattern Recognition ». Journal of Vibration and Acoustics 129, no 4 (9 avril 2007) : 434–40. http://dx.doi.org/10.1115/1.2748464.
Texte intégralRésumé :
In this paper, a method for identifying the damping coefficients of a directional well sucker-rod pumping system is put forward by means of the chain code method of pattern recognition. The 24-directional chain code is provided to encode the dynamometer card curve. The parametric equation of the dynamometer card curve is transformed into Fourier series whose coefficients can be computed according to the curve’s chain codes. By means of these coefficients, shape characteristics of the curve are extracted. The Euclidean distance is introduced as the measurement of similar degree between the shape characteristics of measured dynamometer card and that of simulated dynamometer card. Changing the value of viscous damping coefficient and Coulomb friction coefficient in the simulation program, different simulated dynamometer cards are obtained. Substituting their shape characteristics to the Euclidean distance, respectively, a series of distances are acquired. When the distance is less than the given error, the corresponding values of the damping coefficients in the simulation program are regarded as real damping coefficients of the sucker-rod pumping system of directional well. In the end, an example is provided to show the correctness and effectiveness of the presented method.
17
Rushton, G., et J.-C. Thill. « The Effect of Distance Metric on the Degree of Spatial Competition between Firms ». Environment and Planning A : Economy and Space 21, no 4 (avril 1989) : 499–507. http://dx.doi.org/10.1068/a210499.
Texte intégralRésumé :
The proportion of a firm's market-area that is within a given, small, proportional difference in delivered-price between itself and its principal competitor, is an important measure of spatial competition. It is shown that for regular triangular and irregular spatial patterns of firms, areas of intense spatial competition are larger when transport costs are proportional to euclidean distances rather than to block distances, but this is not true for a regular square pattern. In an irregular pattern of firms, for each metric, the proportion of a firm's market-area in the area of intense spatial competition varies markedly from firm to firm. The locational and pricing behavior of firms is expected to be influenced by the size and locations of these areas of spatial competition.
18
Kim, Yunjung, Hyunju Chung et Austin Thompson. « Acoustic and Articulatory Characteristics of English Semivowels /ɹ, l, w/ Produced by Adult Second-Language Speakers ». Journal of Speech, Language, and Hearing Research 65, no 3 (8 mars 2022) : 890–905. http://dx.doi.org/10.1044/2021_jslhr-21-00152.
Texte intégralRésumé :
Purpose: This study presents the results of acoustic and kinematic analyses of word-initial semivowels (/ɹ, l, w/) produced by second-language (L2) speakers of English whose native language is Korean. In addition, the relationship of acoustic and kinematic measures to the ratings of foreign accent was examined by correlation analyses. Method: Eleven L2 speakers and 10 native speakers (first language [L1]) of English read The Caterpillar passage. Acoustic and kinematic data were simultaneously recorded using an electromagnetic articulography system. In addition to speaking rate, two acoustic measures (ratio of third-formant [F3] frequency to second-formant [F2] frequency and duration of steady states of F2) and two kinematic measures (lip aperture and duration of lingual maximum hold) were obtained from individual target sounds. To examine the degree of contrast among the three sounds, acoustic and kinematic Euclidean distances were computed on the F2–F3 and x – y planes, respectively. Results: Compared with L1 speakers, L2 speakers exhibited a significantly slower speaking rate. For the three semivowels, L2 speakers showed a reduced F3/F2 ratio during constriction, increased lip aperture, and reduced acoustic Euclidean distances among semivowels. Additionally, perceptual ratings of foreign accent were significantly correlated with three measures: duration of steady F2, acoustic Euclidean distance, and kinematic Euclidean distance. Conclusions: The findings provide acoustic and kinematic evidence for challenges that L2 speakers experience in the production of English semivowels, especially /ɹ/ and /w/. The robust and consistent finding of reduced contrasts among semivowels and their correlations with perceptual accent ratings suggests using sound contrasts as a potentially effective approach to accent modification paradigms.
19
Dai, Jiejie, Yingbing Teng, Zhaoqi Zhang, Zhongmin Yu, Gehao Sheng et Xiuchen Jiang. « Partial Discharge Data Matching Method for GIS Case-Based Reasoning ». Energies 12, no 19 (26 septembre 2019) : 3677. http://dx.doi.org/10.3390/en12193677.
Texte intégralRésumé :
With the accumulation of partial discharge (PD) detection data from substation, case-based reasoning (CBR), which computes the match degree between detected PD data and historical case data provides new ideas for the interpretation and evaluation of partial discharge data. Aiming at the problem of partial discharge data matching, this paper proposes a data matching method based on a variational autoencoder (VAE). A VAE network model for partial discharge data is constructed to extract the deep eigenvalues. Cosine distance is then used to calculate the match degree between different partial discharge data. To verify the advantages of the proposed method, a partial discharge dataset was established through a partial discharge experiment and live detections on substation site. The proposed method was compared with other feature extraction methods and matching methods including statistical features, deep belief networks (DBN), deep convolutional neural networks (CNN), Euclidean distances, and correlation coefficients. The experimental results show that the cosine distance match degree based on the VAE feature vector can effectively detect similar partial discharge data compared with other data matching methods.
20
Mahalakshmi, P., Muruganandam M et Sharmila A. « VOICE RECOGNITION SECURITY SYSTEM USING MEL-FREQUENCY CEPSTRUM COEFFICIENTS ». Asian Journal of Pharmaceutical and Clinical Research 9, no 9 (1 décembre 2016) : 131. http://dx.doi.org/10.22159/ajpcr.2016.v9s3.13633.
Texte intégralRésumé :
ABSTRACTObjective: Voice Recognition is a fascinating field spanning several areas of computer science and mathematics. Reliable speaker recognition is a hardproblem, requiring a combination of many techniques; however modern methods have been able to achieve an impressive degree of accuracy. Theobjective of this work is to examine various speech and speaker recognition techniques and to apply them to build a simple voice recognition system.Method: The project is implemented on software which uses different techniques such as Mel frequency Cepstrum Coefficient (MFCC), VectorQuantization (VQ) which are implemented using MATLAB.Results: MFCC is used to extract the characteristics from the input speech signal with respect to a particular word uttered by a particular speaker. VQcodebook is generated by clustering the training feature vectors of each speaker and then stored in the speaker database.Conclusion: Verification of the speaker is carried out using Euclidian Distance. For voice recognition we implement the MFCC approach using softwareplatform MatlabR2013b.Keywords: Mel-frequency cepstrum coefficient, Vector quantization, Voice recognition, Hidden Markov model, Euclidean distance.
21
Wang, Tao, et Zheng Tang. « Course Evaluation Model and its Application Based on Grey Correlation Analysis Method ». Advanced Engineering Forum 6-7 (septembre 2012) : 730–35. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.730.
Texte intégralRésumé :
Combining ideal solving method and Euclidean distance, the article constructs a new course evaluation model based on grey correlation analysis method. First, idealizes and standardizes the quantitatively treated evaluation indicators, constructs positive and negative incidence matrix. Then, defines grey correlation distance degree, puts forward an evaluation way close to the optimal solution and far from the worst one. At last, introduces the actual use of model by combining a course evaluation, and tests its accuracy and feasibility.
22
Li, Miqing, Shengxiang Yang, Jinhua Zheng et Xiaohui Liu. « ETEA : A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization ». Evolutionary Computation 22, no 2 (juin 2014) : 189–230. http://dx.doi.org/10.1162/evco_a_00106.
Texte intégralRésumé :
The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in space where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and position information of solutions. This paper explores the properties of EMSTs and proposes an EMST-based evolutionary algorithm (ETEA) to solve multi-objective optimization problems (MOPs). Unlike most EMO algorithms that focus on the Pareto dominance relation, the proposed algorithm mainly considers distance-based measures to evaluate and compare individuals during the evolutionary search. Specifically, in ETEA, four strategies are introduced: (1) An EMST-based crowding distance (ETCD) is presented to estimate the density of individuals in the population; (2) A distance comparison approach incorporating ETCD is used to assign the fitness value for individuals; (3) A fitness adjustment technique is designed to avoid the partial overcrowding in environmental selection; (4) Three diversity indicators—the minimum edge, degree, and ETCD—with regard to EMSTs are applied to determine the survival of individuals in archive truncation. From a series of extensive experiments on 32 test instances with different characteristics, ETEA is found to be competitive against five state-of-the-art algorithms and its predecessor in providing a good balance among convergence, uniformity, and spread.
23
Hou, Qiang, et Lei Xie. « Research on Supplier Evaluation in a Green Supply Chain ». Discrete Dynamics in Nature and Society 2019 (27 mars 2019) : 1–14. http://dx.doi.org/10.1155/2019/2601301.
Texte intégralRésumé :
The supplier is considered to be attractive under green supply chain management; supplier evaluation is also confronted with a serious challenge. Based on this background, this paper studies green supplier evaluation and selection with weights unknown in hesitant fuzzy sets and presents evaluation indexes by the DEMATEL method. On the basis of the Euclidean distance, hesitancy degree is used to construct the improved type signed distance. At last, the paper calculates relative closeness to rank green suppliers by the improved TOPSIS method and compares the results of the traditional algorithm and SAW method. The result of the example shows that the algorithm has practicability and a dipartite degree.
24
DUROCHER, STEPHANE, et DAVID KIRKPATRICK. « BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES ». International Journal of Computational Geometry & ; Applications 18, no 03 (juin 2008) : 161–83. http://dx.doi.org/10.1142/s021819590800257x.
Texte intégralRésumé :
Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its nearest facility is minimized. Geometrically, a Euclidean 2-centre of P corresponds to a cover of P by two discs of minimum radius r (the Euclidean 2-radius). Given a set of mobile clients, where each client follows a continuous trajectory in the plane with bounded velocity, the motion of the corresponding mobile Euclidean 2-centre is not necessarily continuous. Consequently, we consider strategies for defining the trajectories of a pair of mobile facilities that guarantee a fixed-degree approximation of the Euclidean 2-centre while maintaining bounded relative velocity. In an attempt to balance the conflicting goals of closeness of approximation and a low maximum relative velocity, we introduce reflection-based 2-centre functions by reflecting the position of a mobile client across the mobile Steiner centre and the mobile rectilinear 1-centre, respectively.
25
Marcelina, Dona, et Evi Yulianti. « APLIKASI PENCARIAN RUTE TERPENDEK LOKASI KULINER KHAS PALEMBANG MENGGUNAKAN ALGORITMA EUCLIDEAN DISTANCE DAN A*(STAR) ». Jurnal Sisfokom (Sistem Informasi dan Komputer) 9, no 2 (26 juin 2020) : 195. http://dx.doi.org/10.32736/sisfokom.v9i2.827.
Texte intégralRésumé :
Palembang is one of the regions in Indonesia which is known for having culinary which has a distinctive and delicious taste. Besides having a distinctive taste, Palembang cuisine also has its own story related to the history of Palembang City and the development of people's lives there. The many types of culinary and culinary tourist attractions in the city of Palembang provide its own obstacles for tourists and local residents in choosing a culinary meal and the route to the culinary location. The solution to the problem proposed is to make the application for the shortest route search for culinary locations typical of Palembang using the Euclidean Distance and A * algorithm. Euclidean Distance algorithm which is a calculation of the distance from two points as a basis in finding the shortest route and gives the user information about the location that is around the user by comparing the distances and applying the A * algorithm as a basis in finding the shortest route using the smallest estimated cost to achieve the goals to be achieved, and has a heuristic value that is used as a basis for consideration. The final results of the study showed that the algorithm performed had a high degree of accuracy in determining the shortest culinary route location in Palembang, namely the Mean Mean percentage error (MAPE) of 4.4%.
26
Zhang, Wenyuan, Xijuan Guo, Tianyu Huang, Jiale Liu et Jun Chen. « Kernel-Based Robust Bias-Correction Fuzzy Weighted C-Ordered-Means Clustering Algorithm ». Symmetry 11, no 6 (3 juin 2019) : 753. http://dx.doi.org/10.3390/sym11060753.
Texte intégralRésumé :
The spatial constrained Fuzzy C-means clustering (FCM) is an effective algorithm for image segmentation. Its background information improves the insensitivity to noise to some extent. In addition, the membership degree of Euclidean distance is not suitable for revealing the non-Euclidean structure of input data, since it still lacks enough robustness to noise and outliers. In order to overcome the problem above, this paper proposes a new kernel-based algorithm based on the Kernel-induced Distance Measure, which we call it Kernel-based Robust Bias-correction Fuzzy Weighted C-ordered-means Clustering Algorithm (KBFWCM). In the construction of the objective function, KBFWCM algorithm comprehensively takes into account that the spatial constrained FCM clustering algorithm is insensitive to image noise and involves a highly intensive computation. Aiming at the insensitivity of spatial constrained FCM clustering algorithm to noise and its image detail processing, the KBFWCM algorithm proposes a comprehensive algorithm combining fuzzy local similarity measures (space and grayscale) and the typicality of data attributes. Aiming at the poor robustness of the original algorithm to noise and outliers and its highly intensive computation, a Kernel-based clustering method that includes a class of robust non-Euclidean distance measures is proposed in this paper. The experimental results show that the KBFWCM algorithm has a stronger denoising and robust effect on noise image.
27
Abu Qamar, Majdoleen, et Nasruddin Hassan. « Entropy, Measures of Distance and Similarity of Q-Neutrosophic Soft Sets and Some Applications ». Entropy 20, no 9 (5 septembre 2018) : 672. http://dx.doi.org/10.3390/e20090672.
Texte intégralRésumé :
The idea of the Q-neutrosophic soft set emerges from the neutrosophic soft set by upgrading the membership functions to a two-dimensional entity which indicate uncertainty, indeterminacy and falsity. Hence, it is able to deal with two-dimensional inconsistent, imprecise, and indeterminate information appearing in real life situations. In this study, the tools that measure the similarity, distance and the degree of fuzziness of Q-neutrosophic soft sets are presented. The definitions of distance, similarity and measures of entropy are introduced. Some formulas for Q-neutrosophic soft entropy were presented. The known Hamming, Euclidean and their normalized distances are generalized to make them well matched with the idea of Q-neutrosophic soft set. The distance measure is subsequently used to define the measure of similarity. Lastly, we expound three applications of the measures of Q-neutrosophic soft sets by applying entropy and the similarity measure to a medical diagnosis and decision making problems.
28
Li, Lan Yun, Zhuan Zhao Yang, Xiao Li et Zhi He. « Research on Fault Recognition for Centrifugal Compressor Using Entropy Weight-Based Gray Relational Analysis ». Applied Mechanics and Materials 29-32 (août 2010) : 685–90. http://dx.doi.org/10.4028/www.scientific.net/amm.29-32.685.
Texte intégralRésumé :
A new fault recognition method for centrifugal compressor was proposed by using entropy weight-based gray relational analysis (EW-GRA). Firstly, the weight values of all fault features were calculated objectively by the entropy method to avoid the influence of subjective factors. Secondly, an improved local gray relational coefficient (LGRC) formula with weight measures was designed to reflect the contributions of different fault features. Thirdly, according to the relationship between similarity degree and Euclidean distance, the local gray relational distances (LGRD), the global gray relational distances (GGRD) and the global gray relational grades (GGRG) were calculated, and consequently, the fault recognition result was obtained by using the max membership degree principle. Finally, the engineering practicability and validity of the EW-GRA method was demonstrated by a centrifugal compressor fault diagnosis example, and the results show that the EW-GRA method is more effective and accurate than the traditional gray relational analysis (T-GRA) method and the weighted gray relational analysis (W-GRA) method.
29
Salama, Mostafa A., et Aboul Ella Hassanien. « Fuzzification of Euclidean Space Approach in Machine Learning Techniques ». International Journal of Service Science, Management, Engineering, and Technology 5, no 4 (octobre 2014) : 29–43. http://dx.doi.org/10.4018/ijssmet.2014100103.
Texte intégralRésumé :
Euclidian calculations represent a cornerstone in many machine learning techniques such as the Fuzzy C-Means (FCM) and Support Vector Machine (SVM) techniques. The FCM technique calculates the Euclidian distance between different data points, and the SVM technique calculates the dot product of two points in the Euclidian space. These calculations do not consider the degree of relevance of the selected features to the target class labels. This paper proposed a modification in the Euclidian space calculation for the FCM and SVM techniques based on the ranking of features extracted from evaluating the features. The authors consider the ranking as a membership value of this feature in Fuzzification of Euclidian calculations rather than using the crisp concept of feature selection, which selects some features and ignores others. Experimental results proved that applying the fuzzy value of memberships to Euclidian calculations in the FCM and SVM techniques has better accuracy than the ordinary calculating method and just ignoring the unselected features.
30
Kang, Yan, Huan Jie Cai et Song Bai Song. « A Coordinated Development Evaluation Modeling in Water- Socioeconomy -Environment System ». Advanced Materials Research 524-527 (mai 2012) : 3313–17. http://dx.doi.org/10.4028/www.scientific.net/amr.524-527.3313.
Texte intégralRésumé :
A coordinated development model in water–socioeconomy-environment system (WSE system) and its application are presented in this paper. Based on complex system theory and the coordinated development idea, a set of indicators is provided with capacity to evaluate coordinated development degree in WSE system. Integrating variable fuzzy set theory (VFS) and entropy weight (EW) into set pair analysis method (SPA), the authors derive SPA-VFS-EW model to describe development degrees of WSE system. Employing coordination theory, the authors develop a coordination model based on Euclidean distance, followed by a coordinated development model. The derived model is applied to assess the coordinated development degree of WSE system in Shaanxi province. The results are found satisfactory. It also indicates that the proposed model in this paper can provide a novel method for evaluating the coordinated development in systems.
31
Arman, Md Shohel, Kaushik Sarker, Asif Khan Shakir, Shah Fahad Hossain et Afia Hasan. « Medicine prediction based on doctor’s degree : a data mining approach ». Indonesian Journal of Electrical Engineering and Computer Science 26, no 2 (1 mai 2022) : 1125. http://dx.doi.org/10.11591/ijeecs.v26.i2.pp1125-1134.
Texte intégralRésumé :
<span>The effective use of information mining in profoundly unmistakable fields like e-business, promoting and retail has prompted its application in different enterprises. There is an absence of powerful investigation devices to find concealed connections and patterns in information. This examination paper expects to give a review of ebb and flow systems of learning revelation in databases utilizing information mining strategies that are being used in today’s therapeutic research especially in medicine prediction. Correlation, Chi-square and Euclidean distance feature selections are used to select features and showing the comparison of the result between K-Nearest neighbors, Naïve Bayes, decision tree, artificial neural network. The result uncovers that decision tree beats and sometime Bayesian grouping is having comparative precision as of choice tree. The analysis of performance can be done in such as doctor’s degrees may vary the diseases medicine.</span>
32
Helmer, Martin, et Bernt Ivar Utstøl Nødland. « Polar degrees and closest points in codimension two ». Journal of Algebra and Its Applications 18, no 05 (mai 2019) : 1950095. http://dx.doi.org/10.1142/s0219498819500956.
Texte intégralRésumé :
Suppose that [Formula: see text] is a toric variety of codimension two defined by an [Formula: see text] integer matrix [Formula: see text], and let [Formula: see text] be a Gale dual of [Formula: see text]. In this paper, we compute the Euclidean distance degree and polar degrees of [Formula: see text] (along with other associated invariants) combinatorially working from the matrix [Formula: see text]. Our approach allows for the consideration of examples that would be impractical using algebraic or geometric methods. It also yields considerably simpler computational formulas for these invariants, allowing much larger examples to be computed much more quickly than the analogous combinatorial methods using the matrix [Formula: see text] in the codimension two case.
33
Dmytrów, Krzysztof. « Comparison of Several Linear Ordering Methods for Selection of Locations in Order‑picking by Means of the Simulation Methods ». Acta Universitatis Lodziensis. Folia Oeconomica 5, no 338 (28 septembre 2018) : 81–96. http://dx.doi.org/10.18778/0208-6018.338.05.
Texte intégralRésumé :
When a company uses a shared storage system, selection of locations during the order‑picking process is not an obvious task. Every location where the picked product is placed, can be described by means of several variables, such as: storage time, distance from the I/O point, degree of demand satisfaction, or the number of other picked products in the order. Therefore, the “attractiveness” of each location from the point of view of a certain order can be described by means of synthetic variable, on the basis of which a ranking is created. For each product, the decision‑maker selects the highest‑ranking locations and designates a route for the picker. In the article, by means of the simulation methods, results obtained by several classification methods will be compared. These methods are: Taxonomic Measure of Location’s Attractiveness (based on the Hellwig’s Composite Measure of Development), the TOPSIS method with the Euclidean and GDM distances and the Generalised Distance Measure used as the composite measure of development.
34
Ito, T., S. Tagawa, S. Matsuno, Y. Uchida, Rajiv Mehta, Makoto Sakamoto et Satoshi Ikeda. « An Analysis of Network Structure in Mazda’s Yokokai using the DEC Spatial Model ». International Journal of Mathematics and Computers in Simulation 15 (26 novembre 2021) : 74–78. http://dx.doi.org/10.46300/9102.2021.15.13.
Texte intégralRésumé :
By examining networks is possible to understand the nature of inter-firm relationships among organizational entities in any given corporate group, such as Toyota’s, Nissan’s or Mazda’s Keiretsu. Recently, a new three-dimensional spatial model has been developed that allows organizational scholars to ascertain the structure of a corporate group, the position of the individual firms, and the determinants of the firm performance. This new spatial paradigm –called the DEC spatial model– composed of degree, effective size and capacity that assessed the relationship between Euclidean distance and sales. Although it advances our understanding of networks, the bulk of the research is based on cross-sectional data, it is not possible ascertain the real nature of the relationship between the distance and sales. Instead, the analysis of networks requires using time series data as all the corporate members of a network are ongoing- concerns. To augment our understanding of the nature of inter-firms networks, the interrelationship between distance and sales is examined using time series data drawn from Mazda’s Yokokai in 1986, 2004 and 2005. More specifically, in this paper the data on transactions were collected and used to calculate the Euclidean distance using the DEC spatial model. The position and its determinants of all individual firms are identified and the trend of structure changes is discussed. Based on the findings of offered and avenues of future research are suggested.
35
Liu, Shihu, Yingjie Liu, Chunsheng Yang et Li Deng. « Relative Entropy of Distance Distribution Based Similarity Measure of Nodes in Weighted Graph Data ». Entropy 24, no 8 (19 août 2022) : 1154. http://dx.doi.org/10.3390/e24081154.
Texte intégralRésumé :
Many similarity measure algorithms of nodes in weighted graph data have been proposed by employing the degree of nodes in recent years. Despite these algorithms obtaining great results, there may be still some limitations. For instance, the strength of nodes is ignored. Aiming at this issue, the relative entropy of the distance distribution based similarity measure of nodes is proposed in this paper. At first, the structural weights of nodes are given by integrating their degree and strength. Next, the distance between any two nodes is calculated with the help of their structural weights and the Euclidean distance formula to further obtain the distance distribution of each node. After that, the probability distribution of nodes is constructed by normalizing their distance distributions. Thus, the relative entropy can be applied to measure the difference between the probability distributions of the top d important nodes and all nodes in graph data. Finally, the similarity of two nodes can be measured in terms of this above-mentioned difference calculated by relative entropy. Experimental results demonstrate that the algorithm proposed by considering the strength of node in the relative entropy has great advantages in the most similar node mining and link prediction.
36
Xi, Xiaobo, Jiawen Xu, Jingyun Yuan, Yifu Zhang, Baofeng Zhang et Ruihong Zhang. « Damage Evaluation in Tempered Vacuum Glazing via Multivariate Statistical Methods ». Applied Sciences 11, no 11 (24 mai 2021) : 4799. http://dx.doi.org/10.3390/app11114799.
Texte intégralRésumé :
The performance of tempered vacuum glazing (TVG) strongly depends on the structural parameters and degree of damage of the products. In this paper, attention was paid to six performance indicators which had a major influence on the damage of TVG, and new evaluation parameters were derived from them using principal component analysis (PCA). In particular, hierarchical clustering analysis (HCA) based on Euclidean distance measurement enabled TVG products to be classified into three kinds. Considering the results of PCA, product quality classification was established according to the degree of damage. The evaluation method proposed in this work was found to be simple and reliable to provide references for damage detection of TVG.
37
Zhou, Yong Jie, et Nan Fang Cui. « Performance Evaluation of Telecom Equipment Maintenance Outsourcers Based on Statistical Distance with Weight ». Advanced Materials Research 328-330 (septembre 2011) : 2440–45. http://dx.doi.org/10.4028/www.scientific.net/amr.328-330.2440.
Texte intégralRésumé :
It’s important to control telecom equipment maintenance outsourcers’ performance in outsourcing decision-making process by selecting the proper evaluation indexes. This paper sets up a new comprehensive evaluation method based on statistics distance with weight to assess outsourcer’s performance. Ten indexes are choosed to determine which are good service providers from the ability and effort degree of their work, including failure rate, failure loss, service level, maintenance price, management fee, arrive time, repair time, customer relationship, maintenance engineer and tool machine. Each index has its own expert’s weight. We classify different service grades and calculate the real distance of every maintenance outsourcer by Euclidean distance. Then the performance of each equipment maintenance outsourcer can be inspected from the calculation result. Through the application in telecom company we testify its advantages compared with other evaluation methods.
38
Hsieh, Ming H. « Identifying Brand Image Dimensionality and Measuring the Degree of Brand Globalization : A Cross-National Study ». Journal of International Marketing 10, no 2 (juin 2002) : 46–67. http://dx.doi.org/10.1509/jimk.10.2.46.19538.
Texte intégralRésumé :
The author aims to answer two questions related to brand globalization: (1) whether the pattern of brand image dimensionality is similar across international markets and (2) how cohesive a brand image perception is in a global market. Results from a 20-country, 70-region study provide concrete evidence that supports the applicability of the proposed benefit-based multidimensional image structure that corresponds to consumers’ sensory, utilitarian, and symbolic and economic need at both the global and the national level. On the basis of the identified image dimensions, the author proposes an alternative approach to measuring the degree of global brand image cohesiveness as an indicator of brand globalization. Global brand image cohesiveness is calculated on the basis of the summation of Euclidean distances between the column score of image dimensions of the home country (i.e., initial market) and that of foreign countries. Furthermore, nations are clustered on the basis of these column scores, and the resultant clusters correspond approximately to groups of countries that share similar levels of economic development, cultural dimension, or geographic distance, which suggests that national characteristics affect brand image perceptions. The findings provide implications for the practice of global brand image management.
39
Shi, Pei, Guanghui Li, Yongming Yuan et Liang Kuang. « Data Fusion Using Improved Support Degree Function in Aquaculture Wireless Sensor Networks ». Sensors 18, no 11 (9 novembre 2018) : 3851. http://dx.doi.org/10.3390/s18113851.
Texte intégralRésumé :
For monitoring the aquaculture parameters in pond with wireless sensor networks (WSN), high accuracy of fault detection and high precision of error correction are essential. However, collecting accurate data from WSN to server or cloud is a bottleneck because of the data faults of WSN, especially in aquaculture applications, limits their further development. When the data fault occurs, data fusion mechanism can help to obtain corrected data to replace abnormal one. In this paper, we propose a data fusion method using a novel function that is Dynamic Time Warping time series strategy improved support degree (DTWS-ISD) for enhancing data quality, which employs a Dynamic Time Warping (DTW) time series segmentation strategy to the improved support degree (ISD) function. We use the DTW distance to replace Euclidean distance, which can explore the continuity and fuzziness of data streams, and the time series segmentation strategy is adopted to reduce the computation dimension of DTW algorithm. Unlike Gauss support function, ISD function obtains mutual support degree of sensors without the exponent calculation. Several experiments were finished to evaluate the accuracy and efficiency of DTWS-ISD with different performance metrics. The experimental results demonstrated that DTWS-ISD achieved better fusion precision than three existing functions in a real-world WSN water quality monitoring application.
40
Baturinets, Anastasiia. « Distance measures-based information technology for identifying similar data series ». Scientific journal of the Ternopil national technical university 105, no 1 (2022) : 128–40. http://dx.doi.org/10.33108/visnyk_tntu2022.01.128.
Texte intégralRésumé :
The aim of the work is to develop and implement a technology for identifying similar series, and to test on series of data represented by hydrological samples. The subject of the study is the methods and approaches for identifying similar series. The object of the study is the process of identifying similar series, which are represented by certain indicators. The task is to propose and implement distance measures, where one of them takes into consideration the similarity between the values of the series and their relationship, and another is based on a weighted Euclidean distance taking into account the need to actualize the values that are the most important under certain conditions of the task; to implement a technology to find similar series represented by certain indicators values; to obtain a more resilient solution, to implement a procedure for determining a set of similar series based on the results obtained for each individual distance; the results should be analyzed and the conclusions have to be drawn dealing with practical application of the technology. The following methods were used: statistical analysis methods, methods for calculating distances, and similarity between data series. The following results were obtained: the technology for similar data series detection has been implemented; two distance measures were proposed and described as a part of the technology implemented; a procedure for determining a set of similar rows was implemented that was based on the obtained distances calculation. The scientific novelty of the research under discussion involves: Euclidean weighted distance was described and applied taking into account the actuality of data series values; a new measure of distance has been described and applied that allows both the degree of similarity between the values of the series and their correlation to be taken into account, as well as a technique has been developed for determining similar series from a set of selected distance measures. The practical importance of the developed and implemented technology consists in the following possibilities application to data series of different applied fields: conducting an assessment and identifying some similar series, in particular as an intermediate step in the analysis; in addition, the proposed distance measures improve the quality of identifying similar data series. In our further research, we plan to investigate the possibilities of lengthening the data series and filling in the gaps with values from other series defined as similar ones.
41
Sun, Lijun, et Tianfei Chen. « Difference DV_Distance Localization Algorithm Using Correction Coefficients of Unknown Nodes ». Sensors 18, no 9 (30 août 2018) : 2860. http://dx.doi.org/10.3390/s18092860.
Texte intégralRésumé :
Node localization is an essential requirement in the increasing prevalence of wireless sensor networks applications. As the most commonly used localization algorithm, the DV_Distance algorithm is more sensitive to ranging error, and also has lower localization accuracy. Therefore, this paper proposes a novel difference DV_Distance localization algorithm using correction coefficients of unknown nodes. Taking account of the fact that correction coefficients of unknown nodes should be different, the proposed method has employed the correction model based on unknown nodes. Some correction coefficients for different direction anchor nodes can be indirectly calculated using the known difference of actual Euclidean distance and corresponding accumulated hop distance between anchor nodes, and then the weighting factors for the correction coefficients of different direction anchor nodes are also computed according to their actual contribution degree, so as to make sure that the corrected distances from unknown nodes to anchor nodes, modified by the final correction coefficient, are closer to the actual distances. At last, the positions of unknown nodes can be calculated using multilateral distance measurement. The simulation results demonstrate that the proposed approach is a localization algorithm with easier implementation, and it not only has better performance on localization accuracy than existing DV_Distance localization algorithm, but also improves the localization stability under the same experimental conditions.
42
Bei, Honghan, Yingchao Mao, Wenyang Wang et Xu Zhang. « Fuzzy Clustering Method Based on Improved Weighted Distance ». Mathematical Problems in Engineering 2021 (6 mars 2021) : 1–11. http://dx.doi.org/10.1155/2021/6687202.
Texte intégralRésumé :
As an essential data processing technology, cluster analysis has been widely used in various fields. In clustering, it is necessary to select appropriate measures to evaluate the similarity in the data. In this paper, firstly, a cluster center selection method based on the grey relational degree is proposed to solve the problem of sensitivity in initial cluster center selection. Secondly, combining the advantages of Euclidean distance, DTW distance, and SPDTW distance, a weighted distance measurement based on three kinds of reach is proposed. Then, it is applied to Fuzzy C-MeDOIDS and Fuzzy C-means hybrid clustering technology. Numerical experiments are carried out with the UCI datasets. The experimental results show that the accuracy of the clustering results is significantly improved by using the clustering method proposed in this paper. Besides, the method proposed in this paper is applied to the MUSIC INTO EMOTIONS and YEAST datasets. The clustering results show that the algorithm proposed in this paper can also achieve a better clustering effect when dealing with practical problems.
43
Pathi, Sai Krishna, Andrey Kiselev, Annica Kristoffersson, Dirk Repsilber et Amy Loutfi. « A Novel Method for Estimating Distances from a Robot to Humans Using Egocentric RGB Camera ». Sensors 19, no 14 (17 juillet 2019) : 3142. http://dx.doi.org/10.3390/s19143142.
Texte intégralRésumé :
Estimating distances between people and robots plays a crucial role in understanding social Human–Robot Interaction (HRI) from an egocentric view. It is a key step if robots should engage in social interactions, and to collaborate with people as part of human–robot teams. For distance estimation between a person and a robot, different sensors can be employed, and the number of challenges to be addressed by the distance estimation methods rise with the simplicity of the technology of a sensor. In the case of estimating distances using individual images from a single camera in a egocentric position, it is often required that individuals in the scene are facing the camera, do not occlude each other, and are fairly visible so specific facial or body features can be identified. In this paper, we propose a novel method for estimating distances between a robot and people using single images from a single egocentric camera. The method is based on previously proven 2D pose estimation, which allows partial occlusions, cluttered background, and relatively low resolution. The method estimates distance with respect to the camera based on the Euclidean distance between ear and torso of people in the image plane. Ear and torso characteristic points has been selected based on their relatively high visibility regardless of a person orientation and a certain degree of uniformity with regard to the age and gender. Experimental validation demonstrates effectiveness of the proposed method.
44
Li, Zhenjiang, Qianxue Zhang et Yiqun Wang. « Text Independent Writer Identification Based on Pre-training Model and Feature Fusion ». Journal of Physics : Conference Series 2363, no 1 (1 novembre 2022) : 012015. http://dx.doi.org/10.1088/1742-6596/2363/1/012015.
Texte intégralRésumé :
Handwriting is one of the natural biological characteristics of human beings. People have a high degree of acceptance of identity recognition technology based on handwriting. It has a wide application prospect in the fields of finance, government affairs, justice and so on. In this paper, firstly, the original document image is segmented into smaller regional samples by using the sliding window method. Secondly, multiple pre-training models are used to extract the sample features, and multiple features of the samples are fused. Finally, the euclidean distance is used to express the degree of difference between samples. Experiments show that this method has a high recognition rate and has a certain application value.
45
Cao, Yan Long, Hua Wen Zheng, Jiang Xin Yang et Yuan Feng He. « Automatic Shape Grading of Pearl Using Machine Vision Based Measurement ». Key Engineering Materials 437 (mai 2010) : 389–92. http://dx.doi.org/10.4028/www.scientific.net/kem.437.389.
Texte intégralRésumé :
A method of automatic shape grading of pearl using machine vision is presented in this paper. Firstly, the preprocessed color image is segmented according to its grey degree histogram. Then the morphological closing operation is adopted to eliminate the noise points. An 8-directional boundary-tracing algorithm is applied to obtain the sequences of the boundary. And then the Euclidean distance between the pearls under checking is compared with ones in the standard template library, which is utilized to distinguish the pearls’ shape. Finally the experimental result demonstrates the validity and practicability of this method.
46
Szyman, Kinga, Bartek Wilczyński et Michał Dąbrowski. « K-mer Content Changes with Node Degree in Promoter–Enhancer Network of Mouse ES Cells ». International Journal of Molecular Sciences 22, no 15 (28 juillet 2021) : 8067. http://dx.doi.org/10.3390/ijms22158067.
Texte intégralRésumé :
Maps of Hi-C contacts between promoters and enhancers can be analyzed as networks, with cis-regulatory regions as nodes and their interactions as edges. We checked if in the published promoter–enhancer network of mouse embryonic stem (ES) cells the differences in the node type (promoter or enhancer) and the node degree (number of regions interacting with a given promoter or enhancer) are reflected by sequence composition or sequence similarity of the interacting nodes. We used counts of all k-mers (k = 4) to analyze the sequence composition and the Euclidean distance between the k-mer count vectors (k-mer distance) as the measure of sequence (dis)similarity. The results we obtained with 4-mers are interpretable in terms of dinucleotides. Promoters are GC-rich as compared to enhancers, which is known. Enhancers are enriched in scaffold/matrix attachment regions (S/MARs) patterns and depleted of CpGs. Furthermore, we show that promoters are more similar to their interacting enhancers than vice-versa. Most notably, in both promoters and enhancers, the GC content and the CpG count increase with the node degree. As a consequence, enhancers of higher node degree become more similar to promoters, whereas higher degree promoters become less similar to enhancers. We confirmed the key results also for human keratinocytes.
47
Coulon, Aurélie, John W. Fitzpatrick, Reed Bowman et Irby J. Lovette. « Mind the gap : genetic distance increases with habitat gap size in Florida scrub jays ». Biology Letters 8, no 4 (22 février 2012) : 582–85. http://dx.doi.org/10.1098/rsbl.2011.1244.
Texte intégralRésumé :
Habitat gap size has been negatively linked to movement probability in several species occupying fragmented landscapes. How these effects on movement behaviour in turn affect the genetic structure of fragmented populations at local scales is less well known. We tested, and confirmed, the hypothesis that genetic differentiation among adjacent populations of Florida scrub jays—an endangered bird species with poor dispersal abilities and a high degree of habitat specialization—increases with the width of habitat gaps separating them. This relationship was not an artefact of simple isolation-by-distance, as genetic distance was not correlated with the Euclidean distance between geographical centroids of the adjacent populations. Our results suggest that gap size affects movement behaviour even at remarkably local spatial scales, producing direct consequences on the genetic structure of fragmented populations. This finding shows that conserving genetic continuity for specialist species within fragmented habitat requires maintenance or restoration of preserve networks in which habitat gaps do not exceed a species-specific threshold distance.
48
Shi, Pengfei, Jiahong Liu, Tao Yang, Chong-Yu Xu, Jie Feng, Bin Yong, Tong Cui, Zhenya Li et Shu Li. « New Methods for the Assessment of Flow Regime Alteration under Climate Change and Human Disturbance ». Water 11, no 12 (20 novembre 2019) : 2435. http://dx.doi.org/10.3390/w11122435.
Texte intégralRésumé :
Climate change and anthropogenic activities do collectively lead to an alteration of the flow regime, posing a great influence upon the structure and persistence of native biotic communities within river ecosystems. The range of variability approach (RVA) method is commonly used to evaluate the flow regime alteration. However, it was reported to underestimate the degree of flow regime potentially. In this study, two new assessment methods/metrics for evaluating the process behaviors of the flow regime are developed based on Euclidean distance and dynamic time warping (DTW) distance. They are then integrated with the metric of RVA, generating two composite metrics that represent both frequency and process changes of the flow regime. The new methods/metrics were applied to identify the flow regime alteration in a typical basin in the middle reaches of the Yellow River, China. The results show that the composite metrics consistently reveal a high alteration degree of flow regime in the basin. The decreased biological integrity of fish demonstrates the reasonability of the high-level overall alteration to some degree. The updated methods enable more scientific evaluation for the complex hydrologic alteration under a changing environment.
49
Li, Lan Yun, Zhuan Zhao Yang et Zhi He. « Research on Fault Recognition for Centrifugal Compressor Based on Fuzzy Gray Relational Grade ». Applied Mechanics and Materials 26-28 (juin 2010) : 71–76. http://dx.doi.org/10.4028/www.scientific.net/amm.26-28.71.
Texte intégralRésumé :
In practical centrifugal compressor fault diagnosis, it is very difficult to improve the fault recognition rate, especially when the sample sizes are small. To solve this problem, a new fault recognition method based on fuzzy gray relational grade was proposed. Firstly, according to fuzzy set theory, the fuzzy relation coefficient (FRC), fuzzy relation degree (FRD) and fuzzy relative weights (FRW) of all fault features were calculated. Secondly, the gray system theory was used to obtain the gray relational coefficients (GRC). Thirdly, by combining FRW and GRC, two fuzzy gray relation grades (FGRG) were presented, which is the Hamming distance-based fuzzy gray relation grade (HD-FGRG) and the Euclidean distance-based fuzzy gray relation grade (ED-FGRG), respectively. Finally, the fault recognition results were obtained by using the max membership degree principle. The centrifugal compressor fault diagnosis results show that the ED-FGRG method is more effective and accurate than traditional gray relational analysis (T-GRA) method, the weighted gray relational analysis (W-GRA) method, and the entropy weight-based gray relational analysis (EW-GRA) method and the HD-FGRG method.
50
CAO, XIAN-BIN, WEN-BO DU, MAO-BIN HU, ZHI-HAI RONG, PENG SUN et CAI-LONG CHEN. « TOPOLOGY PROPERTY AND DYNAMIC BEHAVIOR OF A GROWING SPATIAL NETWORK ». International Journal of Modern Physics C 22, no 04 (avril 2011) : 333–45. http://dx.doi.org/10.1142/s0129183111016282.
Texte intégralRésumé :
In this paper, we propose a growing spatial network (GSN) model and investigate its topology properties and dynamical behaviors. The model is generated by adding one node i with m links into a square lattice at each time step and the new node i is connected to the existing nodes with probabilities proportional to: [Formula: see text], where kj is the degree of node j, α is the tunable parameter and dij is the Euclidean distance between i and j. It is found that both the degree heterogeneity and the clustering coefficient monotonously increase with the increment of α, while the average shortest path length monotonously decreases. Moreover, the evolutionary game dynamics and network traffic dynamics are investigated. Simulation results show that the value of α can also greatly influence the dynamic behaviors.