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 215 Documents
 1   2   3   4   5 
Design Concept of Convexity Defect Method on Hand Gestures as Password Door Lock Rossi Passarella; Muhammad Fadli; Sutarno Sutarno
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1183.912 KB) | DOI: 10.18495/comengapp.v2i3.32

Abstract

In this paper we purpose a several steps to implement security for locking door by using hand gestures as password. The methods considered as preprocessing image, skin detection and Convexity Defection. The main components of the system are Camera, Personal Computer (PC), Microcontroller and Motor (Lock). Bluetooth communication are applied to communicate between PC and microcontroller to open and lock door used commands character such as “O” and “C”. The results of this system show that the hand gestures can be measured, identified and quantified consistently.
Human Perception Based Color Image Segmentation Neeta Pradeep Gargote; Savitha Devaraj; Shravani Shahapure
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1192.109 KB) | DOI: 10.18495/comengapp.v2i3.34

Abstract

Color image segmentation is probably the most important task in image analysis and understanding. A novel Human Perception Based Color Image Segmentation System is presented in this paper. This system uses a neural network architecture. The neurons here uses a multisigmoid activation function. The multisigmoid activation function is the key for segmentation. The number of steps ie. thresholds in the multisigmoid function are dependent on the number of clusters in the image. The threshold values for detecting the clusters and their labels are found automatically from the first order derivative of histograms of saturation and intensity in the HSI color space. Here the main use of neural network is to detect the number of objects automatically from an image. It labels the objects with their mean colors. The algorithm is found to be reliable and works satisfactorily on different kinds of color images.
Improvement and Comparison of Mean Shift Tracker using Convex Kernel Function and Motion Information S. B. Chaudhari; K. K. Warhade; V. M. Wadhai; N. N. Choudhari
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1185.342 KB) | DOI: 10.18495/comengapp.v2i3.35

Abstract

Any tracking algorithm must be able to detect interested moving objects in its field of view and then track it from frame to frame. The tracking algorithms based on mean shift are robust and efficient. But they have limitations like inaccuracy of target localization, object being tracked must not pass by another object with similar features i.e. occlusion and fast object motion. This paper proposes and compares an improved adaptive mean shift algorithm and adaptive mean shift using a convex kernel function through motion information. Experimental results show that both methods track the object without tracking errors. Adaptive method gives less computation cost and proper target localization and Mean shift using convex kernel function shows good results for the tracking challenges like partial occlusion and fast object motion faced by basic Mean shift algorithm.
How Networking Empirically Influences the Types of Innovation?: Pardis Technology Park as a Case Study Amir Mirzadeh Phirouzabadi; M Mahmoudian; M Asghari
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1186.454 KB) | DOI: 10.18495/comengapp.v2i3.36

Abstract

Nowadays, Innovation can be named as one of the best practices as quality, speed, dependability, flexibility and cost which it helps organization enter to new markets, increase the existing market share and provide it with a competitive edge. In addition, organizations have moved forward from “hiding idea (Closed Innovation)” to “opening them (Open Innovation)”. Therefore, concepts such as “open innovation” and “innovation network” have become important and beneficial to both academic and market society. Therefore, this study tried to empirically study the effects of networking on innovations. In this regard, in order to empirically explore how networking influences innovations, this paper used types of innovations based on OCED definition as organizational, marketing, process and product and compared their changes before and after networking of 45 companies in the network Pardis Technology Park as a case study. The results and findings showed that all of the innovation types were increased after jointing the companies to the network. In fact, we arranged these changing proportions from the most to the least change as marketing, process, organizational and product innovation respectively. Although there were some negative growth in some measures of these innovations after jointing into the network.
Balancing and Lucas-Balancing Numbers and their Application to Cryptography Sujata Swain; Chidananda Pratihary; Prasanta Kumar Ray
Computer Engineering and Applications Journal Vol 5 No 1 (2016)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (398.038 KB) | DOI: 10.18495/comengapp.v5i1.46

Abstract

It is well known that, a recursive relation for the sequence  is an equation that relates  to certain of its preceding terms . Initial conditions for the sequence  are explicitly given values for a finite number of the terms of the sequence. The recurrence relation is useful in certain counting problems like Fibonacci numbers, Lucas numbers, balancing numbers, Lucas-balancing numbers etc. In this study, we use the recurrence relations for both balancing and Lucas-balancing numbers and examine their application to cryptography.
Fuzzy Expert Ants to speed up big TSP Problems using ACS Fardin Abdali Mohammadi; Abdolhosein Fathi Abdolhosein Fathi
Computer Engineering and Applications Journal Vol 3 No 3 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (264.56 KB) | DOI: 10.18495/comengapp.v3i3.68

Abstract

Ant colony algorithms are a group of heuristic optimization algorithms that have been inspired by behavior of real ants foraging for food. In these algorithms some simple agents (i.e. ants), search the solution space for finding the suitable solution. Ant colony algorithms have many applications to computer science problems especially in optimization, such as machine drill optimization, and routing. This group of algorithms have some sensitive parameters controlling the behavior of agents, like relative pheromone importance on trail and pheromone decay coefficient. Convergence and efficiency of algorithms is highly related to these parameters. Optimal value of these parameters for a specific problem is determined through trial and error and does not obey any rule. Some approaches proposed to adapt parameter of these algorithms for better answer. The most important feature of the current adaptation algorithms are complication and time overhead. In this paper we have presented a simple and efficient approach based on fuzzy logic for optimizing ACS algorithm and by using different experiments efficiency of this proposed approach has been evaluated and we have shown that the presented concept is one of the most important reasons in success for parameter adapting algorithms.
A New Method for Intelligent Message Network Management in Ubiquitous Sensor Networks Maryam Karimi; Reza Javidan; Manijeh Keshtgari
Computer Engineering and Applications Journal Vol 3 No 3 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (703.832 KB) | DOI: 10.18495/comengapp.v3i3.69

Abstract

Ubiquitous Sensor Network (USN) computing is a useful technology forautonomic integrating in different environments which can be available anywhere.Managing USN plays an important role on the availability of nodes and paths. Inorder to manage nodes there is a cyclic route starts from manager, passing nodes,and come back to manager as feedback. In this paper, a new, self-optimizing methodpresented for finding this cyclic path by combining epsilon greedy and geneticalgorithm and then it is compared with other well-known methods in terms of cost ofthe route they find and the power consumption. The results show that the route thatis found by our new method costs at least 53% less than other methods. However insome cases, it uses 32% more energy for finding the route which can be compensatein traversing the shorter route. The overall simulation results in prototype data showthe effectiveness of the proposed method.
A New HadoopBased Network Management System withPolicy Approach Sahar Namvarasl; Vajihe Abdi; Reza Javidan
Computer Engineering and Applications Journal Vol 3 No 3 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (110.273 KB) | DOI: 10.18495/comengapp.v3i3.70

Abstract

In recent years with the improvement in the field of network technology and decreasing of technology cost, lots of data are produced. This massive amount of data needs mechanism for processing and mining information rapidly. In this paper a new Hadoop based network management system with policy approach which is considered hierarchical manager is presented. Storing and processing massive data efficiently are two capability of Hadoop technology by using HDFS and MapReduce. In this paper, processing time is considered as a main factor. As a result it is proved that this management system using policy approach increases the performance of entire system without putting on extra cost for implementation. This system in contrast with pure Hadoop and centralized system is several times more rapid.
An Improved Multi-Cycle Deadlock Detection and Resolution Algorithm for Distributed Systems Mohsen Askari; Rozita Jamili Oskouei
Computer Engineering and Applications Journal Vol 3 No 3 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (974.61 KB) | DOI: 10.18495/comengapp.v3i3.89

Abstract

Distributed systems exhibit a high degree of resource and data sharing creating a state in which deadlocks might make their appearance. Since deadlock detection and resolution  is one of the important concerns in distributed systems which lead to minimizing available resources, therefore instigating   the  system  throughput decrease.  Our  proposed algorithm detects and resolves  the  multi-cycle  deadlocks, whether the initiator is involved in the deadlock cycle directly or indirectly. Also the chance  of  phantom  deadlock  detection is minimized. This  algorithm  not  only  can manage the simultaneous execution of it but also detects the multi-cycle deadlocks in  the  distributed  systems. Our  algorithm introduces a modified probe and victim message  structure. Moreover,  no  extra  storage  required  to  store  prob message  in each node which is known as memory overhead in the distributed systems.
Survey on Multi Agent Energy Efficient Clustering Algorithms in Wireless Sensor Networks Nazli Bagherzadeh Karimi; Seyed Naser Razavi
Computer Engineering and Applications Journal Vol 3 No 3 (2014)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (569.621 KB) | DOI: 10.18495/comengapp.v3i3.92

Abstract

In the last few years, there are many applications for Wireless Sensor Networks (WSNs). One of the main drawbacks of these networks is the limited battery power of sensor nodes. There are many cases to reduce energy consumption in WSNs. One of them is clustering. Sensor nodes partitioned into the clusters so that one is chosen as Cluster Head (CH). Clustering and selection of the proper node as CH is very significant in reducing energy consumption and increasing network lifetime. In this paper, we have surveyed a multi agent clustering algorithms and compared on various parameters like cluster size, cluster count, clusters equality, parameters used in CHs selection, algorithm complexity, types of algorithm used in clustering, nodes location awareness, inter-cluster and intra-cluster topologies, nodes homogeneity and MAC layer communications.

Page 3 of 22 | Total Record : 215

 1   2   3   4   5 

Filter by Year

2012 2024


Reset
Filter By Issues
All Issue Vol 13 No 1 (2024) Vol 12 No 3 (2023) Vol 12 No 2 (2023) Vol 12 No 1 (2023) Vol 11 No 3 (2022) Vol 11 No 2 (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 1 (2017) 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 2 (2013) Vol 2 No 1 (2013) Vol 1 No 2 (2012) Vol 1 No 1 (2012) More Issue