scholarly journals Autosetting soliton pulsation in a fiber laser by improved depth-first search algorithm

2021 ◽  
Author(s):  
Pei-Zhu Zheng ◽  
Ti-Jian Li ◽  
Handing Xia ◽  
Mengjun Feng ◽  
Meng Liu ◽  
...  
Keyword(s):  
Fiber Laser ◽  
Search Algorithm ◽  
Depth First Search

Corrections to a distributed depth-first search algorithm

1990 ◽  
Vol 35 (1) ◽  
pp. 55-56 ◽  
Author(s):  
Devendra Kumar ◽  
Sitharama S. Iyengar ◽  
Mohan B. Sharma
Keyword(s):  
Search Algorithm ◽  
Depth First Search

scholarly journals The Verb Form Analysis of Arabic Words Using Depth First Search (DFS) Algorithm

2019 ◽  
Vol 2 ◽  
pp. 255-258
Author(s):  
Sulaiman Musthofa Salim ◽  
Ahmad Subhan Yazid
Keyword(s):  
Search Algorithm ◽  
Test Results ◽  
Android Application ◽  
Artificial Intelligent ◽  
Form Analysis ◽  
Depth First Search ◽  
Goal State ◽  
Verb Forms ◽  
Blind Search ◽  
Made In

Arabic is one of the international languages and the language of the Qur'an widely used in Islam. Learning basic Arabic is important because the language is the foundation of learning Islam. The fault in determining the verb form will relate to wrong meaning. Overcoming the problem, Shorof is a part of the linguistic arabic used to determine the form and utility of a word. Shorof Praktis Krapyak is one of the shorof books that has been widely used by students in Indonesia because of its reliability and simplicity in recognizing the form of Arabic words. The research was conducted to build a system to determine the Arabic verb forms and their utilities by implementing the Depth First Search (DFS) algorithm. DFS is a blind search algorithm in the artificial intelligent discussion that represents a problem into states, generates them systematically and tests them until a goal state is found. Rules made in recognizing the verb form refer to the Shorof Praktis Krapyak which the system is implemented in an Android application. The test results showed that the system can recognize 100 word samples with 100% accuracy. In functionality, all of 30 respondents said that test results stated that the system can run properly. The usability test of the system stated that 55.0% of respondents strongly agreed, 41.6% are agreed and 3.3% choose neutral that this system can help them to recognize and analyze the verb forms in Arabic words.

scholarly journals Pengembangan Perangkat Lunak Generate File Akun Uang Kuliah Tunggal (UKT) Universitas Palangka Raya

2018 ◽  
Vol 8 (2) ◽  
pp. 166
Author(s):  
Viktor Handrianus Pranatawijaya ◽  
Putu Bagus Adidyana Anugrah Putra ◽  
Widiatry . ◽  
Nova Noor Kamala Sari
Keyword(s):  
Higher Education ◽  
Search Algorithm ◽  
State Universities ◽  
Study Program ◽  
Depth First Search ◽  
Research Technology ◽  
Operational Costs ◽  
The Cost ◽  
Unit Standard ◽  
Tuition Fee

Regulations concerning Single Tuition Fee have been contained in the Regulation of Minister of Research, Technology and Higher Education Number 39 of 2016. In addition, the Law on Higher Education Number 12 of 2012 Article 88 stipulates that the minister posseses the authority to set the unit standard for Higher Education operational costs which becomes the basis of state universities to set the costs charged by the students in the scope of Ministry of Research, Technology and Higher Education. University of Palangka Raya applies Generate File Software Development Account to determine the cost of Single Tuition Fee which is a development method of modified Waterfall software. This method consists of four stages; (1) Analysis; (2) Design; (3) Implementation, and; (4) Testing. Quicksort and Depth First Search Algorithm also implemented on system. Thus this website utilizes Generate Data Account of Single Tuition Fee which will work automatically from each Higher Education entry, namely SNMPTN, SBMPTN and SMMPTN-BARAT and create easier to the management team to change automatically the data of study program from students’ Singgle Tuition Fee account based on the specified study program.   Keywords:  Single Tuition Fee, Generate File, Quicksort, Depth First Search

scholarly journals Exploring graph traversal algorithms in graph-based molecular generation

2021 ◽  
Author(s):  
Rocío Mercado ◽  
Esben Bjerrum ◽  
Ola Engkvist
Keyword(s):  
Natural Products ◽  
Search Algorithm ◽  
Molecular Graph ◽  
Molecular Shape ◽  
Generative Models ◽  
Training Data ◽  
Depth First Search ◽  
Graph Traversal ◽  
The Impact ◽  
Traversal Algorithm

Here we explore the impact of different graph traversal algorithms on molecular graph generation. We do this by training a graph-based deep molecular generative model to build structures using a node order determined via either a breadth- or depth-first search algorithm. What we observe is that using a breadth-first traversal leads to better coverage of training data features compared to a depth-first traversal. We have quantified these differences using a variety of metrics on a dataset of natural products. These metrics include: percent validity, molecular coverage, and molecular shape. We also observe that using either a breadth- or depth-first traversal it is possible to over-train the generative models, at which point the results with the graph traversal algorithm are identical

scholarly journals Costas arrays searching algorithm based on vectors

2018 ◽  
Vol 232 ◽  
pp. 03028
Author(s):  
Dianhong Zhu ◽  
Jianguo Yao
Keyword(s):  
Wireless Communication ◽  
Search Algorithm ◽  
Algebraic Method ◽  
Exhaustive Search ◽  
Depth First Search ◽  
Check Matrix ◽  
Search Speed ◽  
The Ideal

Costas arrays have been widely applied in wireless communication, radar and cryptography as they have the ideal auto-ambiguity properties. Costas arrays are constructed mostly using the algebraic method, or they can be found by exhaustive search. This paper first introduces the Costas arrays and their properties and then proposes the vector-based algorithm to make depth-first search for Costas arrays since the exhaustive search algorithm based on check matrix is flawed. The experiment results indicate that the algorithm based on vectors has higher search speed on a single CPU when compared with the exhaustive searching algorithm based on check matrix.

Sign in / Sign up

Export Citation Format

Share Document