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 6 Documents
 1 
Search results for , issue "Vol 3 No 2 (2014)" : 6 Documents clear
Improve the Performance of Data Grids by Cost-Based Job Scheduling Strategy Najme Mansouri
Computer Engineering and Applications Journal Vol 3 No 2 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (929.5 KB) | DOI: 10.18495/comengapp.v3i2.52

Abstract

Grid environments have gain tremendous importance in recent years since application requirements increased drastically. The heterogeneity and geographic dispersion of grid resources and applications places some complex problems such as job scheduling. Most existing scheduling strategies in Grids only focus on one kind of Grid jobs which can be data-intensive or computation-intensive. However, only considering one kind of jobs in scheduling does not result in suitable scheduling in the viewpoint of all system, and sometimes causes wasting of resources on the other side. To address the challenge of simultaneously considering both kinds of jobs, a new Cost-Based Job Scheduling (CJS) strategy is proposed in this paper. At one hand, CJS algorithm considers both data and computational resource availability of the network, and on the other hand, considering the corresponding requirements of each job, it determines a value called W to the job. Using the W value, the importance of two aspects (being data or computation intensive) for each job is determined, and then the job is assigned to the available resources. The simulation results with OptorSim show that CJS outperforms comparing to the existing algorithms mentioned in literature as number of jobs increases.
Words Stemming Based on Structural and Semantic Similarity Mohammad Hassan Dianati; Mohammad Hadi Sadreddini; Amir Hossein Rasekh; Seyed Mostafa Fakhrahmad; Hossein Taghi-Zadeh
Computer Engineering and Applications Journal Vol 3 No 2 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (564.125 KB) | DOI: 10.18495/comengapp.v3i2.57

Abstract

Words  stemming  is  one  of  the  important  issues  in  the field  of  natural  language processing  and  information retrieval.  There  are  different  methods  for stemming which are mostly language-dependent. Therefore, these  stemmers are only applicable  to  particular  languages.  Because  of the importance  of  this issue,  in  this paper, the proposed method for stemming is aimed to be language-independent. In the  proposed  stemmer,  a  bilingual  dictionary  is  used and  all  of  the  words  in  the dictionary are firstly clustered. The words’ clustering is based on their structural and semantic similarity. Finally, finding the stem of new coming words is performed by making use of the previously formatted clusters. To evaluate the proposed scheme, words  stemming is  done on both  Persian  and  English  languages.  The encouraging results  indicate  the  good  performance  of  the proposed  method  compared  with  its counterparts.
Cost Modeling and Risk and Benefit Modeling Approach as a Tools For Decision Making in Adoption Cloud Computing as IT Strategic Business Rian Rahmanda Putra; Wanda Kinasih; Dana Indra Sensuse
Computer Engineering and Applications Journal Vol 3 No 2 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (196.692 KB) | DOI: 10.18495/comengapp.v3i2.62

Abstract

Cloud computing is an innovation that allows the use of IT as a utility based on-demand. Since cloud computing is a new technology, its led to a variety of risks that required an assessment model to assess the organization's readiness to adopt cloud computing. Moreover, by using cloud computing services means organizations or outsourcing involves a third party. Before adopting cloud computing technology, organizations need to consider some of the effects that arise as a result of cloud computing, namely in terms of costs, risks and benefits. To assist organizations to consider the migration of existing IT systems to the cloud, it can be used the cost approach valuation models and risk and benefit. This paper discusses two models of cost-based assessment of risk and benefit modeling and modeling that can be used as a tool to assist organizations in making decisions related to the migration of existing IT systems to the cloud. Â
A new DWT-SVD based robust watermarking scheme for real property rights Sedigeh Razavi Babakalak; Mohammad Ali Balafar; Ali Farzan
Computer Engineering and Applications Journal Vol 3 No 2 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (855.789 KB) | DOI: 10.18495/comengapp.v3i2.73

Abstract

In this paper, a new robust digital image watermarking algorithm which was based on singular value decomposition (SVD) and discrete wavelet transform (DWT) was proposed and simulated for protecting real property rights. A gray scale logo image, rather than a randomly generated Gaussian noise type watermark, was used as a watermark. Its embedding algorithm hid a watermark LL sub-band blocks in the low–low (LL) and high-high (HH) sub-bands of a target non-overlapping block of the host image by modifying singular values on SVD version of these blocks. A semi-blind watermark extraction was designed to estimate the original coefficients. Experimental results showed that the proposed scheme made significant improvements in terms of both transparency and robustness and was superior to the existing methods which were considered in this paper.
W_SR: A QoS Based Ranking Approach for Cloud Computing Service Arezoo Jahani; Leyli Mohammad Khanli; Seyed Naser Razavi
Computer Engineering and Applications Journal Vol 3 No 2 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (573.528 KB) | DOI: 10.18495/comengapp.v3i2.76

Abstract

Cloud computing is a kind of computing model that promise accessing to information resources in request time and subscription basis. In this environment, there are different type of user’s application with different requirements. In addition, there are different cloud Service providers which present spate services with various qualitative traits. Therefore determining the best cloud computing service for users with specific applications is a serious problem. Service ranking system compares the different services based on quality of services (QoS), in order to select the most appropriate service. In this paper, we propose a W_SR (Weight Service Rank) approach for cloud service ranking that uses from QoS features. Comprehensive experiments are conducted employing real-world QoS dataset, including more than 2500 web services over the world. The experimental results show that execution time of our approach is less than other approaches and it is more flexible and scalable than the others with increase in services or users.
Predicting Academic Performance with Applying Data Mining Techniques (Generalizing the results of two Different Case Studies) Rozita Jamili Oskouei; Mohsen Askari
Computer Engineering and Applications Journal Vol 3 No 2 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (417.127 KB) | DOI: 10.18495/comengapp.v3i2.81

Abstract

Several research works are attempted to predict students academic performance and assess  the  evaluating students knowledge  or  detecting  students’  weakness and probability of failure in final semester examinations. However, several factors affect the performance of students in different countries or even in different states of one country. Therefore, understanding these factors and analyzing the effects of each one of those factors in each country, is necessary for improving instructors’ decisions in selecting   the best teaching method for helping weak students or   increasing performance  of  other  students. This study is motivated  to  study  the  students’ academic performance in high  school  and  bachelor  degree  studies  in  Iran and comparing these analysis results with the similar study’s results in India.

Page 1 of 1 | Total Record : 6

 1 

Filter by Year

2014 2014


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