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.

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.

IMPLEMENTASI ALGORITMA SMITH PADA APLIKASI ISTILAH TEKNIK INDUSTRI KIMIA

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Nasib Marbun ◽  
Ahmad Riza Fuadi ◽  
Muasir Pagan ◽  
Suranta Bill Fatric Ginting ◽  
Muhammad Zarlis ◽  
...  
Keyword(s):  
Human Resources ◽  
Chemical Industry ◽  
General Public ◽  
String Matching ◽  
Visual Basic ◽  
Personal Computers ◽  
Foreign Languages ◽  
Search Process ◽  
Engineering Research ◽  
Search For Information

Companies engaged in the chemical industry really need Human Resources (HR) who have knowledge in the field of chemical industry engineering terms in order to achieve the company's main goals, but due to the chemical industry engineering terms that use foreign languages is essentially difficult to understand not a few of the general public who have desire to work in companies in the chemical industry engineering experience problems in mastering the knowledge needed by chemical industry engineering companies. Therefore it is necessary to have an application that adopts science related to the chemical industry engineering term along with good search features. The application that was built to search for information related to chemical industry engineering terms in this study implements the smith algorithm as an algorithm that serves to minimize the use of the time needed in the search process. The smith algorithm notices that counting the number of shifts with the text character that is located right next to the window character on the rightmost text can sometimes provide a shorter shift than using the rightmost window text character. Then he gives a solution to take the maximum between the two values. The application term of chemical industry engineering research was built using visual basic net 2008 and can be operated properly on personal computers supported by Windows OS. Keywords: Chemical Industry Engineering Terms, String Matching, Algorithms, Smith.

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.

scholarly journals Development Binary Search Algorithm

2011 ◽  
Vol 8 (2) ◽  
pp. 625-629
Author(s):  
Baghdad Science Journal
Keyword(s):  
Search Algorithm ◽  
Search Algorithms ◽  
Binary Search ◽  
Search Process ◽  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity ◽  
Order Of Magnitude ◽  
Binary Search Algorithm ◽  
Search Interval

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case complexity of Search) is O(log2 n) (pronounce this "big-Oh-n" or "the order of magnitude"), if we search in a list consists of (N) elements. In this research the number of comparison is reduced to triple by using Triple structure, this process makes the maximum number of comparisons is O(log2 (n)/3+1) if we search key in list consist of (N) elements.

scholarly journals Perancangan Aplikasi Pencarian Makna Motif Batik Menggunakan Metode Galil Seiferas

2020 ◽  
Vol 7 (2) ◽  
pp. 264
Author(s):  
Lisa Wardani
Keyword(s):  
Search Algorithm ◽  
Human Life ◽  
String Matching ◽  
The Internet ◽  
Search Process ◽  
Search For Meaning ◽  
Search System ◽  
The People ◽  
Word Search ◽  
The Right

For some people batik is only a cloth that is a characteristic of Indonesia, especially the area of Java, but not everyone knows that every motif on batik cloth has its own philosophical meaning where each meaning is closely related to human life. As the people of Indonesia it helps us to know the meaning behind the beauty of batik motifs, but not everyone knows the name of batik motifs and can search for meaning on the internet or what we often call browsing. The solution that can be done is to create an Android-based batik meaning search system that can provide convenience in searching for the meaning of batik motifs. Search is designed in an application that helps word search using string matching, the Galil Seiferas search algorithm. With the implementation of Seiferas Galil Algorithm on the Android-based batik meaning search system, it is expected to be able to carry out the right search process in displaying the meaning of batik motifs as well as being easier and faster. The system built is also very practical because it is based on Android, so it can make it easier for users to access anywhere

scholarly journals Autofocusing Optimal Search Algorithm for a Telescope System

2021 ◽  
pp. 2150012
Author(s):  
Islam Helmy ◽  
Alaa Hamdy ◽  
Doaa Eid ◽  
Ahmed Shokry
Keyword(s):  
Search Algorithm ◽  
Search Algorithms ◽  
Binary Search ◽  
Imaging Systems ◽  
Search Process ◽  
Optimal Search ◽  
Astronomical Observations ◽  
Telescope System ◽  
Auto Focusing

Focus accuracy affects the quality of the astronomical observations. Auto-focusing is necessary for imaging systems designed for astronomical observations. The automatic focus system searches for the best focus position by using a proposed search algorithm. The search algorithm uses the image’s focus levels as its objective function in the search process. This paper aims to study the performance of several search algorithms to select a suitable one. The proper search algorithm will be used to develop an automatic focus system for Kottamia Astronomical Observatory (KAO). The optimal search algorithm is selected by applying several search algorithms into five sequences of star-clusters observations. Then, their performance is evaluated based on two criteria, which are accuracy and number of steps. The experimental results show that the Binary search is the optimal search algorithm.

Analisa Algoritma Zhu-Takaoka pada Aplikasi Kamus Bahasa Gayo

2019 ◽  
Vol 1 ◽  
pp. 872
Author(s):  
Muhammad Syahrizal ◽  
Lince Tomoria Sianturi
Keyword(s):  
Search Algorithm ◽  
Two Dimensions ◽  
One Dimension ◽  
Search Process ◽  
Sequential Search ◽  
Search Technique ◽  
Daily Lives ◽  
Long Time ◽  
Word Search ◽  
The Right

Dictionary is a reference book that contains words and expressions which are usually arranged alphabetically and contain meaning and meaning. The dictionary serves as a person's tool to understand the meaning of words or new terms. The number of Gayo tribes who migrate and marry other tribes has resulted in many children of their descendants not understanding gayo language, so many of the descendants of the Gayo tribe do not understand Gayo language because in their daily lives they do not speak gayo but speak Malay Indonesia. This is the reason for gayo people who live outside the gayo area to have a dictionary of the terms gayo language to make it easier for them to understand the meaning of the gayo language when they return to the gayo area. In previous studies, AsepIrnaYuliana developed a dictionary application for the term psychology based on mobile psychology by applying a sequential search algorithm. Sequential search algorithm is a data search technique in an array of 1 (one) dimension that will trace all array elements from beginning to end, where data does not need to be sorted first. The author considers the search process using sequential search to be a problem because it has to do one by one matching of each character in the array elements which causes a long time needed in word search. To overcome the above problems the writer applies the zhu-takaoka algorithm. The zhu-takaoka algorithm is one of the string matching algorithms that can do a word search with many shifts with an array of 2 (two) dimensions. The core process of the zhu-takaoka algorithm is to do a word search with the Right-to-left scan rule technique.

A Fast Image Encoding Algorithm Based on the Pyramid Structure of Codewords

2009 ◽  
Vol 1 (4) ◽  
pp. 1-13 ◽  
Author(s):  
Ahmed A. Radwan ◽  
Ahmed Swilem ◽  
Mamdouh M. Gomaa
Keyword(s):  
Vector Quantization ◽  
Search Algorithm ◽  
Search Algorithms ◽  
Search Process ◽  
Image Encoding ◽  
Fast Search Algorithm ◽  
Pyramid Structure ◽  
Speed Up ◽  
Simulation Results ◽  
Full Search

This article presents a very simple and efficient algorithm for codeword search in the vector quantization encoding. This algorithm uses 2-pixel merging norm pyramid structure to speed up the closest codeword search process. The authors first derive a condition to eliminate unnecessary matching operations from the search procedure. Then, based on this elimination condition, a fast search algorithm is suggested. Simulation results show that, the proposed search algorithm reduces the encoding complexity while maintaining the same encoding quality as that of the full search algorithm. It is also found that the proposed algorithm outperforms the existing search algorithms.

scholarly journals Circumspect descent prevails in solving random constraint satisfaction problems

2008 ◽  
Vol 105 (40) ◽  
pp. 15253-15257 ◽  
Author(s):  
Mikko Alava ◽  
John Ardelius ◽  
Erik Aurell ◽  
Petteri Kaski ◽  
Supriya Krishnamurthy ◽  
...  
Keyword(s):  
Local Search ◽  
Linear Time ◽  
Search Algorithm ◽  
Solution Space ◽  
Search Algorithms ◽  
Constraint Satisfaction Problems ◽  
Problem Instance ◽  
Stochastic Local Search ◽  
Local Search Algorithms ◽  
Local Energy Minimum

We study the performance of stochastic local search algorithms for random instances of the K-satisfiability (K-SAT) problem. We present a stochastic local search algorithm, ChainSAT, which moves in the energy landscape of a problem instance by never going upwards in energy. ChainSAT is a focused algorithm in the sense that it focuses on variables occurring in unsatisfied clauses. We show by extensive numerical investigations that ChainSAT and other focused algorithms solve large K-SAT instances almost surely in linear time, up to high clause-to-variable ratios α; for example, for K = 4 we observe linear-time performance well beyond the recently postulated clustering and condensation transitions in the solution space. The performance of ChainSAT is a surprise given that by design the algorithm gets trapped into the first local energy minimum it encounters, yet no such minima are encountered. We also study the geometry of the solution space as accessed by stochastic local search algorithms.

scholarly journals Algorithm Implementation Crochemore Perrin On The Dictionary Application Of Latin Terms Flora And Fauna Based On Android

2020 ◽  
Vol 2 (1) ◽  
pp. 140-148
Author(s):  
Bobby Aris Sandy ◽  
Paska Marto Hasugian
Keyword(s):  
String Matching ◽  
Smartphone Application ◽  
Search Method ◽  
Search Process ◽  
Smartphone Applications ◽  
Matching Process ◽  
Data Search ◽  
String Search ◽  
Algorithm Implementation ◽  
Very High

Searching is the process of selecting the information needed from a collection of data that already exists, data search is often also called a tablelook-up or store and retrieval information. Along with the development of technology that is now so very rapid, one of them is the Smartphone application. Smartphone applications that are currently in demand are increasing sharply, that is Android. Even though the presentation is limited to the screen, Smartphones are quite efficient for its users where the mobility is very high and affordable in all circles of society. used is the string search method. String search method is a string search process or often also called string matching. In the string matching process, there is the Crochemore perrin algorithm, which is an algorithm that factoring a pattern into two parts, namely Pattrenkiri and pattern right. This method is perfect for dictionary search applications of Latin terms flora and fauna.

Sign in / Sign up

Export Citation Format

Share Document