scholarly journals filtering sinyal menggunakan bandpass filter

2021 ◽  
Vol 2 (1) ◽  
pp. 19-23
Author(s):  
Agus Muliadi ◽  
Khairul Muttaqin
Keyword(s):  
Information System ◽  
Information Content ◽  
Binary Tree ◽  
Data Access ◽  
Data Retrieval ◽  
Search Tree ◽  
Hierarchical Organization ◽  
Binary Search Tree ◽  
Multilevel Marketing ◽  
The Right

Multilevel Marketing (MLM) business visualizes a business network into a hierarchical tree consisting of relationships between nodes. In its application, a branch is generated from each node which when visualized becomes a tree with a height that continues to increase and will consume space which will have an impact in terms of less than optimal data access. In order for the tree structure to be formed from relationships between nodes with hierarchically ordered data, and to streamline time in the search and data access process, an MLM business process information system was built by applying the Binary Tree algorithm. The concept in the Binary tree itself is a hierarchical organization of several nodes, where each node has no more than 2. Nodes that are under a node are called children of the node. A node above a node is called the parent of that node. A binary search tree is a search in a binary tree by tracing nodes that are placed in the left branch if the information content sent is smaller than the information at the root, or tracing the right branch if the information content is stated to be greater than the root. The goal is to implement sorted data into the information system in accordance with the hierarchy of the MLM system and in this way data retrieval can be done quickly and easily.

scholarly journals RANCANG BANGUN SISTEM INFORMASI USAHA MIKRO KECIL MENENGAH STUDI KASUS DINAS KOPERASI UMKM DAERAH ISTIMEWA YOGYAKARTA

Infotekmesin ◽  
2019 ◽  
Vol 9 (02) ◽  
pp. 91-95
Author(s):  
Annas Setiawan Prabowo ◽  
Lutfi Syafirullah
Keyword(s):  
Information System ◽  
Data Retrieval ◽  
Search Process ◽  
Accurate Data ◽  
Development Programs ◽  
Data Loss ◽  
Consultation Process ◽  
Development Method ◽  
Speed Up ◽  
The Right

Information about UMKM is very much needed by the Cooperative Office of UMKM in determining the direction of MSME development. Accurate data will have the right impact in determining development programs and services for SMEs. The problem that often occurs in managing UMKM data and Consultation is that management is still done  manually using a book, so the risk for data loss, double data, and data retrieval are difficult when data is needed quickly. So based on these problems it is necessary to have an Information System to manage MSME data. The method used is the waterfall software development method. The results of this study are systems that can facilitate datamanagement, speed up the data search process, classify according to criteria so that it can be used as a reference in the development and service of MSMEs and assist cooperative service consultants in the business consultation process.

PERFORMANCE APPRAISAL OF TREAP AND HEAP SORT ALGORITHMS

2020 ◽  
Vol 18 (1) ◽  
pp. 1-10
Author(s):  
A. D. GBADEBO ◽  
A. T. AKINWALE ◽  
S. AKINLEYE
Keyword(s):  
Performance Appraisal ◽  
Binary Tree ◽  
Ordered Set ◽  
Search Time ◽  
Search Tree ◽  
Binary Search Tree ◽  
Complete Binary Tree ◽  
Totally Ordered Set ◽  
Rooted Binary Tree ◽  
Fast Access

The task of storing items to allow for fast access to an item given its key is an ubiquitous problem in many organizations. Treap as a method uses key and priority for searching in databases. When the keys are drawn from a large totally ordered set, the choice of storing the items is usually some sort of search tree. The simplest form of such tree is a binary search tree. In this tree, a set X of n items is stored at the nodes of a rooted binary tree in which some item y ϵ X is chosen to be stored at the root of the tree. Heap as data structure is an array object that can be viewed as a nearly complete binary tree in which each node of the tree corresponds to an element of the array that stores the value in the node. Both algorithms were subjected to sorting under the same experimental environment and conditions. This was implemented by means of threads which call each of the two methods simultaneously. The server keeps records of individual search time which was the basis of the comparison. It was discovered that treap was faster than heap sort in sorting and searching for elements using systems with homogenous properties.    

scholarly journals A Generalised Approach to the use of Sampling for Rapid Object Location

2008 ◽  
Vol 18 (1) ◽  
pp. 7-19 ◽  
Author(s):  
E. Davies
Keyword(s):  
A Priori ◽  
Sampling Strategy ◽  
Sampling Technique ◽  
Search Tree ◽  
Object Location ◽  
Binary Search Tree ◽  
Edge Location ◽  
Regular Sampling ◽  
Edge Based ◽  
The Right

A Generalised Approach to the use of Sampling for Rapid Object LocationThis paper has developed a generalised sampling strategy for the rapid location of objects in digital images. In this strategya prioriinformation on the possible locations of objects is used to guide the sampling process, and earlier body-based and edge-based approaches emerge automatically on applying the righta prioriprobability maps. In addition, the limitations of the earlier regular sampling technique have been clarified and eased—with the result that sampling patterns are better matched to the positions of the image boundaries. These methods lead to improved speeds of operation both in the cases where all the objects in an image have to be located and also where the positions of individual objects have to be updated. Finally, the method is interesting in being intrinsically able to perform full binary search tree edge location without the need for explicit programming.

ANALISA STRATEGI SISTEM INFORMASI MENGGUNAKAN PENDEKATAN METODESWOT DI BANDUNGINSIGHT

2019 ◽  
Vol 2 (1) ◽  
pp. 1-9
Author(s):  
Nova Indrayana Yusman
Keyword(s):  
Information System ◽  
Swot Analysis ◽  
Survey Methods ◽  
Data Retrieval ◽  
Business Strategies ◽  
Information Strategies ◽  
Processing Information ◽  
System Data ◽  
The Right ◽  
A Company

Bandung Insight is a company that has just been established in mid 2018, and has just begun in the field of information systems. For a new company, and of course there are still many shortcomings in various fields. And according to the observations of the author,  the system that is used today is just working alternately, because it has not found the right information system that will be used in the future.In this system, data retrieval uses survey methods in collecting and processing information data to contain an overview of the situation in the object of the studies. As for the design of the information system, the author tries to use the SWOT analysis approach. Why? Because the reasoning of this system will be useful if its implementation is in accordance with the goals, vision and mission of the company by implementing information strategies and business strategies.

scholarly journals Average depth in a binary search tree with repeated keys

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Margaret Archibald ◽  
Julien Clément
Keyword(s):  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Average Depth ◽  
Binary Search Trees ◽  
Search Trees ◽  
Random Sequences ◽  
International Audience ◽  
The Right

International audience Random sequences from alphabet $\{1, \ldots,r\}$ are examined where repeated letters are allowed. Binary search trees are formed from these, and the average left-going depth of the first $1$ is found. Next, the right-going depth of the first $r$ is examined, and finally a merge (or 'shuffle') operator is used to obtain the average depth of an arbitrary node, which can be expressed in terms of the left-going and right-going depths. The variance of each of these parameters is also found.

PENERAPAN PERSEPSI ORANGTUA DALAM MEMENUHI HAK PARTISIPASI ANAK USIA 9-12 TAHUN DI DESA BENA AMANUBAN SELATAN NUSA TENGGARA TIMUR

2019 ◽  
Vol 1 (2) ◽  
pp. 121-138
Author(s):  
Lodiana Nitti ◽  
Friandry Windisany Thoomaszen
Keyword(s):  
Qualitative Research ◽  
Research Methods ◽  
Growth And Development ◽  
Data Retrieval ◽  
Qualitative Research Methods ◽  
Parental Perception ◽  
The Third ◽  
Self Interest ◽  
Participation Rights ◽  
The Right

ABSTRACT Parental perception will affect the fulfillment of children’s participation rights. Fullfilment of children’s participation rights will be fulfilled optimally if parents pay anttention to opinions while providing opportunities for children to make and make decisions about the child’s goals and self-interest. The subjects studied consisted of 5 subjects consisting of father and mother who had children aged 9- 12 years. This study uses qualitative research methods, with data retrieval tools in teh form of interviews, observation and documentation. From the research found data were the subjects do not fulfill the right of participation of children up to the maximum ladder where children’s participation rights range from the first ladder to the third ladder. The first ladder to the third ladder is actually a non- participating ladder. This means that children is manipulated, dominated by parents, there is direct communation and the severity of the parent. The children felt disappointed, sad, and angry with the parents but they still tried to hear and obey the parent’s decision. Children from third and fourth subjects experienced excessive fear to speak to their parent (father). Suggestions for parents to be more caring and fulfill the rights of children’s participation so as not to affect the growth and development of children. Keywords: participation rights, children, parents

Prevalence and Characteristics of Liver Cancer Patients in Immanuel Hospital Bandung within January 2013 until December 2014 Period

2016 ◽  
Vol 1 (4) ◽  
Author(s):  
Achmad R. Permadi ◽  
Hana Ratnawati ◽  
Teresa L. Wargasetia
Keyword(s):  
Liver Cancer ◽  
Cancer Patients ◽  
Medical Records ◽  
Clinical Symptoms ◽  
Data Retrieval ◽  
Common Cancer ◽  
Key Words Liver Cancer ◽  
Liver Cancer Patient ◽  
Right Lobe ◽  
The Right

Liver cancer is the fifth most common cancer in Indonesia. This research is to find out the prevalence and characteristics of liver cancer patients in Immanuel Hospital Bandung within the January 2013 until December 2014 period based on age, gender, clinical symptoms and predilections. This study was a descriptive verificative research with data retrieval of patients medical records that have been diagnosed with liver cancer that were hospitalized in Immanuel Hospital Bandung within January 2013 until December 2014 period. The study showed that the liver cancer patient prevalence in Immanuel Hospital Bandung within the period of January 2013 until December 2014 was 46 people. Characteristics of liver cancer patients in Immanuel Hospital Bandung within January 2013 until December 2014 period showed that the most liver cancer patients were male, compare with female with ratio 4:1, the most common age group of 56-65 years old, the most common clinical symptoms were abdominal pain with or without reffered pain to the right scapular bone and the most common predilection was right lobe of the liver. Key words: liver cancer, patients' characteristics, prevalence 

Requirements Prioritization Techniques for Global Software Engineering

2017 ◽  
Vol 6 (1) ◽  
Author(s):  
Samina Saghir ◽  
Tasleem Mustafa
Keyword(s):  
Software Engineering ◽  
Requirements Engineering ◽  
Search Tree ◽  
Software Requirements ◽  
Binary Search Tree ◽  
Time Zone ◽  
Analytic Hierarchy ◽  
Requirements Prioritization ◽  
Global Software Engineering ◽  
Hierarchy Process

<p>Increase in globalization of the industry of software requires an exploration of requirements engineering (RE) in software development institutes at multiple locations. Requirements engineering task is very complicated when it is performed at single site, but it becomes too much complex when stakeholder groups define well-designed requirements under language, time zone and cultural limits. Requirements prioritization (RP) is considered as an imperative part of software requirements engineering in which requirements are ranked to develop best-quality software. In this research, a comparative study of the requirements prioritization techniques was done to overcome the challenges initiated by the corporal distribution of stakeholders within the organization at multiple locations. The objective of this study was to make a comparison between five techniques for prioritizing software requirements and to discuss the results for global software engineering. The selected techniques were Analytic Hierarchy Process (AHP), Cumulative Voting (CV), Value Oriented Prioritization (VOP), Binary Search Tree (BST), and Numerical Assignment Technique (NAT). At the end of the research a framework for Global Software Engineering (GSE) was proposed to prioritize the requirements for stakeholders at distributed locations.<strong></strong></p>

scholarly journals Bloom Filter-Based Parallel Architecture for Accelerating Equi-Join Operation on FPGA

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1778
Author(s):  
Binhao He ◽  
Meiting Xue ◽  
Shubiao Liu ◽  
Wei Luo
Keyword(s):  
Relational Databases ◽  
Parallel Architecture ◽  
Operation Time ◽  
Bloom Filter ◽  
Search Tree ◽  
Binary Search Tree ◽  
Maximum Acceleration ◽  
Data Intensive ◽  
Match Rate ◽  
Field Programmable

As one of the most important operations in relational databases, the join is data-intensive and time-consuming. Thus, offloading this operation using field-programmable gate arrays (FPGAs) has attracted much interest and has been broadly researched in recent years. However, the available SRAM-based join architectures are often resource-intensive, power-consuming, or low-throughput. Besides, a lower match rate does not lead to a shorter operation time. To address these issues, a Bloom filter (BF)-based parallel join architecture is presented in this paper. This architecture first leverages the BF to discard the tuples that are not in the join result and classifies the remaining tuples into different channels. Second, a binary search tree is used to reduce the number of comparisons. The proposed method was implemented on a Xilinx FPGA, and the experimental results show that under a match rate of 50%, our architecture achieved a high join throughput of 145.8 million tuples per second and a maximum acceleration factor of 2.3 compared to the existing SRAM-based join architectures.

scholarly journals E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 4
Author(s):  
Bayan Alabdullah ◽  
Natalia Beloff ◽  
Martin White
Keyword(s):  
Data Storage ◽  
Statistical Tests ◽  
Data Encryption ◽  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Security Level ◽  
Avalanche Effect ◽  
High Security Level ◽  
Tree Data Structure

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

Sign in / Sign up

Export Citation Format

Share Document