cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Advances in Intelligent Informatics
Published by Universitas Ahmad Dahlan
ISSN : 24426571     EISSN : 25483161     DOI : 10.26555
Core Subject : Science,
Computer Science & IT
International journal of advances in intelligent informatics (IJAIN) e-ISSN: 2442-6571 is a peer reviewed open-access journal published three times a year in English-language, provides scientists and engineers throughout the world for the exchange and dissemination of theoretical and practice-oriented papers dealing with advances in intelligent informatics. All the papers are refereed by two international reviewers, accepted papers will be available on line (free access), and no publication fee for authors.
Arjuna Subject : -
Articles 314 Documents
 1   2   3   4   5 
Towards host-to-host meeting scheduling negotiation Rani Megasari; Kuspriyanto Kuspriyanto; Emir Mauludi Husni; Dwi Hendratmo Widyantoro
International Journal of Advances in Intelligent Informatics Vol 1, No 1 (2015): March 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i1.6

Abstract

This paper presents a different scheme of meeting scheduling negotiation among a large number of personnel in a heterogeneous community. This scheme, named Host-to-Host Negotiation, attempts to produce a stable schedule under uncertain personnel preferences. By collecting information from hosts’ inter organizational meeting, this study intends to guarantee personnel availability. As a consequence, personnel’s and meeting’s profile in this scheme are stored in a centralized manner. This study considers personnel preferences by adapting the Clarke Tax Mechanism, which is categorized as a non manipulated mechanism design. Finally, this paper introduces negotiation strategies based on the conflict handling mode. A host-to-host scheme can give notification if any conflict exist and lead to negotiation process with acceptable disclosed information. Nevertheless, a complete negotiation process will be more elaborated in the future works.
Simulation of queue with cyclic service in signalized intersection system Muhammad Dermawan Mulyodiputro; Subanar Subanar
International Journal of Advances in Intelligent Informatics Vol 1, No 1 (2015): March 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i1.15

Abstract

The simulation was implemented by modeling the queue with cyclic service in the signalized intersection system. The service policies used in this study were exhaustive and gated, the model was the M/M/1 queue, the arrival rate used was Poisson distribution and the services rate used was Exponential distribution. In the gated service policy, the server served only vehicles that came before the green signal appears at an intersection. Considered that there were 2 types of exhaustive policy in the signalized intersection system, namely normal exhaustive (vehicles only served during the green signal was still active), and exhaustive (there was the green signal duration addition at the intersection, when the green signal duration at an intersection finished). The results of this queueing simulation program were to obtain characteristics and performance of the system, i.e. average number of vehicles and waiting time of vehicles in the intersection and in the system, as well as system utilities. Then from these values, it would be known which of the cyclic service policies (normal exhaustive, exhaustive and gated) was the most suitable when applied to a signalized intersection system
An evolutionary approach for solving the job shop scheduling problem in a service industry Milad Yousefi; Moslem Yousefi; Danial Hooshyar; Jefferson Ataide de Souza Oliveira
International Journal of Advances in Intelligent Informatics Vol 1, No 1 (2015): March 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i1.5

Abstract

In this paper, an evolutionary-based approach based on the discrete particle swarm optimization (DPSO) algorithm is developed for finding the optimum schedule of a registration problem in a university. Minimizing the makespan, which is the total length of the schedule, in a real-world case study is considered as the target function. Since the selected case study has the characteristics of job shop scheduling problem (JSSP), it is categorized as a NP-hard problem which makes it difficult to be solved by conventional mathematical approaches in relatively short computation time.
Feasibility study for banking loan using association rule mining classifier Agus Sasmito Aribowo; Nur Heri Cahyana
International Journal of Advances in Intelligent Informatics Vol 1, No 1 (2015): March 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i1.8

Abstract

The problem of bad loans in the koperasi can be reduced if the koperasi can detect whether member can complete the mortgage debt or decline. The method used for identify characteristic patterns of prospective lenders in this study, called Association Rule Mining Classifier. Pattern of credit member will be converted into knowledge and used to classify other creditors. Classification process would separate creditors into two groups: good credit and bad credit groups. Research using prototyping for implementing the design into an application using programming language and development tool. The process of association rule mining using Weighted Itemset Tidset (WIT)–tree methods. The results shown that the method can predict the prospective customer credit. Training data set using 120 customers who already know their credit history. Data test used 61 customers who apply for credit. The results concluded that 42 customers will be paying off their loans and 19 clients are decline
Wavelet based approach for facial expression recognition Zaenal Abidin; Alamsyah Alamsyah
International Journal of Advances in Intelligent Informatics Vol 1, No 1 (2015): March 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i1.7

Abstract

Facial expression recognition is one of the most active fields of research. Many facial expression recognition methods have been developed and implemented. Neural networks (NNs) have capability to undertake such pattern recognition tasks. The key factor of the use of NN is based on its characteristics. It is capable in conducting learning and generalizing, non-linear mapping, and parallel computation. Backpropagation neural networks (BPNNs) are the approach methods that mostly used. In this study, BPNNs were used as classifier to categorize facial expression images into seven-class of expressions which are anger, disgust, fear, happiness, sadness, neutral and surprise. For the purpose of feature extraction tasks, three discrete wavelet transforms were used to decompose images, namely Haar wavelet, Daubechies (4) wavelet and Coiflet (1) wavelet. To analyze the proposed method, a facial expression recognition system was built. The proposed method was tested on static images from JAFFE database.
Comparing of ARIMA and RBFNN for short-term forecasting Haviluddin Haviluddin; Ahmad Jawahir
International Journal of Advances in Intelligent Informatics Vol 1, No 1 (2015): March 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i1.10

Abstract

Based on a combination of an autoregressive integrated moving average (ARIMA) and a radial basis function neural network (RBFNN), a time-series forecasting model is proposed. The proposed model has examined using simulated time series data of tourist arrival to Indonesia recently published by BPS Indonesia. The results demonstrate that the proposed RBFNN is more competent in modelling and forecasting time series than an ARIMA model which is indicated by mean square error (MSE) values. Based on the results obtained, RBFNN model is recommended as an alternative to existing method because it has a simple structure and can produce reasonable forecasts.
A survey on computer vision technology in Camera Based ETA devices Amir Ramezani Dooraki
International Journal of Advances in Intelligent Informatics Vol 1, No 3 (2015): November 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i3.40

Abstract

Electronic Travel Aid systems are expected to make impaired persons able to perform their everyday tasks such as finding an object and avoiding obstacles easier. Among ETA devices, Camera Based ETA devices are the new one and with a high potential for helping Visually Impaired Persons. With recent advances in computer science and specially computer vision, Camera Based ETA devices used several computer vision algorithms and techniques such as object recognition and stereo vision in order to help VIP to perform tasks such as reading banknotes, recognizing people and avoiding obstacles. This paper analyses and appraises a number of literatures in this area with focus on stereo vision technique. Finally, after discussing about the methods and techniques used in different literatures, it is concluded that the stereo vision is the best technique for helping VIP in their everyday navigation.
Adding synonyms to concepts in ontology to solve the problem of semantic heterogeneity Herlina Jayadianti; Lukito Edi Nugroho; Paulus Insap Santosa; Wahyu Widayat
International Journal of Advances in Intelligent Informatics Vol 1, No 2 (2015): July 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i2.19

Abstract

Nowadays many department (community) are thinking how to get more knowledges and metadata by linking more systems from other community. There are great challenges to make all systems organizing knowledge and sharing metadata – to make it easy searched, indexed and used in different context. In this paper we will focus on metadata in specific domain - ‘Poverty’2. Regardless of the various definitions of poverty, in this paper we will focus on managing metadata in “Poverty” with many different terms therein. Ontology Mapping is the process of relating similar concepts or relations from different sources through some equivalence relation. Mapping allows finding correspondences between the concepts of two ontologies. If two concepts correspond, then they mean the same thing or closely related things. Currently, the mapping process is regarded as a promise to solve the problem between ontologies since it attempts to find correspondences between semantically related entities that belong to different ontologies. It takes as input two ontologies, each consisting of a set of components (classes, instances, properties, rules and axioms). Based on the presented reasons, we believe that ontologies with common terms and common concepts are very important in a metadata sharing process.
Progressive Particle Swarm Optimization Algorithm for Solving Reactive Power Problem Kanagasabai Lenin; Bhumanapally Ravindhranath Reddy; Munagala Surya Kalavathi
International Journal of Advances in Intelligent Informatics Vol 1, No 3 (2015): November 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i3.42

Abstract

In this paper a Progressive particle swarm optimization algorithm (PPS) is used to solve optimal reactive power problem. A Particle Swarm Optimization algorithm maintains a swarm of particles, where each particle has position vector and velocity vector which represents the potential solutions of the particles. These vectors are modernized from the information of global best (Gbest) and personal best (Pbest) of the swarm. All particles move in the search space to obtain optimal solution. In this paper a new concept is introduced of calculating the velocity of the particles with the help of Euclidian Distance conception. This new-fangled perception helps in finding whether the particle is closer to Pbest or Gbest and updates the velocity equation consequently. By this we plan to perk up the performance in terms of the optimal solution within a rational number of generations. The projected PPS has been tested on standard IEEE 30 bus test system and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss with control variables are within the limits.
An audio encryption using transposition method Ahmad Jawahir; Haviluddin Haviluddin
International Journal of Advances in Intelligent Informatics Vol 1, No 2 (2015): July 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v1i2.24

Abstract

Encryption is a technique to secure sounds data from attackers. In this study, transposition technique that corresponds to a WAV file extension is used. The performance of the transposition technique is measured using the mean square error (MSE). In the test, the value of MSE of the original and encrypted audio files were compared; the original and decrypted audio files used the correct password is ‘SEMBILAN’ and the incorrect password is ‘DELAPAN’. The experimental results showed that the original and encrypted audio files, and the original and decrypted audio files used the correct password that has a value of MSE = 0, and with the incorrect one with a value of MSE 0.00000428 or ≠ 0. In other words, the transposition technique is able to ensure the security of audio data files.

Page 1 of 32 | Total Record : 314

 1   2   3   4   5 

Filter by Year

2015 2025


Reset
Filter By Issues
All Issue Vol 11, No 4 (2025): November 2025 Vol 11, No 3 (2025): August 2025 Vol 11, No 2 (2025): May 2025 Vol 11, No 1 (2025): February 2025 Vol 10, No 3 (2024): August 2024 Vol 10, No 2 (2024): May 2024 Vol 10, No 1 (2024): February 2024 Vol 9, No 3 (2023): November 2023 Vol 9, No 2 (2023): July 2023 Vol 9, No 1 (2023): March 2023 Vol 8, No 3 (2022): November 2022 Vol 8, No 2 (2022): July 2022 Vol 8, No 1 (2022): March 2022 Vol 7, No 3 (2021): November 2021 (Issue in Progress) Vol 7, No 3 (2021): November 2021 Vol 7, No 2 (2021): July 2021 Vol 7, No 2 (2021): July 2021 (Issue in Progess) Vol 7, No 1 (2021): March 2021 Vol 6, No 3 (2020): November 2020 Vol 6, No 2 (2020): July 2020 Vol 6, No 1 (2020): March 2020 Vol 5, No 3 (2019): November 2019 Vol 5, No 2 (2019): July 2019 Vol 5, No 1 (2019): March 2019 Vol 4, No 3 (2018): November 2018 Vol 4, No 2 (2018): July 2018 Vol 4, No 1 (2018): March 2018 Vol 3, No 3 (2017): November 2017 Vol 3, No 2 (2017): July 2017 Vol 3, No 1 (2017): March 2017 Vol 2, No 3 (2016): November 2016 Vol 2, No 2 (2016): July 2016 Vol 2, No 1 (2016): March 2016 Vol 1, No 3 (2015): November 2015 Vol 1, No 2 (2015): July 2015 Vol 1, No 1 (2015): March 2015 More Issue