(Publisher of Peer Reviewed Open Access Journals)
Navigation

International Journal of Advanced Technology and Engineering Exploration (IJATEE)

ISSN (Print):2394-5443    ISSN (Online):2394-7454
Volume-6 Issue-56 July-2019
Full-Text PDF
Paper Title : Euclidean space and their functional application for computation analysis
Author Name : Jay Prakash Tiwari and Manish Pande
Abstract :

Euclidean space is the calculative procedure for the calculation of the inner and outer points. The set of points for the calculation is called the Euclidean space. It is also used in the form of Euclidean distance. It is used in different domains and in their applications. It is widely used for the clustering and classification algorithms along with the wide applicability in statistics. In the prospect of the above view the Euclidean space and their functional application have been explored and discussed in this paper. The main aim is to focus and highlights the area of applicability along with the study of the computational feasibility by discussing the previous work.

Keywords : Euclidean space, Distance points, Functional application, Computation analysis.
Cite this article : Tiwari JP, Pande M. Euclidean space and their functional application for computation analysis. International Journal of Advanced Technology and Engineering Exploration. 2019; 6(56):194-199. DOI:10.19101/IJATEE.2019.650047.
References :
[1]Singh H, Urrutia J. Compass routing on geometric networks. In proceedings of the Canadian conference on computational geometry 1999 (pp. 51-4).
[Google Scholar]
[2]Huang H, Yin H, Luo Y, Zhang X, Min G, Fan Q. Three-dimensional geographic routing in wireless mobile ad hoc and sensor networks. IEEE Network. 2016; 30(2):82-90.
[Crossref] [Google Scholar]
[3]Kuhn F, Wattenhofer R, Zollinger A. Worst-case optimal and average-case efficient geometric ad-hoc routing. In proceedings of the international symposium on mobile ad hoc networking & computing 2003 (pp. 267-78). ACM.
[Crossref] [Google Scholar]
[4]Bose P, Morin P, Stojmenović I, Urrutia J. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks. 2001; 7(6):609-16.
[Crossref] [Google Scholar]
[5]Cvetkovski A, Crovella M. Hyperbolic embedding and routing for dynamic graphs. In INFOCOM 2009 (pp. 1647-55). IEEE.
[Crossref] [Google Scholar]
[6]Kou Y, Lin S, Fossorier MP. Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Transactions on Information Theory. 2001; 47(7):2711-36.
[Crossref] [Google Scholar]
[7]Tanner RM. Spectral graphs for quasi-cyclic LDPC codes. In proceedings of the international symposium on information theory 2001 (p. 226). IEEE.
[Crossref] [Google Scholar]
[8]Luchin DV, Trofimov AP, Filippov DV, Yudin VV. Algorithm of radio direction finding in the HF range in polarization fading conditions with collocated antennas. In Moscow workshop on electronic and networking technologies 2018 (pp. 1-8). IEEE.
[Crossref] [Google Scholar]
[9]Chaudhari V, Patil CY. Disease detection of cotton leaves using advanced image processing. International Journal of Advanced Computer Research. 2014; 4(15):653-9.
[Google Scholar]
[10]Sikandar M. Design and modeling of a 3 DOF machine. International Journal of Advanced Computer Research. 2014; 4(15):611-7.
[Google Scholar]
[11]Marie F, Erhel Y, Bertel L, Lemur D. Design of a HF compact direction-finding system based on colocated antennas. In eighth international conference on HF radio systems and techniques 2000 (pp. 127-31). IET.
[Crossref] [Google Scholar]
[12]Tiwari JP, Pande M. Boolean algebra and harmonic function-based computation analysis: a survey and analysis. International Journal of Advanced Technology and Engineering Exploration. 2019; 6(53):107-11.
[Crossref] [Google Scholar]
[13]Dubey AK, Gupta U, Jain S. Analysis of k-means clustering approach on the breast cancer Wisconsin dataset. International Journal of Computer Assisted Radiology and Surgery. 2016; 11(11):2033-47.
[Crossref] [Google Scholar]
[14]Dubey AK, Gupta U, Jain S. Comparative study of k-means and fuzzy c-means algorithms on the breast cancer data. International Journal on Advanced Science, Engineering and Information Technology. 2018; 8(1):18-29.
[Crossref] [Google Scholar]
[15]Stasev YV, Kuznetsov AA, Nosik AM. Formation of pseudorandom sequences with improved autocorrelation properties. Cybernetics and Systems Analysis. 2007; 43(1):1-11.
[Crossref] [Google Scholar]
[16]Sharma N, Papadias CB. Euclidean distance maximizing rotations for quasi-orthogonal space-time codes with MPSK symbols. In international symposium on personal, indoor and mobile radio communications 2007 (pp. 1-5). IEEE.
[Google Scholar]
[17]Shao Z, Ma Q, Liu X, Ma J. An algorithm for shortest raster distance in Euclidean space with obstacles. In international conference on geoinformatics 2011 (pp. 1-4). IEEE.
[Google Scholar]
[18]Songhao Z, Juanjuan H, Wei S. Image classification using three order statistics in non-Euclidean spaces. In Chinese control and decision conference 2013 (pp. 69-73). IEEE.
[Crossref] [Google Scholar]
[19]Ma M, An J. Algorithms and implementation of long Euclidean-geometry LDPC codes for space communications. In international conference on information science and control engineering 2015 (pp. 100-4). IEEE.
[Crossref] [Google Scholar]
[20]Gong J, Li L, Chen G, Wu Y, Li J. An addressing and routing scheme based on modified Euclidean space for hexagonal networks. China Communications. 2015; 12(5):94-9.
[Crossref] [Google Scholar]
[21]Nasrullah S, Varma S. Greedy routing performance analysis of network embedded in hyperbolic and Euclidean Space. In international conference on computing and network communications 2015 (pp. 491-5). IEEE.
[Crossref] [Google Scholar]
[22]Lavrovska T, Rassomahin S. Physical model of pseudorandom codes in multidimensional Euclidean space. In international scientific-practical conference in communications science and technology 2016 (pp. 67-70). IEEE.
[Crossref] [Google Scholar]
[23]Afrasiyabi A, Badawi D, Nasir B, Yildi O, Vural FT, Çetin AE. Non-Euclidean vector product for neural networks. In international conference on acoustics, speech and signal processing (pp. 6862-6). IEEE.
[Crossref] [Google Scholar]
[24]Luchin DV, Trofimov AP, Yudin VV, Spodobaev MY, Filippov DV. Co-located radio direction finding in polarization fading conditions with increased Euclidean space dimension of signal vectors. In systems of signal synchronization, generating and processing in telecommunications 2018 (pp. 1-5). IEEE.
[Crossref] [Google Scholar]
[25]Qiao X, Zhou C, Xu C, Cui Z, Yang J. Action recognition with spatial-temporal representation analysis across Grassmannian manifold and Euclidean space. In international conference on image processing 2018 (pp. 3448-52). IEEE.
[Crossref] [Google Scholar]
[26]Zhang Z, Wang M, Huang Y, Nehorai A. Aligning infinite-dimensional covariance matrices in reproducing kernel Hilbert spaces for domain adaptation. In proceedings of the conference on computer vision and pattern recognition 2018 (pp. 3437-45). IEEE.
[Google Scholar]
[27]Xu R, Liu T. Rigidity of complete spacelike translating solitons in pseudo-Euclidean space. Journal of Mathematical Analysis and Applications. 2019; 477(1):692-707.
[Crossref] [Google Scholar]
[28]Lima BP, Santos NL, Sousa PA. Generalized translation hypersurfaces in Euclidean space. Journal of Mathematical Analysis and Applications. 2019; 470(2):1129-35.
[Crossref] [Google Scholar]
[29]Fampa M. Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. Discrete Applied Mathematics. 2019.
[Crossref] [Google Scholar]
[30]Benkhlifa A, Ghorbel F. An almost complete curvature scale space representation: Euclidean case. Signal Processing: Image Communication. 2019; 75:32-43.
[Crossref] [Google Scholar]
[31]Han SE. Homotopic properties of an MA-digitization of 2D Euclidean spaces. Journal of Computer and System Sciences. 2018; 95:165-76.
[Crossref] [Google Scholar]
[32]Deshmukh S, Al-Dayel I. Characterizing spheres by an immersion in Euclidean spaces. Arab Journal of Mathematical Sciences. 2017; 23(1):85-93.
[Crossref] [Google Scholar]