Articles

Access the latest knowledge in applied science, electrical engineering, computer science and information technology, education, and health.

Advanced Search
Filter Icon

Filters article

Years

FAQ Arrow
Single Year
Range Year
0
0

Source Title

FAQ Arrow

Authors

FAQ Arrow

31,377 Article Results

Developing Fuzzy Inference System of the Observed Albireo Star’s Trail using Surface Meteorological Parameter over ITERA Astronomical Observatory (IAO)

10.12928/telkomnika.v16i6.9106
Wahyu Sasongko; Institut Teknologi Sumatera (ITERA) Putro , Wirid; Institut Teknologi Sumatera (ITERA) Birastri , Robiatul; Institut Teknologi Sumatera (ITERA) Muztaba , Anissa Novia Indra; Institut Teknologi Sumatera (ITERA) Putri , Nindhita; Institut Teknologi Sumatera (ITERA) Pratiwi , Hakim Luthfi; Institut Teknologi Sumatera (ITERA) Malasan
This study aims to develop Fuzzy Inference System (FIS) trail of star seeing over ITERA Astronomical Observatory (IAO) using surface meteorological parameter during site selection to develop observatory. The one-day surface meteorological observation such as Pressure (P), Temperature (T), and Humidity (H) and trail of Albireo (β Cyg) star seeing value was taken from Mt. Betung, Lampung, Indonesia. The surface meteorological data are analyzed to obtain Albireo (β Cyg) star seeing value in 3 to 4 August 2017. By using statistical method obtained the seeing value in daily variation of Albireo (β Cyg) star trail with surface meteorological as a predictor parameter. The standard error of estimate (S-Value) between predictor parameter (pressure and humidity) with Albireo star seeing are reached 0.0027543 in two days variation. Based on the result, the three Membership Functions (MFs) with Gaussian function was proposed in this study to develop FIS trail of star. The result shows that the configuration analysis from input parameter FIS with 15 role bases from surface meteorological parameter has successful to targeted with Albireo (β Cyg) star trail. The 15 role bases from FIS was used to estimate seeing value from meteorological parameter in near future.
Volume: 16
Issue: 6
Page: 2980-2987
Publish at: 2018-12-01

Implementation of Integration VaaMSN and SEMAR for Wide Coverage Air Quality Monitoring

10.12928/telkomnika.v16i6.10152
Yohanes Yohanie Fridelin; Politeknik Elektronika Negeri Surabaya Panduman , Adnan Rachmat Anom; Politeknik Elektronika Negeri Surabaya Besari , Sritrusta; Politeknik Elektronika Negeri Surabaya Sukaridhoto , Rizqi Putri Nourma; Nahdlatul Ulama University of Surabaya Budiarti , Rahardhita Widyatra; Okayama University Sudibyo , Funabiki; Okayama University Nobuo
The current air quality monitoring system cannot cover a large area, not real-time and has not implemented big data analysis technology with high accuracy. The purpose of an integration Mobile Sensor Network and Internet of Things system is to build air quality monitoring system that able to monitor in wide coverage. This system consists of Vehicle as a Mobile Sensors Network (VaaMSN) as edge computing and Smart Environment Monitoring and Analytic in Real-time (SEMAR) cloud computing. VaaMSN is a package of air quality sensor, GPS, 4G WiFi modem and single board computing. SEMAR cloud computing has a time-series database for real-time visualization, Big Data environment and analytics use the Support Vector Machines (SVM) and Decision Tree (DT) algorithm. The output from the system are maps, table, and graph visualization. The evaluation obtained from the experimental results shows that the accuracy of both algorithms reaches more than 90%. However, Mean Square Error (MSE) value of SVM algorithm about 0.03076293, but DT algorithm has 10x smaller MSE value than SVM algorithm.
Volume: 16
Issue: 6
Page: 2630-2642
Publish at: 2018-12-01

Determining Strategies on Playing Badminton using the Knuth-Morris-Pratt Algorithm

10.12928/telkomnika.v16i6.11554
Lala Septem; Universitas Pendidikan Indonesia Riza , Muhammad Irfan; Universitas Pendidikan Indonesia Firmansyah , Herbert; Universitas Pendidikan Indonesia Siregar , Dian; Universitas Pendidikan Indonesia Budiana , Alejandro; Tecnologico de Monterrey Rosales-Pérez
Mastery techniques in badminton game are a main ability that must be possessed by players. One part of these techniques is the strategy in proper shuttlecock placement, so that the opposing player is difficult to restore it. Therefore, this study aims to build a computational model and its implementation that are able to provide predictions/recommendations for trainers and players on determining strategies of shuttlecock’s placements and strokes. The proposed model takes into account historical game patterns that have been done by world class athletes. Then, string matching using the Knuth-Morris-Pratt algorithm and a clustering method are utilized to provide solutions to be some strategies on shooting the shuttlecock. The model is then implemented in the R programming language. Several experiments, involving 20 series of world matches collected as historical data, have been conducted to validate the system. From the results obtained, it can be concluded that the system can be used as an alternative tool for players and coaches to determine the strategy in the placement and strokes of shuttlecock on badminton game.
Volume: 16
Issue: 6
Page: 2763-2770
Publish at: 2018-12-01

Comparison of Neural Network Training Algorithms for Classification of Heart Diseases

10.11591/ijai.v7.i4.pp185-189
Hesam Karim , Sharareh R. Niakan , Reza Safdari
Heart disease is the first cause of death in different countries. Artificial neural network (ANN) technique can be used to predict or classification patients getting a heart disease. There are different training algorithms for ANN. We compared eight neural network training algorithms for classification of heart disease data from UCI repository containing 303 samples. Performance measures of each algorithm containing the speed of training, the number of epochs, accuracy, and mean square error (MSE) were obtained and analyzed. Our results showed that training time for gradient descent algorithms was longer than other training algorithms (8-10 seconds). In contrast, Quasi-Newton algorithms were faster than others (<=0 second). MSE for all algorithms was between 0.117 and 0.228. While there was a significant association between training algorithms and training time (p<0.05), the number of neurons in hidden layer had not any significant effect on the MSE and/or accuracy of the models (p>0.05). Based on our findings, for development an ANN classification model for heart diseases, it is best to use Quasi-Newton training algorithms because of the best speed and accuracy.
Volume: 7
Issue: 4
Page: 185-189
Publish at: 2018-12-01

Dwindling of Real Power Loss by Enriched Big Bang-Big Crunch Algorithm

10.11591/ijai.v7.i4.pp190-196
K. Lenin
In this paper, Enriched Big Bang-Big Crunch (EBC) algorithm is proposed to solve the reactive power problem. The problem of converging to local optimum solutions occurred for the Bang-Big Crunch (BB-BC) approach due to greedily looking around the best ever found solutions. The proposed algorithm takes advantages of typical Big Bang-Big Crunch (BB-BC) algorithm and enhances it with the proper balance between exploration and exploitation factors. Proposed EBC algorithm has been tested in standard IEEE 118 & practical 191 bus test systems and simulation results show clearly the improved performance of the proposed algorithm in reducing the real power loss.
Volume: 7
Issue: 4
Page: 190-196
Publish at: 2018-12-01

A Conceptual Model of Role Based Access Control Using Role Mining Algorithm

10.11591/ijeecs.v12.i3.pp1394-1400
Nazirah Abd Hamid , Rabiah Ahmad , Siti Rahayu Selamat
Numerous studies have shown that currently, role-based access control has becoming one of the successful access control model because of its principle that could simplifies the work of security administrators. However, to construct a concise, role-based access control system, a good role mining algorithm structure is needed therefore the objectives of this paper are firstly, to provide a general overview on phases that involved in designing and developing the algorithm and secondly, to introduce a conceptual model that constructed based on the analysis and this model represents a general process in role mining model. This model involved series of phases that begin with the input of data, pre-processing stage, candidate role generation phase, role selection and role assignment process and lastly number of roles as generated output.
Volume: 12
Issue: 3
Page: 1394-1400
Publish at: 2018-12-01

Message Oriented Middleware For Library’s Metadata Exchange

10.12928/telkomnika.v16i6.9475
Ni Wayan; Bali State Polytechnic Wisswani , I Wayan Kandi; Ngurah Rai University Wijaya
Library is one of the important tools in the development of science to store various intellectual properties. Currently most libraries are managed by standalone systems and are not equipped with data exchange facilities with other libraries for sharing information. Sharing of information between libraries can be done with integration metadata owned library. In this research, the integration architecture of metadata exchange is done with Message Oriented Middleware (MOM) technology. This MOM redeems the collection metadata that matches the standard Dublin Core format. In this research, database structure, MOM structure and set of rules to perform data sharing process. With the proposed MOM architectural design is expected to search process information between libraries will become easier and cheaper.
Volume: 16
Issue: 6
Page: 2756-2762
Publish at: 2018-12-01

Optimization a Scheduling Algorithm of CA in LTE ADV

10.12928/telkomnika.v16i6.10054
Sarmad K.; Al - Mustansiriyah University Ibrahim , Nasser N.; Al-Nahrain University Khamiss
Long-Term Advancement Progressed (LTE-ADV) is the advancement of the long-term evolution, which created via 3GPP. LTE-ADV aims to offer a transmission bandwidth of (100) MHz by using Carrier Aggregation (CA) to aggregate LTE-ADV carriers. To increase the data capacity of the system and resource allocation converts a very good tool. LTE-Advanced multiple Component Carriers (CCs) becomes a difficult optimization problem. In the paper proposes a new scheduling algorithm and compares with a different scheduling traditional algorithms that are proportional fair and round robin in the CA, in order to find the best scheduler that provides high-quality throughput and improves fairness. It i also evaluates mapping model types are Mutual Information Effective SINR Mapping (MIESM) and Exponential Effective SINR Mapping (EESM). The results show that the throughput in the proposed algorithm with MIESM outperforms from others mapping and scheduling.
Volume: 16
Issue: 6
Page: 2514-2521
Publish at: 2018-12-01

Classification of Prostate Cancer using Wavelet Neural Network

10.11591/ijeecs.v12.i3.pp968-973
Mohanad Najm Abdulwahed
Prostate cancer is the century disease that endanger the life of men. The earlier to diagnose the disease, the probability of curing this disease is higher. Therefore, new approaches of diagnosis is required to effectively detect the prostate cancer in early stage compared to the traditional methods. Therefore, WNN is a new adopted approach in prostate cancer diagnosis. Morlet function is used as an activation function of wavelet neural network (WNN) and back propagation (BP) is applied to train the Wavelet network. WNN classifies prostate cancer according to three factors: patient age, PSA level, and prostate volume. WNN performance is evaluated based on the percentage of classification and the computational complexity of several cases. The results of the simulation show that WNN has lower mean squared error (MSE) than the Neural Network (NN).
Volume: 12
Issue: 3
Page: 968-973
Publish at: 2018-12-01

An Effective and Trustable Spatial Service Recommendation Algorithm for Spatial Query Retrieval In Geo-Social Network

10.11591/ijeecs.v12.i3.pp1222-1229
K. Lakshmaiah , S. Murali Krishna , B. Eswara Reddy
The spatial information (e.g., restaurants/hotels) is related with the keyword(s) to indicate their businesses, services and features. The main issue of relevant information retrieval is to query an entity which includes a set of spatial query keywords and have the smallest amount of inter-object distance. The spatial queries with keywords have not been extensively explored. Still, the traditional method was focused on the multidimensional data. Previous works mostly targeted to predict the top-k Nearest Neighbors keyword query, where every keyword should be equivalent to the whole querying keywords. However, the mechanism does not consider the density of data entities in the spatial space. To overcome the above issues, An Effective and Trustable Spatial Service Recommendation (ETSSR) algorithm focuses on the most relevant information retrieval with the enhanced accuracy and minimal retrieval time for spatial information services. The main goal of work is to provide best spatial information retrieval with an accurateness of location prediction and minimal information retrieval time. The system minimizes the classification issue and visualization problem for spatial information in Geospatial Social network. The system improves the spatial information retrieval with an accuracy of location prediction and minimizes the information retrieval time compare than existing methods. Based on Experimental estimations, proposed ETSSR+KNN enhanced 0.48 P (Precision) and 0.49 R (Recall) and minimized 28 milliseconds query retrieval time.
Volume: 12
Issue: 3
Page: 1222-1229
Publish at: 2018-12-01

Reinforced Island Model Genetic Algorithm to Solve University Course Timetabling

10.12928/telkomnika.v16i6.9691
Alfian Akbar; Waseda University Gozali , Shigeru; Waseda University Fujimura
The University Course Timetabling Problem (UCTP) is a scheduling problem of assigning teaching event in certain time and room by considering the constraints of university stakeholders such as students, lecturers, departments, etc. This problem becomes complicated for universities which have immense number of students and lecturers. Therefore, a scalable and reliable timetabling solver is needed. However, current solvers and generic solution failed to meet several specific UCTP. Moreover, some universities implement student sectioning problem with individual student specific constraints. This research introduces the Reinforced Asynchronous Island Model Genetic Algorithm (RIMGA) to optimize the resource usage of the computer. RIMGA will configure the slave that has completed its process to helping other machines that have yet to complete theirs. This research shows that RIMGA not only improves time performance in the computational execution process, it also oers greater opportunity to escape the local optimum trap than previous model.
Volume: 16
Issue: 6
Page: 2747-2755
Publish at: 2018-12-01

Performance Evaluation of Centralized Reconfigurable Transmitting Power Scheme in Wireless Network-on-chip

10.12928/telkomnika.v16i6.9306
M. S.; Universiti Teknologi Malaysia Rusli , A. A. H.; Universiti Teknologi Malaysia Ab Rahman , U. U.; Universiti Teknologi Malaysia Sheikh , N. Shaikh; Universiti Teknologi Malaysia Husin , Michael L. P.; Universiti Teknologi Malaysia Tan , T.; Universitas Diponegoro Andromeda , M. N.; Universiti Teknologi Malaysia Marsono
Network-on-chip (NoC) is an on-chip communication network that allows parallel communication among all cores to improve inter-core performance. Wireless NoC (WiNoC) introduces long-range and high bandwidth radio frequency (RF) interconnects that can possibly reduce the multi-hop communication of the planar metal interconnects in conventional NoC platforms. In WiNoC, RF transceivers account for a significant power consumption, particularly its transmitter, out of its total communication energy. This paper evaluates the energy and latency performance of a closed loop power management mechanism which enables transmitting power reconfiguration in WiNoC based on number of erroneous received packets. The scheme achieves significant energy savings with limited performance degradation and insignificant impact on throughput.
Volume: 16
Issue: 6
Page: 2844-2854
Publish at: 2018-12-01

Performance Evaluation of Low-Cost GPS Time Server Based on NTP

10.12928/telkomnika.v16i6.10198
Heri; Maranatha Christian University Andrianto , Yohana; Maranatha Christian University Susanthi , Denny; Maranatha Christian University Suryadi
Time synchronization is required to maintain a precise clock. In this paper, a low-cost GPS NTP server has been realized using inexpensive arduino, GPS receiver, and ethernet shield. The performance of low cost GPS NTP server has been compared with the performance of commercial GPS NTP server (TM1000A). The results showed that both time server has synchronization success rate of 100% with average clock offset -8,69 ms for low cost GPS NTP server and -10,1538 ms for TM1000A.  However, TM1000A have better clock offset deviation area compared with low cost GPS NTP server. TM1000A has a smaller clock offset deviation area, which is between -8 ms to -12 ms while low cost GPS NTP server has larger clock offset deviation area, which is between -20 ms to +10 ms. With production costs of less than 29 USD, we offer cheap GPS NTP servers as an alternative GPS NTP server for time synchronization on computer networks.
Volume: 16
Issue: 6
Page: 2528-2535
Publish at: 2018-12-01

A Review on Registration of Medical Images Using Graph Theoretic Approaches

10.11591/ijeecs.v12.i3.pp974-983
Akshaya R , Hema P Menon
Image registration is very essential for image analysis especially in the medical field. The registered image helps us to find a lot of things like the presence of a tumor, aneurysm, and many more. Image registration is a process of aligning two images that were captured during different conditions that makes analyzing of images possible. There are various methods in which images can be registered. This paper mainly discusses the methods that use the graph approach to register the medical images. The main focus is on rigid and non-rigid registration techniques and gives a brief description of the methods present.
Volume: 12
Issue: 3
Page: 974-983
Publish at: 2018-12-01

A New Framework for Information System Development on Instant Messaging for Low Cost Solution

10.12928/telkomnika.v16i6.8614
I Made; Udayana University Sukarsa , I Ketut Gede Darma; Udayana University Putra , Nyoman Putra; Udayana University Sastra , Lie; Udayana University Jasa
The increasingly inexpensive Internet has spurred the growth of online information system services in various companies. Almost all services are available in forms on web or mobile applications. For small companies, this particular system is more difficult to implement as it requires a substantial cost allocated for hosting, domain and server devices. The solution is to develop a framework for building information system services through Instant Messaging (IM) such as Telegram, Line or XMPP / Jabber using the Design Science Research Methodology. This proposed framework has the ability to transform the existing information system services into chat services with RBAC role, session, validation and natural interaction using Indonesian-language conversations. The framework that consists of Initiate layers, business process and communication, memory group and OLTP DBMS will produce low-cost solution for the development of integrated information systems service.
Volume: 16
Issue: 6
Page: 2799-2808
Publish at: 2018-12-01
1 2 3
...
2091 2092
Show 1473 of 2092

Discover Our Library

Embark on a journey through our expansive collection of articles and let curiosity lead your path to innovation.

Explore Now
Library 3D Ilustration