cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Siti Nurmaini
Contact Email
comengappjournal@unsri.ac.id
Phone
+6285268048092
Journal Mail Official
comengappjournal@unsri.ac.id
Editorial Address
Jurusan Sistem Komputer, Fakultas Ilmu Komputer, Universtas Sriwijaya, KampusUnsri Bukit Besar, Palembang
Location
Kab. ogan ilir,
Sumatera selatan
INDONESIA
ComEngApp : Computer Engineering and Applications Journal
Published by Universitas Sriwijaya
ISSN : 22524274     EISSN : 22525459     DOI : 10.18495
Core Subject : Science, Engineering,
Computer Science & IT Engineering
ComEngApp-Journal (Collaboration between University of Sriwijaya, Kirklareli University and IAES) is an international forum for scientists and engineers involved in all aspects of computer engineering and technology to publish high quality and refereed papers. This Journal is an open access journal that provides online publication (three times a year) of articles in all areas of the subject in computer engineering and application. ComEngApp-Journal wishes to provide good chances for academic and industry professionals to discuss recent progress in various areas of computer science and computer engineering.
Arjuna Subject : Teknik (semua kategori) - Teknik (Lain-Lain)
Articles 5 Documents
 1 
Search results for , issue "Vol 5 No 3 (2016)" : 5 Documents clear
Boosting diagnosis accuracy of Alzheimer's disease using statistical and kernel-based feature selection techniques M. A Balafar; Rouya Norzadeh
Computer Engineering and Applications Journal Vol 5 No 3 (2016)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (410.612 KB) | DOI: 10.18495/comengapp.v5i3.173

Abstract

Alzheimer's disease (AD) is the most common type of dementia in the elderly. Approximately, 26 million people worldwide are affected by AD. Among the various diagnostic methods for Alzheimer's disease, MRI brain imaging can display sharp changes in brain tissues. It can be used as a method for early diagnosis of Alzheimer's disease. Considering the high volume of features related to brain tissue thickness, requires the using feature reduction methods. For this purpose, statistical tests pair sample test and Independent sample test was used. After careful selection of key features, for reducing the number of features, SAS which is a kernel-based feature selection algorithm is used in linear and nonlinear mode. At the end, neural network classification, decision trees, nearest neighbor and Naïve Bayes algorithms are used for modeling. Results show that the classification accuracy of obtained feature subsets have better results compare to the original data set.
Dual Band Fractal Antenna Design for Wireless Application O.S. Zakariyya; Bashir Olaniyi Sadiq; A.A Olaniyan; A.F. Salami
Computer Engineering and Applications Journal Vol 5 No 3 (2016)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (134.354 KB) | DOI: 10.18495/comengapp.v5i3.175

Abstract

The objective of this paper was to design and analyze a dual wide band compact antenna for wireless application. Microstrip patch antenna limitation was overcome by using fractal geometry. The proposed antenna was designed with a radius of 15mm on a FR4 lossy substrate with relative permittivity of 4.4 and loss factor of 0.025. Measurement result showed that the antenna has a dual band of operation with bandwidth for return loss below -10dB of 1.84GHz (2.2GHz-4.07GHz) and 2GHz (6GHz-8GHz) which can be applied to wireless local area network (WLAN) and Ultra wide band applications.
Exploration based Genetic Algorithm for Job Scheduling on Grid Computing Hanaa Abdelrahman; Mohammed Bakri Bashir; Adil Yousif
Computer Engineering and Applications Journal Vol 5 No 3 (2016)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (643.7 KB) | DOI: 10.18495/comengapp.v5i3.181

Abstract

Grid computing presents a new trend to distribute and Internet computing to coordinate large scale heterogeneous resources providing sharing and problem solving in dynamic, multi- institutional virtual organizations. Scheduling is one of the most important problems in computational grid to increase the performance. Genetic Algorithm is adaptive method that can be used to solve optimization problems, based on the genetic process of biological organisms. The objective of this research is to develop a job scheduling algorithm using genetic algorithm with high exploration processes. To evaluate the proposed scheduling algorithm this study conducted a simulation using GridSim Simulator and a number of different workload. The research found that genetic algorithm get best results when increasing the mutation and these result directly proportional with the increase in the number of job. The paper concluded that, the mutation and exploration process has a good effect on the final execution time when we have large number of jobs. However, in small number of job mutation has no effects.
Object Reconstruction from 2D Drawing sketch to 3D Object Rossi Passarella; Osvari Arsalan
Computer Engineering and Applications Journal Vol 5 No 3 (2016)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (547.997 KB) | DOI: 10.18495/comengapp.v5i3.183

Abstract

Design engineer in the early phase of building up another product is  typically using a freehand sketching to communicate or illustrate the idea in the form of orthographic projection. This orthographic projection is based on viewpoint. A translation from 2D drawing  view point to 3D models is needed to help engineer to imagine the product preview in 3D. This procedure includes a tedious, so that automation is needed. The way to deal with this reproduction issue begin straightforwardly from 2D freehand portraying, by using the camera, the 2D drawing is captured and then transferred to a Personal Computer. Inside the computer, the image is processed with  filtering to find the view point zones. The view point zone than separate to 3 zones, each zone consists of the pixel coordinate. This coordinates are used to generated and processing of 3D voxel Image according to the form of geometries. A case study is presented in order to emphasize and discuss the proposed method
Multicast Energy Aware Routing in Wireless Networks Ahmad Karimi
Computer Engineering and Applications Journal Vol 5 No 3 (2016)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (929.288 KB) | DOI: 10.18495/comengapp.v5i3.184

Abstract

Multicasting is a service for disseminating data to a group of hostsand it is of paramount importance in applications with a close collabo-ration of network hosts. Due to limited energy available in the wirelessdevices, energy management is one of the most important problems inwireless networks. Energy aware routing strategies help us to mini-mize the energy costs for communication as much as possible and toincrease the network lifetime. In this paper, we address the problemof energy efficient routing to increase the lifetime of the network. Wepresent three new strategies for online multicast energy aware routingin wireless networks to increase the network lifetime.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2016 2016


Reset
Filter By Issues
All Issue Vol. 14 No. 2 (2025) Vol 14 No 1 (2025) Vol. 14 No. 1 (2025) Vol 13 No 03 (2024) Vol. 13 No. 3 (2024) Vol. 13 No. 2 (2024) Vol 13 No 2 (2024) Vol 13 No 1 (2024) Vol. 13 No. 1 (2024) Vol 12 No 3 (2023) Vol. 12 No. 3 (2023) Vol. 12 No. 2 (2023) Vol 12 No 2 (2023) Vol. 12 No. 1 (2023) Vol 12 No 1 (2023) Vol 11 No 3 (2022) Vol. 11 No. 3 (2022) Vol. 11 No. 2 (2022) Vol 11 No 2 (2022) Vol 11 No 1 (2022) Vol. 11 No. 1 (2022) Vol 10 No 3 (2021) Vol 10 No 2 (2021) Vol 10 No 1 (2021) Vol 9 No 3 (2020) Vol 9 No 2 (2020) Vol 9 No 1 (2020) Vol 8 No 3 (2019) Vol 8 No 2 (2019) Vol 8 No 1 (2019) Vol 7 No 3 (2018) Vol 7 No 2 (2018) Vol 7 No 1 (2018) Vol 6 No 3 (2017) Vol 6 No 2 (2017) Vol. 6 No. 2 (2017) Vol. 6 No. 1 (2017) Vol 6 No 1 (2017) Vol. 5 No. 3 (2016) Vol 5 No 3 (2016) Vol 5 No 2 (2016) Vol 5 No 1 (2016) Vol 4 No 3 (2015) Vol 4 No 2 (2015) Vol 4 No 1 (2015) Vol 3 No 3 (2014) Vol 3 No 2 (2014) Vol 3 No 1 (2014) Vol 2 No 3 (2013) Vol. 2 No. 3 (2013) Vol. 2 No. 2 (2013) Vol 2 No 2 (2013) Vol. 2 No. 1 (2013) Vol 2 No 1 (2013) Vol 1 No 2 (2012) Vol. 1 No. 2 (2012) Vol 1 No 1 (2012) More Issue