scholarly journals Identification of Lampung Script Using K-Neighbor, Manhattan Distance And Population Matrix Algorithm

2021 ◽  
Vol 1933 (1) ◽  
pp. 012064
Author(s):  
Gladys Ivana Augusta ◽  
Lukman Hakim ◽  
Anna Gustina Zainal ◽  
Hendy Tannady
Keyword(s):  
Manhattan Distance ◽  
Matrix Algorithm ◽  
Population Matrix

Cloud-integrated wireless-optical broadband access network with survivability

2020 ◽  
Vol 10 ◽  
Author(s):  
Sangita Solanki ◽  
Raksha Upadhyay ◽  
Uma Rathore Bhatt
Keyword(s):  
Access Network ◽  
Access Networks ◽  
Manhattan Distance ◽  
Broadband Access ◽  
Optical Access Networks ◽  
Component Level ◽  
Backup Path ◽  
Wireless Router ◽  
Path Computation ◽  
Broadband Access Network

Cloud-integrated wireless optical broadband (CIW) access networks inheriting advantages of cloud computing, wireless and optical access networks have a broad prospect in the future. Due to failure of components like OLT level, ONU level, link or path failure and cloud component level in CIW, survivability is becoming one of the important issues. In this paper, we have presented cloud-integrated wireless-optical broadband access network with survivability using integer linear programming (ILP) model, to minimize the number of cloud components while providing maximum backup paths. Hence, we have proposed protection through cloud-integrated wireless router to available ONUs (PCIWRAO). So, evaluated the backup path computation. We have considered ONU level failure in which the affected traffic is transferred through wireless routers and cloud component to the available ONUs using Manhattan distance algorithm. Simulation results show different configurations for different number of routers and cloud components illustrating available backup path when ONU fails.

Hybrid Deep Neural Model for Duplicate Question Detection in Transliterated Bi-lingual Data

2019 ◽  
Vol 12 ◽  
Author(s):  
Seema Rani ◽  
Avadhesh Kumar ◽  
Naresh Kumar
Keyword(s):  
Question Answering ◽  
Neural Model ◽  
Manhattan Distance ◽  
Semantic Matching ◽  
English Only ◽  
Detection Model ◽  
Proposed Model ◽  
Reported Study ◽  
Social Media Platforms ◽  
Efficient Information

Background: Duplicate content often corrupts the filtering mechanism in online question answering. Moreover, as users are usually more comfortable conversing in their native language questions, transliteration adds to the challenges in detecting duplicate questions. This compromises with the response time and increases the answer overload. Thus, it has now become crucial to build clever, intelligent and semantic filters which semantically match linguistically disparate questions. Objective: Most of the research on duplicate question detection has been done on mono-lingual, majorly English Q&A platforms. The aim is to build a model which extends the cognitive capabilities of machines to interpret, comprehend and learn features for semantic matching in transliterated bi-lingual Hinglish (Hindi + English) data acquired from different Q&A platforms. Method: In the proposed DQDHinglish (Duplicate Question Detection) Model, firstly language transformation (transliteration & translation) is done to convert the bi-lingual transliterated question into a mono-lingual English only text. Next a hybrid of Siamese neural network containing two identical Long-term-Short-memory (LSTM) models and Multi-layer perceptron network is proposed to detect semantically similar question pairs. Manhattan distance function is used as the similarity measure. Result: A dataset was prepared by scrapping 100 question pairs from various social media platforms, such as Quora and TripAdvisor. The performance of the proposed model on the basis of accuracy and F-score. The proposed DQDHinglish achieves a validation accuracy of 82.40%. Conclusion: A deep neural model was introduced to find semantic match between English question and a Hinglish (Hindi + English) question such that similar intent questions can be combined to enable fast and efficient information processing and delivery. A dataset was created and the proposed model was evaluated on the basis of performance accuracy. To the best of our knowledge, this work is the first reported study on transliterated Hinglish semantic question matching.

Analysis of grid operation state based on improved maximum eigenvalue sample covariance matrix algorithm

2021 ◽  
pp. 095965182110012
Author(s):  
Dinghui Wu ◽  
Juan Zhang ◽  
Bo Wang ◽  
Tinglong Pan
Keyword(s):  
Covariance Matrix ◽  
Signal To Noise Ratio ◽  
Poor Performance ◽  
Sample Covariance Matrix ◽  
Maximum Eigenvalue ◽  
Signal To Noise ◽  
Matrix Algorithm ◽  
Sample Covariance ◽  
Noise Ratio ◽  
Application Fields

Traditional static threshold–based state analysis methods can be applied to specific signal-to-noise ratio situations but may present poor performance in the presence of large sizes and complexity of power system. In this article, an improved maximum eigenvalue sample covariance matrix algorithm is proposed, where a Marchenko–Pastur law–based dynamic threshold is introduced by taking all the eigenvalues exceeding the supremum into account for different signal-to-noise ratio situations, to improve the calculation efficiency and widen the application fields of existing methods. The comparison analysis based on IEEE 39-Bus system shows that the proposed algorithm outperforms the existing solutions in terms of calculation speed, anti-interference ability, and universality to different signal-to-noise ratio situations.

Linkage analysis using geographical proximity: a test of the efficacy of distance measures

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shumpei Haginoya ◽  
Aiko Hanayama ◽  
Tamae Koike
Keyword(s):  
Environmental Factors ◽  
Euclidean Distance ◽  
Distance Measure ◽  
Distance Measures ◽  
Manhattan Distance ◽  
Geographical Proximity ◽  
Discrimination Accuracy ◽  
Content Type ◽  
Shortest Route ◽  
The Impact

Purpose The purpose of this paper was to compare the accuracy of linking crimes using geographical proximity between three distance measures: Euclidean (distance measured by the length of a straight line between two locations), Manhattan (distance obtained by summing north-south distance and east-west distance) and the shortest route distances. Design/methodology/approach A total of 194 cases committed by 97 serial residential burglars in Aomori Prefecture in Japan between 2004 and 2015 were used in the present study. The Mann–Whitney U test was used to compare linked (two offenses committed by the same offender) and unlinked (two offenses committed by different offenders) pairs for each distance measure. Discrimination accuracy between linked and unlinked crime pairs was evaluated using area under the receiver operating characteristic curve (AUC). Findings The Mann–Whitney U test showed that the distances of the linked pairs were significantly shorter than those of the unlinked pairs for all distance measures. Comparison of the AUCs showed that the shortest route distance achieved significantly higher accuracy compared with the Euclidean distance, whereas there was no significant difference between the Euclidean and the Manhattan distance or between the Manhattan and the shortest route distance. These findings give partial support to the idea that distance measures taking the impact of environmental factors into consideration might be able to identify a crime series more accurately than Euclidean distances. Research limitations/implications Although the results suggested a difference between the Euclidean and the shortest route distance, it was small, and all distance measures resulted in outstanding AUC values, probably because of the ceiling effects. Further investigation that makes the same comparison in a narrower area is needed to avoid this potential inflation of discrimination accuracy. Practical implications The shortest route distance might contribute to improving the accuracy of crime linkage based on geographical proximity. However, further investigation is needed to recommend using the shortest route distance in practice. Given that the targeted area in the present study was relatively large, the findings may contribute especially to improve the accuracy of proactive comparative case analysis for estimating the whole picture of the distribution of serial crimes in the region by selecting more effective distance measure. Social implications Implications to improve the accuracy in linking crimes may contribute to assisting crime investigations and the earlier arrest of offenders. Originality/value The results of the present study provide an initial indication of the efficacy of using distance measures taking environmental factors into account.

scholarly journals A Scheme of Selecting Vehicles to Assist Download Based on WebGIS for VANET

2022 ◽  
Author(s):  
Qibin Zhou ◽  
Qinggang Su ◽  
Peng Xiong
Keyword(s):  
Euclidean Distance ◽  
Global Optimum ◽  
Manhattan Distance ◽  
Web Browser ◽  
Problem Of Time ◽  
Time Space ◽  
Blind Area ◽  
Markov Decision ◽  
Platform Independence ◽  
Client Side

The assisted download is an effective method solving the problem that the coverage range is insufficient when Wi-Fi access is used in VANET. For the low utilization of time-space resource within blind area and unbalanced download services in VANET, this paper proposes an approximate global optimum scheme to select vehicle based on WebGIS for assistance download. For WebGIS, this scheme uses a two-dimensional matrix to respectively define the time-space resource and the vehicle selecting behavior, and uses Markov Decision Process to solve the problem of time-space resource allocation within blind area, and utilizes the communication features of VANET to simplify the behavior space of vehicle selection so as to reduce the computing complexity. At the same time, Euclidean Distance(Metric) and Manhattan Distance are used as the basis of vehicle selection by the proposed scheme so that, in the case of possessing the balanced assisted download services, the target vehicles can increase effectively the total amount of user downloads. Experimental results show that because of the wider access range and platform independence of WebGIS, when user is in the case of relatively balanced download services, the total amount of downloads is increased by more than 20%. Moreover, WebGIS usually only needs to use Web browser (sometimes add some plug-ins) on the client side, so the system cost is greatly reduced.

scholarly journals HUMAN IDENTIFICATION BASED ON FACE RECOGNITION SYSTEM

2021 ◽  
Vol 25 (01) ◽  
pp. 80-91
Author(s):  
Saba K. Naji ◽  
◽  
Muthana H. Hamd ◽  
Keyword(s):  
Face Recognition ◽  
Euclidean Distance ◽  
Local Binary Pattern ◽  
Texture Features ◽  
Recognition System ◽  
Manhattan Distance ◽  
Distance Measurements ◽  
Local Ternary Pattern ◽  
Face Recognition System ◽  
Cosine Distance

Due to, the great electronic development, which reinforced the need to define people's identities, different methods, and databases to identification people's identities have emerged. In this paper, we compare the results of two texture analysis methods: Local Binary Pattern (LBP) and Local Ternary Pattern (LTP). The comparison based on comparing the extracting facial texture features of 40 and 401 subjects taken from ORL and UFI databases respectively. As well, the comparison has taken in the account using three distance measurements such as; Manhattan Distance (MD), Euclidean Distance (ED), and Cosine Distance (CD). Where the maximum accuracy of the LBP method (99.23%) is obtained with a Manhattan and ORL database, while the LTP method attained (98.76%) using the same distance and database. While, the facial database of UFI shows low quality, which is satisfied 75.98% and 73.82% recognition rates using LBP and LTP respectively with Manhattan distance.

Sign in / Sign up

Export Citation Format

Share Document