scholarly journals Dictionary Of Psychology With Horspool Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 078-084
Author(s):  
Ade Mutiara Kartika ◽  
Poltak Sihombing ◽  
Ade Candra
Keyword(s):  
Data Storage ◽  
Search Algorithm ◽  
String Matching ◽  
Search Results ◽  
General Terms ◽  
Psychological Term ◽  
Search Information ◽  
Research Show

Dictionary is a reference that contains words and phrases that are usually sorted alphabetically and is followed by a description of the word or phrase. Dictionary consists of several types, one of which is a dictionary of terms. Psychology dictionary is a dictionary of terms that contain psychological term. Psychology dictionary is identical to the old tome in search and less efficient in its use. Made an Android-based application of psychology dictionary that applies the Horspool algorithm for terms search and SQLite for data storage is a solution. The search algorithm is needed to shorten the time in the search itself. Horspool algorithm apply a saved search information to shift even further because the string matching is done from right to left, so the time to search a string is shorter. Fields used in this research is psychology in general terms. By entering a psychological term as input in the search then we will get the search results. The results of this research show the entire pattern that matches the text.  

IMPLEMENTASI ALGORITMA RAITA SEARCH PADA APLIKASI FILSAFAT BERBASIS ANDROID

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Ratih Anggraini ◽  
Nelly Astuti Hasibuan ◽  
Suginam Suginam ◽  
Fince Tinus Waruwu
Keyword(s):  
Efficient Solution ◽  
Search Algorithm ◽  
String Matching ◽  
Search Process ◽  
Far Right ◽  
Matching Algorithm ◽  
Search Results ◽  
Search Feature ◽  
Long Time

Philosophy is the search for truth through a systematic flow of thinking, meaning that conversations about everything are carried out regularly following the prevailing system so that the stages are easy to follow. Etymologically philosophy comes from English and Greek, namely "philosophy" and "philein". This often causes difficulties to understand the meaning of the term philosophy. The term philosophy in general has a very large number so that to do the search for the meaning of the term philosophy in a philosophical book in the form of a printed book takes a long time because it must open one by one the book manually. To solve the problems described above the author builds an Android-based Philosophy application using eclipse juno. In order to simplify the search process for philosophical terms, the Raita search algorithm is implemented in the search feature contained in the Philosophy application. The raita search algorithm is a string matching algorithm with the arrangement of characters in a matched string that has the number and sequence of characters in the same string. Raita designed an algorithm by comparing the last character of the pattern starting from the far right character of the window. Android-based philosophy application that was built by the author in this study is expected to be an effective and efficient solution to get the search results of the meaning of the term philosophy in understanding the meaning of the term philosophy.Keywords: Implementation, Raita Search Algorithm, Philosophy Application, Android.

Optimal Elliptic Curve Cryptography-Based Effective Approach for Secure Data Storage in Clouds

2020 ◽  
Vol 11 (4) ◽  
pp. 65-81
Author(s):  
Anju Malik ◽  
Mayank Aggarwal ◽  
Bharti Sharma ◽  
Akansha Singh ◽  
Krishna Kant Singh
Keyword(s):  
Elliptic Curve ◽  
Data Storage ◽  
Elliptic Curve Cryptography ◽  
Search Algorithm ◽  
Distributed Storage ◽  
Data Retrieval ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Sensitive Data ◽  
Cloud Server

With the rapid development of cloud advancement, a data security challenge has emerged. In this paper, a technique based on elliptical cryptography and cuckoo search algorithm is proposed. With this technique, data owners securely store their data files in the cloud server. Initially the user sends a file storage request to store a file in a cloud server provider (CSP). The input file is checked whether it is sensitive or non-sensitive by the user. If the file is sensitive, then it would be split and stored in different virtual machines (VMs), and if the file is non-sensitive, then it would be assigned in a single VM. This approach was used for the first time as per the survey. To add further security, the sensitive data retrieval needs an encryption process that is supported by the proposed algorithm. If the data owner stores the sensitive data to cloud server, the data owner's document is encrypted by the double encryption technique. Here RSA and optimal elliptic curve cryptography (OECC) algorithm is used to encrypt the document with high security. The authors have used cuckoo search algorithm to identify the optimal key in ECC. This paper has proposed a novel cryptography approach for delivering mass distributed storage by which user's original data cannot be directly reached by cloud operators. Hence, this research has proved that the proposed work will give better securable data storage solving the security issues.

scholarly journals Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
De-Xin Yu ◽  
Zhao-Sheng Yang ◽  
Yao Yu ◽  
Xiu-Rong Jiang
Keyword(s):  
Data Storage ◽  
Road Network ◽  
Large Scale ◽  
Search Algorithm ◽  
Optimal Path ◽  
Search Method ◽  
Urban Road Network ◽  
Urban Road ◽  
Path Search ◽  
Route Search

Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

scholarly journals Efficiency of hybrid algorithm for COVID-19 online screening test based on its symptoms

2022 ◽  
Vol 25 (1) ◽  
pp. 440
Author(s):  
Mohd Kamir Yusof ◽  
Wan Mohd Amir Fazamin Wan Hamzah ◽  
Nur Shuhada Md Rusli
Keyword(s):  
Data Storage ◽  
Hybrid Algorithm ◽  
String Matching ◽  
Data Retrieval ◽  
World Health ◽  
Screening Process ◽  
System A ◽  
Extensible Markup ◽  
Health Organization ◽  
Hashing Algorithm

The coronavirus COVID-19 is affecting 196 countries and territories around the world. The number of deaths keep on increasing each day because of COVID-19. According to World Health Organization (WHO), infected COVID-19 is slightly increasing day by day and now reach to 570,000. WHO is prefer to conduct a screening COVID-19 test via online system. A suitable approach especially in string matching based on symptoms is required to produce fast and accurate result during retrieving process. Currently, four latest approaches in string matching have been implemented in string matching; characters-based algorithm, hashing algorithm, suffix automation algorithm and hybrid algorithm. Meanwhile, extensible markup language (XML), JavaScript object notation (JSON), asynchronous JavaScript XML (AJAX) and JQuery tehnology has been used widelfy for data transmission, data storage and data retrieval. This paper proposes a combination of algorithm among hybrid, JSON and JQuery in order to produce a fast and accurate results during COVID-19 screening process. A few experiments have been by comparison performance in term of execution time and memory usage using five different collections of datasets. Based on the experiments, the results show hybrid produce better performance compared to JSON and JQuery. Online screening COVID-19 is hopefully can reduce the number of effected and deaths because of COVID.

scholarly journals Penerapan Algoritma Horspool pada Aplikasi Katalog Buku Perpustakaan

2019 ◽  
Vol 1 ◽  
pp. 881
Author(s):  
Fince Tinus Waruwu ◽  
Rivalri Kristianto Hondro
Keyword(s):  
Reference Material ◽  
General Public ◽  
Search Algorithm ◽  
String Matching ◽  
Search Algorithms ◽  
Library Services ◽  
Search Process ◽  
Library Book ◽  
Long Time ◽  
Time And Energy

The library is a place that provides various types of reading books as reference material for students, students, educators and the general public. The library certainly provides various types of books that are different according to their needs. Finding books that are needed in a library with a large number of books certainly takes a long time and energy. In supporting library services and providing convenience for visitors, an application is built that helps visitors find the books they need to not need a long time and effort. In the book catalog application it is necessary to apply a search algorithm (string matching). Search algorithms help enders in finding the books they need. The search algorithm applied to the library book catalog application is the Horspool algorithm. Horspool algorithm is one algorithm that is widely used in the search process. By applying the Horspool algorithm in the library book catalog application can be faster and facilitate the process of finding the title of the book.

Rapid Search Algorithms of Local Registering Based on Decimal Tree

2013 ◽  
Vol 325-326 ◽  
pp. 1535-1538
Author(s):  
Zhen Hua Xia
Keyword(s):  
Search Algorithm ◽  
String Matching ◽  
Search Algorithms ◽  
Phone Number ◽  
Low Efficiency ◽  
Algorithm Implementation

In order to overcome the low efficiency of the database-based algorithm and the string-matching based algorithm in searching phone number, the two-level search algorithm by combining a decimal tree with a local registering table is proposed in this paper. The algorithm implementation is introduced in detail, and the experiments show that the decimal tree based algorithm is faster than the database-based algorithm and the string-matching based algorithm, especially much faster in the case of huge traffic.

Metaheuristic based auto-scaling for microservices in cloud environment: a new container-aware application scheduling

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Subramonian Krishna Sarma
Keyword(s):  
Resource Allocation ◽  
Data Storage ◽  
Virtual Machines ◽  
Search Algorithm ◽  
Case Scenario ◽  
Content Type ◽  
Dragonfly Algorithm ◽  
Platform As A Service ◽  
Adopted Model ◽  
Optimal Resource

Purpose The cloud is a network of servers to share computing resources to run applications and data storage that offers services in various flavours, namely, infrastructure as a service, platform as a service and software as a service. The containers in the cloud are defined as “standalone and self-contained units that package software and its dependencies together”. Similar to virtual machines, the virtualization method facilitates the resource on a specific server that could be used by numerous appliances. Design/methodology/approach This study introduces a new Dragon Levy updated squirrel algorithm (DLU-SA) for container aware application scheduling. Furthermore, the solution of optimal resource allocation is attained via defining the objective function that considers certain criteria such as “total network distance (TND), system failure (SF), balanced cluster use (BC) and threshold distance (TD)”. Eventually, the supremacy of the presented model is confirmed over existing models in terms of cost and statistical analysis. Findings On observing the outcomes, the total cost of an adopted model for Experimentation 1 has attained a lesser cost value, and it was 0.97%, 10.45% and 10.37% superior to traditional velocity updated grey wolf (VU-GWO), squirrel search algorithm (SSA) and dragonfly algorithm (DA) models, respectively, for mean case scenario. Especially, under best case scenario, the implemented model has revealed a minimal cost value of 761.95, whereas, the compared models such as whale random update assisted lion algorithm, VU-GWO, SSA and DA has revealed higher cost value of 761.98, 779.46, 766.62 and 766.51, respectively. Thus, the enhancement of the developed model has been validated over the existing works. Originality/value This paper proposes a new DLU-SA for container aware application scheduling. This is the first work that uses the DLU-SA model for optimal container resource allocation by taking into consideration of certain constraints such as TND, SF, BC and TD.

Construction of metadata database structured by conceptual elements of text structure and semantic search evaluation of Korean studies

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Young Man Ko ◽  
Min Sun Song ◽  
Seung Jun Lee
Keyword(s):  
Keyword Search ◽  
Search Algorithm ◽  
Interdisciplinary Studies ◽  
Text Structure ◽  
Semantic Search ◽  
Research Articles ◽  
Content Type ◽  
Search Results ◽  
Korean Studies ◽  
Data Points

Purpose This study aims to develop metadata of conceptual elements based on the text structure of research articles on Korean studies, to propose a search algorithm that reflects the combination of semantically relevant data in accordance with the search intention of research paper and to examine the algorithm whether there is a difference in the intention-based search results. Design/methodology/approach This study constructed a metadata database of 5,007 research articles on Korean studies arranged by conceptual elements of text structure and developed F1(w)-score weighted to conceptual elements based on the F1-score and the number of data points from each element. This study evaluated the algorithm by comparing search results of the F1(w)-score algorithm with those of the Term Frequency- Inverse Document Frequency (TF-IDF) algorithm and simple keyword search. Findings The authors find that the higher the F1(w)-score, the closer the semantic relevance of search intention. Furthermore, F1(w)-score generated search results were more closely related to the search intention than those of TF-IDF and simple keyword search. Research limitations/implications Even though the F1(w)-score was developed in this study to evaluate the search results of metadata database structured by conceptual elements of text structure of Korean studies, the algorithm can be used as a tool for searching the database which is a tuning process of weighting required. Practical implications A metadata database based on text structure and a search method based on weights of metadata elements – F1(w)-score – can be useful for interdisciplinary studies, especially for semantic search in regional studies. Originality/value This paper presents a methodology for supporting IR using F1(w)-score—a novel model for weighting metadata elements based on text structure. The F1(w)-score-based search results show the combination of semantically relevant data, which are otherwise difficult to search for using similarity of search words.

scholarly journals A New Library-Search Algorithm for Mixture Analysis Using DART-MS

2021 ◽  
Author(s):  
Arun Moorthy ◽  
Edward Sisco
Keyword(s):  
Mass Spectrum ◽  
Mass Spectra ◽  
Search Algorithm ◽  
Collision Induced Dissociation ◽  
Two Stage ◽  
Library Search ◽  
Prototype Implementation ◽  
Search Results ◽  
Protonated Molecules ◽  
Acetyl Fentanyl

This manuscript introduces a new library-search algorithm for identifying components of a mixture using in-source collision-induced dissociation (is-CID) mass spectra. The two-stage search, titled the Inverted Library-Search Algorithm (ILSA), identifies potential components in a mixture by first searching its low fragmentation mass spectrum for target peaks, assuming these peaks are protonated molecules, and then scoring each target peak with possible library matches using one of two schemes. Utility of the ILSA is demonstrated through several example searches of model mixtures of acetyl fentanyl, benzyl fentanyl, amphetamine and methamphetamine searched against a small library of select compounds and the NIST DART-MS Forensics library. Discussion of the search results and several open areas of research to further extend the method are provided. A prototype implementation of the ILSA is available at <a href="https://github.com/asm3-nist/DART-MS-DST">https://github.com/asm3-nist/DART-MS-DST</a>.

scholarly journals Design a Framework for Content Based Image Retrieval Using Hybrid Features Analysis

2021 ◽  
Vol 38 (5) ◽  
pp. 1449-1459
Author(s):  
Ankit Kumar ◽  
Kamred Udham Singh ◽  
Linesh Raja ◽  
Teekam Singh ◽  
Chetan Swarup ◽  
...  
Keyword(s):  
Data Storage ◽  
Data Sources ◽  
Image Recovery ◽  
Research Model ◽  
Combined Method ◽  
Exciting Field ◽  
Query Image ◽  
Hybrid Features ◽  
Search Results ◽  
Proposed Model

In recent years, scholars have found content-based image recovery to be a particularly interesting and exciting field. This field develops quick image recovery algorithms that are very similar to pictures from various data sources. There is currently a lot of space and sources for data storage. Finally, once data sources are obtained, there is just competition for the exact and best result. The result is filtered using the heuristic correlation based on the above features of the photographs. The overall matching scores are calculated by adding all these individual feature ratings. The recommended method will be used to retrieve all images containing the content of the query image. The scores will be used to rate the match. The results of the combined method simulation demonstrate that the strategy is successful. This proposed model will improve the accuracy of search results. This research model, like the other metadata models on the web, is interactive and familiar for searching pictures from huge databases and data sources. This model also has a number of handy features built in to improve precision and efficiency. Although there are a few little mysteries in this model, they must be answered subsequently.

Sign in / Sign up

Export Citation Format

Share Document