scholarly journals Pencarian Data Barang Produk Atribut Sekolah Menggunakan Algoritma Binary Search

2021 ◽  
Vol 9 (1) ◽  
pp. 75
Author(s):  
Risma Dara Awal Aviantika ◽  
Kustanto Kustanto ◽  
Muhammad Hasbi

ABSTRACTTechnology and information that is growing and sophisticated must be balanced according to the needs. For it was made the application of binary algorithms for the search data goods production of school attributes. Many methods in search with the goal of making it easier to search, e.g. search data of production items of school attributes with binary search method. Convection in the search of production goods using the manual way by looking for the archive data written in the notebook, the purpose of this research is to create a data retrieval system of goods that will be applied as a data retrieval tool of goods, as well as change the system manual to the computing system. In this research using Binary Search algorithm. Binary search algorithm is a technique applied only on the sorted element (sorted). This research using method of binary search algorithm with analysis stage, system design, coding/construction, testing, and implementation. In the analysis stage, the collection of data conducted is observation and literature study. At the system design stage using Unified Modelling Language (UML) include the use case diagram, activity diagram, Sequence diagram, and Diagram class. At the construction stage using the Java programming language using Netbeans and MySQL Server tools while the implementation of this system is the application of data retrieval of goods. To know the eligibility of a system, it is necessary to test against the search time of 210 data each time duration, 0.0004 seconds, 0.0005 seconds, 0.0006 seconds, 0.0007 seconds, 0.0008 seconds, 0.0009 seconds, 0.0010 seconds, 0.0012 seconds, 0.0014 seconds, 0.00117 seconds. The final result of this study is the application of search for production goods with Binary Search Algorithm Method.

2020 ◽  
Vol 16 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Israa AL-Forati ◽  
Abdulmuttalib Rashid

This paper proposes a low-cost Light Emitting Diodes (LED) system with a novel arrangement that allows an indoor multi-robot localization. The proposed system uses only a matrix of low-cost LED installed uniformly on the ground of an environment and low-cost Light Dependent Resistor (LDR), each equipped on bottom of the robot for detection. The matrix of LEDs which are driven by a modified binary search algorithm are used as active beacons. The robot localizes itself based on the signals it receives from a group of neighbor LEDs. The minimum bounded circle algorithm is used to draw a virtual circle from the information collected from the neighbor LEDs and the center of this circle represents the robot’s location. The propose system is practically implemented on an environment with (16*16) matrix of LEDs. The experimental results show good performance in the localization process.


2011 ◽  
Vol 181-182 ◽  
pp. 109-112
Author(s):  
Xian Min Wei

This paper describes several current routing lookup algorithms, to study and analysize the complexity and operating practical performance of these routing lookup algorithms. The results show that although the binary search algorithm is not greatly improved in the searching performance, but in IPv6 environment, because searching performance of multi-branch Trie tree will decrease greatly, thus the superiority of binary search algorithm will be reflected better.


2017 ◽  
Vol 10 (2) ◽  
pp. 52
Author(s):  
Natarajan Meghanathan

Results of correlation study (using Pearson's correlation coefficient, PCC) between decay centrality (DEC) vs. degree centrality (DEG) and closeness centrality (CLC) for a suite of 48 real-world networks indicate an interesting trend: PCC(DEC, DEG) decreases with increase in the decay parameter δ (0 < δ < 1) and PCC(DEC, CLC) decreases with decrease in δ. We make use of this trend of monotonic decrease in the PCC values (from both sides of the δ-search space) and propose a binary search algorithm that (given a threshold value r for the PCC) could be used to identify a value of δ (if one exists, we say there exists a positive δ-spacer) for a real-world network such that PCC(DEC, DEG) ≥ r as well as PCC(DEC, CLC) ≥ r. We show the use of the binary search algorithm to find the maximum Threshold PCC value rmax (such that δ-spacermax is positive) for a real-world network. We observe a very strong correlation between rmax and PCC(DEG, CLC) as well as observe real-world networks with a larger variation in node degree to more likely have a lower rmax value and vice-versa.


2020 ◽  
Vol 69 (5) ◽  
pp. 4968-4978 ◽  
Author(s):  
Xiaodong Sun ◽  
Changchang Hu ◽  
Gang Lei ◽  
Zebin Yang ◽  
Youguang Guo ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document