scholarly journals Construction of vector space and its application to facilitate bitwise XOR – Free operation to minimize the time complexity

2022 ◽  
Author(s):  
Radhakrishna Dodmane ◽  
Ganesh Aithal ◽  
Surendra Shetty
Keyword(s):  
Vector Space ◽  
Time Complexity

scholarly journals Time Complexity Reduction for the Application of Stream Cipher System Based XOR Free Operation

2019 ◽  
Vol 8 (3) ◽  
pp. 5402-5408
Keyword(s):  
Vector Space ◽  
Time Complexity ◽  
Data Exchange ◽  
Internet Applications ◽  
Cryptographic Algorithm ◽  
Fast Processing ◽  
Cryptographic System ◽  
Symmetric Key ◽  
Time Required ◽  
Fast Increase

Providing security to user information are the most important aspects of today’s internet applications. Due to the very fast increase in the internet applications, the value of data exchange also became important. Hence, the better security and fast processing of the system is at high demand in the communication-related communities. Cryptography is one such area of providing data security. The two major criteria that specify the significance of a cryptographic algorithm are the security provided against the various attacks and the time to perform the operations. The proposed system is a solution to the cryptographic system to reduce the time complexity by retaining the security of the algorithm as it is. The solution proposed is to reduce the processing time required for the XOR function. This solution is by generating; XOR values for the vector space mentioned by the tuple, later replace the same wherever required. These values of XOR depend on the tuple, which represents the vector. Algorithm and time complexity for the generation of the vector space of XOR values for the proposed space evaluated. The result of the work compared based on two Standard symmetric-key cipher systems, Advanced Encryption Standard (AES) and Blowfish. The results are also tested and analyzed for different data size for the time complexity.

Recognition of Birds in Blurred and Illumination Images by Local Features

2017 ◽  
Vol 7 (7) ◽  
pp. 243
Author(s):  
Suresha .M ◽  
. Sandeep
Keyword(s):  
Computer Vision ◽  
Time Complexity ◽  
Feature Detection ◽  
Feature Matching ◽  
Fast Algorithms ◽  
Local Features ◽  
Experimental Demonstration ◽  
Harris Corner ◽  
Blurred Image ◽  
Blurred Images

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.

On Semi - Pre irresolute Topological Vector Space

2018 ◽  
Vol 14 (3) ◽  
pp. 184-192
Author(s):  
Radhi Ali ◽  
◽  
Jalal Hussein Bayati ◽  
Suhad Hameed
Keyword(s):  
Vector Space ◽  
Topological Vector Space

Aplikasi Deteksi Kemiripan Tugas Paper

2017 ◽  
Vol 15 (2) ◽  
pp. 5
Author(s):  
Anthony Anggrawan ◽  
Azhari
Keyword(s):  
Information Retrieval ◽  
Vector Space ◽  
Vector Space Model ◽  
Mean Average Precision ◽  
Average Precision ◽  
Information Searching ◽  
Space Model ◽  
Model Method

Information searching based on users’ query, which is hopefully able to find the documents based on users’ need, is known as Information Retrieval. This research uses Vector Space Model method in determining the similarity percentage of each student’s assignment. This research uses PHP programming and MySQL database. The finding is represented by ranking the similarity of document with query, with mean average precision value of 0,874. It shows how accurate the application with the examination done by the experts, which is gained from the evaluation with 5 queries that is compared to 25 samples of documents. If the number of counted assignments has higher similarity, thus the process of similarity counting needs more time, it depends on the assignment’s number which is submitted.

Unifying Bayesian Inference and Vector Space Models for Improved Decipherment

2015 ◽  
Author(s):  
Qing Dou ◽  
Ashish Vaswani ◽  
Kevin Knight ◽  
Chris Dyer
Keyword(s):  
Bayesian Inference ◽  
Vector Space ◽  
Vector Space Models

Aplikasi Rekomendasi Buku Pada Katalog Perpustakaan Universitas Multimedia Nusantara Menggunakan Vector Space Model

2018 ◽  
Vol 9 (2) ◽  
pp. 97-105
Author(s):  
Richard Firdaus Oeyliawan ◽  
Dennis Gunawan
Keyword(s):  
Vector Space ◽  
Vector Space Model ◽  
Vector Model ◽  
Library Management ◽  
Space Model ◽  
Library Management System ◽  
Index Terms ◽  
Library Catalogue ◽  
Language Sample ◽  
F Measure

Library is one of the facilities which provides information, knowledge resource, and acts as an academic helper for readers to get the information. The huge number of books which library has, usually make readers find the books with difficulty. Universitas Multimedia Nusantara uses the Senayan Library Management System (SLiMS) as the library catalogue. SLiMS has many features which help readers, but there is still no recommendation feature to help the readers finding the books which are relevant to the specific book that readers choose. The application has been developed using Vector Space Model to represent the document in vector model. The recommendation in this application is based on the similarity of the books description. Based on the testing phase using one-language sample of the relevant books, the F-Measure value gained is 55% using 0.1 as cosine similarity threshold. The books description and variety of languages affect the F-Measure value gained. Index Terms—Book Recommendation, Porter Stemmer, SLiMS Universitas Multimedia Nusantara, TF-IDF, Vector Space Model

Series expansions for monogenic functions in Clifford algebras and their application

2020 ◽  
Vol 17 (3) ◽  
pp. 365-371
Author(s):  
Anatoliy Pogorui ◽  
Tamila Kolomiiets
Keyword(s):  
Partial Differential Equations ◽  
Differential Equations ◽  
Vector Space ◽  
Clifford Algebra ◽  
Clifford Algebras ◽  
Monogenic Function ◽  
Second Order ◽  
Series Expansions ◽  
Monogenic Functions ◽  
Partial Differential

This paper deals with studying some properties of a monogenic function defined on a vector space with values in the Clifford algebra generated by the space. We provide some expansions of a monogenic function and consider its application to study solutions of second-order partial differential equations.

Sign in / Sign up

Export Citation Format

Share Document