cover
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
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.
Articles 6 Documents
Search results for , issue "Vol 4 No 1 (2015)" : 6 Documents clear
An imperialist competitive algorithm for the winner determination problem in combinatorial auction Reza Mostafavi; Seyed Naser Razavi; Mohammad Ali Balafar
Computer Engineering and Applications Journal Vol 4 No 1 (2015)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (168.423 KB) | DOI: 10.18495/comengapp.v4i1.107

Abstract

Winner Determination problem (WDP) in combinatorial auction is an NP-complete problem. The NP-complete problems are often solved by using heuristic methods and approximation algorithms. This paper presents an imperialist competitive algorithm (ICA) for solving winner determination problem. Combinatorial auction (CA) is an auction that auctioneer considers many goods for sale and the bidder bids on the bundle of items. In this type of auction, the goal is finding winning bids that maximize the auctioneer’s income under the constraint that each item can be allocated to at most one bidder. To demonstrate, the postulated algorithm is applied over various benchmark problems. The ICA offers competitive results and finds good-quality solution in compare to genetic algorithm (GA), Memetic algorithm (MA), Nash equilibrium search approach (NESA) and Tabu search.
Learning from Imbalanced Multi-label Data Sets by Using Ensemble Strategies Mohammad Masoud Javidi; Fatemeh Shamsezat
Computer Engineering and Applications Journal Vol 4 No 1 (2015)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (698.335 KB) | DOI: 10.18495/comengapp.v4i1.109

Abstract

Multi-label classification is an extension of conventional classification in which a single instance can be associated with multiple labels. Problems of this type are ubiquitous in everyday life. Such as, a movie can be categorized as action, crime, and thriller. Most algorithms on multi-label classification learning are designed for balanced data and don’t work well on imbalanced data. On the other hand, in real applications, most datasets are imbalanced. Therefore, we focused to improve multi-label classification performance on imbalanced datasets. In this paper, a state-of-the-art multi-label classification algorithm, which called IBLR_ML, is employed. This algorithm is produced from combination of k-nearest neighbor and logistic regression algorithms. Logistic regression part of this algorithm is combined with two ensemble learning algorithms, Bagging and Boosting. My approach is called IB-ELR. In this paper, for the first time, the ensemble bagging method whit stable learning as the base learner and imbalanced data sets as the training data is examined. Finally, to evaluate the proposed methods; they are implemented in JAVA language. Experimental results show the effectiveness of proposed methods. Keywords: Multi-label classification, Imbalanced data set, Ensemble learning, Stable algorithm, Logistic regression, Bagging, Boosting
Game Theory Approaches in Taxonomy of Intrusion Detection for MANETs Mohammad Masoud Javidi; Laya Aliahmadipour
Computer Engineering and Applications Journal Vol 4 No 1 (2015)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (466.062 KB) | DOI: 10.18495/comengapp.v4i1.111

Abstract

MANETs are self configuring networks that are formed by a set of wireless mobile nodes and have no fixed network infrastructure nor administrative support. Since transmission range of wireless network interfaces is limited, forwarding hosts may be needed. Each node in a wireless ad hoc network functions is as both a host and a router. Due to their communication type and resources constraint, MANETs are vulnerable to diverse types of attacks and intrusions so, security is a critical issue. Network security is usually provided in the three phases: intrusion prevention, intrusion detection and intrusion tolerance phase. However, the network security problem is far from completely solved. Researchers have been exploring the applicability of game theory approaches to address the network security issues. This paper reviews some existing game theory solutions which are designed to enhance network security in the intrusion detection phase. Keywords: Mobile Ad hoc Network (MANET), Intrusion detection system (IDS), Cluster head, host based, Game theory.
Dynamic Location Modelling in 3D Beamforming for 5G Mobile Communications Sasi A; Santhiya P
Computer Engineering and Applications Journal Vol 4 No 1 (2015)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (234.2 KB) | DOI: 10.18495/comengapp.v4i1.116

Abstract

Mobile communication system is designed to provide reliable communication with more number of services and with low cost among multiple users. Due to limited frequency spectrum and resources, mobile communication requires more development in case of both establishing communication and maintenance in service quality. To fulfill these requirements, 5G mobile communication is being developed to provide high quality reliable communication and quality of service, by using beamforming model. As the trend of next generation mobile communication, 3D directional transmission is considered to give enhanced coverage model and reusability of frequency. Phase arrayed antenna is used in this beamforming model to give orthogonal communication among users. In this paper, a new modeling of beamforming is applied to give a new dimension by considering altitude with potential field strategy. Here phase arrayed antenna is replaced by 3-D smart antenna to improve the performance of 5G mobile communications. Performance evaluation outcomes 3D beamforming leads 2D beamforming in terms of communication delay, and uplink downlink throughput.
Green Cloud and reduction of energy consumption Kamyab Khajehei
Computer Engineering and Applications Journal Vol 4 No 1 (2015)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (497.596 KB) | DOI: 10.18495/comengapp.v4i1.119

Abstract

By using global application environments, cloud computing based data centers growing every day and this exponentially grows definitely effect on our environment. Researchers that have a commitment to their environment and others which was concerned about the electricity bills came up with a solution which called “Green Cloud”. Green cloud data centers based on how consume energy are known as high efficient data centers. In green cloud we try to reduce number of active devices and consume less electricity energy. In green data centers toke an advantage of VM and ability of copying, deleting and moving VMs over the data center and reduce energy consumption. This paper focused on which parts of data centers may change and how researchers found the suitable solution for each component of data centers. Also with all these problems why still the cloud data centers are the best technology for IT businesses.
Network Selection Problems - QoE vs QoS Who is the Winner? Vasuky Mohanan Mohanan; Ismat Aldmour
Computer Engineering and Applications Journal Vol 4 No 1 (2015)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (584.31 KB) | DOI: 10.18495/comengapp.v4i1.131

Abstract

In network selection problem (NSP), there are now two schools of thought. There are those who think using QoE (Quality of Experience) is the best yardstick to measure the suitability of a Candidate Network (CN) to handover to. On the other hand, Quality of Service (QoS) is also advocated as the solution for network selection problems. In this article, a comprehensive framework that supports effective and efficient network selection is presented. The framework   attempts to provide a holistic solution to network selection problem that is achieved by combining both of the QoS and QoE measures.   Using this hybrid solution the best qualities in both methods are combined to overcome issues of the network selection problem According to ITU-R (International Telecommunications Union – Radio Standardization Sector), a 4G network is defined as having peak data rates of 100Mb/s for mobile nodes with speed up to 250 km/hr and 1Gb/s for mobile nodes moving at pedestrian speed. Based on this definition, it is safe to say that mobile nodes that can go from pedestrian speed to speed of up to 250 km/hr will be the norm in future. This indicates that the MN’s mobility will be highly dynamic. In particular, this article addresses the issue of network selection for high speed Mobile Nodes (MN) in 4G networks. The framework presented in this article also discusses how the QoS value collected from CNs can be fine-tuned to better reflect an MN’s current mobility scenario.

Page 1 of 1 | Total Record : 6