cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Husni Teja Sukmana
Contact Email
husni@bright-journal.org
Phone
+62895422720524
Journal Mail Official
jads@bright-journal.org
Editorial Address
Gedung FST UIN Jakarta, Jl. Lkr. Kampus UIN, Cemp. Putih, Kec. Ciputat Tim., Kota Tangerang Selatan, Banten 15412
Location
Kota adm. jakarta pusat,
Dki jakarta
INDONESIA
Journal of Applied Data Sciences
Published by Bright Publisher
ISSN : -     EISSN : 27236471     DOI : doi.org/10.47738/jads
Core Subject : Science, Engineering,
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management
One of the current hot topics in science is data: how can datasets be used in scientific and scholarly research in a more reliable, citable and accountable way? Data is of paramount importance to scientific progress, yet most research data remains private. Enhancing the transparency of the processes applied to collect, treat and analyze data will help to render scientific research results reproducible and thus more accountable. The datasets itself should also be accessible to other researchers, so that research publications, dataset descriptions, and the actual datasets can be linked. The journal Data provides a forum to publish methodical papers on processes applied to data collection, treatment and analysis, as well as for data descriptors publishing descriptions of a linked dataset.
Arjuna Subject : Ilmu Komputer (semua kategori) - Kecerdasan Buatan
Articles 5 Documents
 1 
Search results for , issue "Vol 3, No 1: JANUARY 2022" : 5 Documents clear
SHA-512 Algorithm on Json Web Token for Restful Web Service-Based Authentication Rasyada, Naufal
Journal of Applied Data Sciences Vol 3, No 1: JANUARY 2022
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v3i1.51

Abstract

The development of technology is getting faster and continues to grow so as to create various types of technology, architecture, to new programming languages. Surely this will be a new problem because of differences in technology, programming language, and architecture that must still be able to provide interconnected sources of information. So in order for the system to remain integrated, a Web Service (WS) is needed as a bridge in integrating between systems without differentiating the platform, programming language, or architecture used. One of the Web Service architectures that is widely used is REST (REpresentational State Transfer), but there will be problems in implementing REST Web Service because it does not have security standards in the authentication process. Then an authentication method is needed, namely JSON Web Token (JWT). In implementing JWT, a hash algorithm is needed, such as SHA-512. The results of this study indicate that the use of SHA-512 on the JWT has a good speed with an average data request speed of 512.8 milliseconds (ms) when compared to the SHA-256 algorithm which has an average data request speed of 515.55 MS. Meanwhile, in terms of data size, SHA-512 produces an average data request size of 0.75 kilobytes (kb) compared to SHA-256 which has an average data request size of 0.72 kb.
Improved Expectation-Maximization Algorithm for Unknown Reverberant Audio-Source Separation Slehat, Shaher
Journal of Applied Data Sciences Vol 3, No 1: JANUARY 2022
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v3i1.52

Abstract

The problem of undecided Separating reverberant audio sources is crucial for speech and audio processing. Numerous separation strategies have been developed to solve this problem; however, all of them estimate model parameters in the time–frequency domain, resulting in permutation ambiguity and poor separation performance. Additionally, one of the main challenges with existing expectation–maximization (EM) strategies is the time needed for each iterative step to update the model parameters. In this article, we offer an enhanced EM approach that combines nonnegative matrix factorization (NMF) with time differences of arrival (TDOA) estimations while eliminating time expenditure to the EM algorithm's starting values being appropriately selected. The suggested approach avoids permutation ambiguity by using the NMF source model, and acoustic localization is accomplished by converting the TDOA. Following that, model parameters are changed to improve separation outcomes. Finally, Wiener filters are used to separate the source signals. The experimental findings indicate that the suggested algorithm outperforms current blind separation approaches in terms of source separation.
The Role of Methods and Applications of Artificial Intelligence Tools in the Field of Medicine to Diagnose and Discover Various Diseases Al-Shoteri, Ahmed Hammad
Journal of Applied Data Sciences Vol 3, No 1: JANUARY 2022
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v3i1.48

Abstract

The use of AI in healthcare has increased. It is now used in diagnosis, drug production, and improving hospital workflow between medical departments. The ability to examine large numbers of patients quickly is also a major use of artificial intelligence. Indeed, this field has made remarkable advances in early diagnosis and discovery of diseases through data, information, and radiograph analysis. The ability to predict disease outbreaks using AI analytics is dependent on data analysis and disease prediction. The current study aimed to assess the validity of previous research on artificial intelligence applications and their role in diagnosing and discovering diseases. This is to fill several gaps, such as the lack of recent studies in this field, especially Arab studies. The study also seeks to understand how artificial intelligence tools can help diagnose and discover diseases. The study yielded several findings. It is necessary to design systems and algorithms, as well as mechanisms and methods, to fully utilize artificial intelligence in this field. Neural networks, deep learning, fuzzy logic and others were addressed in previous studies, for their adoption and possible application because of their great impact according to the results of previous studies. Artificial intelligence can simultaneously monitor and process an unlimited number of inputs, revealing complex correlations that cannot be easily reduced. Finally, the researcher believes that artificial intelligence will increase efficiency, save time and effort, and reduce errors. Also, AI does not replace doctors because it lacks human qualities like empathy and compassion. The use of artificial intelligence in medicine will thus contribute to an approved and unprecedented scientific approach in this field to achieve the desired goals and objectives.
Knuth Morris Pratt String Matching Algorithm in Searching for Zakat Information and Social Activities Riawan, Fendi; Hariguna, Taqwa
Journal of Applied Data Sciences Vol 3, No 1: JANUARY 2022
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v3i1.49

Abstract

Algorithms are one of the components that need to be considered in the development of information systems. Determination of the algorithm is adjusted to the purpose of the system to be built. One algorithm that can be used is string matching. The string matching algorithm will play a role in searching for a string consisting of several characters (usually called a pattern). The method used in this research is string matching knuth morris pratt (KMP) which is used to search zakat information and social activities in the search engine system. KMP is a string matching algorithm with good performance. The results showed the performance of string matching using the KMP algorithm with 5 trials of input pattern on zakat information with execution times of 0.03 ms, 0.03 ms, 0.02 ms, 0.02 ms and 0.03 ms. And 5 times the input pattern experiment on social activities with execution time of 0.02 ms, 0.02 ms, 0.03 ms, 0.03 ms and 0.02 ms. Thus the average execution time of the KMP algorithm in string matching is 0.026 ms and 0.024 ms.
Application of Hash Sha-256 Algorithm in Website-Based Sales Software Engineering Khasanah, Fauziah Nikmatul
Journal of Applied Data Sciences Vol 3, No 1: JANUARY 2022
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v3i1.50

Abstract

Rapid technological developments can spur changes in the cycle of human activities, one of which is software engineering activities that continue to develop in accordance with technological developments, the development of software engineering activities is also developing methods of data security to withstand attacks from irresponsible parties. answer. This research was conducted to analyze the performance and robustness of the sha-256 data security method with ciphertext customization. The steps that the researchers took in conducting the analysis were collecting theory and case examples, designing programs, implementing programs, testing and saving the results. Based on this process, it can be concluded that ciphertext customization on sha-256 is needed to strengthen security and resistance to attacks from irresponsible parties, besides that the performance of sha-256 calculations with customization on ciphertext and without ciphertext is not too much different where only 65 ms difference based on the results of performance testing that researchers did.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2022 2022


Reset
Filter By Issues
All Issue Vol 7, No 1: January 2026 Vol 6, No 4: December 2025 Vol 6, No 3: September 2025 Vol 6, No 2: MAY 2025 Vol 6, No 1: JANUARY 2025 Vol 5, No 4: DECEMBER 2024 Vol 5, No 3: SEPTEMBER 2024 Vol 5, No 2: MAY 2024 Vol 5, No 1: JANUARY 2024 Vol 4, No 4: DECEMBER 2023 Vol 4, No 3: SEPTEMBER 2023 Vol 4, No 2: MAY 2023 Vol 4, No 1: JANUARY 2023 Vol 3, No 4: DECEMBER 2022 Vol 3, No 3: SEPTEMBER 2022 Vol 3, No 2: MAY 2022 Vol 3, No 1: JANUARY 2022 Vol 2, No 4: DECEMBER 2021 Vol 2, No 3: SEPTEMBER 2021 Vol 2, No 2: MAY 2021 Vol 2, No 1: JANUARY 2021 Vol 1, No 2: DECEMBER 2020 Vol 1, No 1: SEPTEMBER 2020 More Issue