cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota surabaya,
Jawa timur
INDONESIA
Jurnal Informatika
Published by Universitas Kristen Petra Surabaya
ISSN : -     EISSN : -     DOI : -
Core Subject : Science,
Computer Science & IT
Arjuna Subject : -
Articles 187 Documents
 15   16   17   18   19 
BOUNDARY DETECTION ALGORITHMS IN WIRELESS SENSOR NETWORKS: A SURVEY Sitanayah, Lanny
Jurnal Informatika Vol 10, No 2 (2009): NOVEMBER 2009
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.10.2.94-100

Abstract

Wireless sensor networks (WSNs) comprise a large number of sensor nodes, which are spread out within a region and communicate using wireless links. In some WSN applications, recognizing boundary nodes is important for topology discovery, geographic routing and tracking. In this paper, we study the problem of recognizing the boundary nodes of a WSN. We firstly identify the factors that influence the design of algorithms for boundary detection. Then, we classify the existing work in boundary detection, which is vital for target tracking to detect when the targets enter or leave the sensor field.
PENENTUAN RUTE ANTAR KOTA YANG EFISIEN DENGAN MENGGUNAKAN ANALISA DATA GEOGRAFIK Rostianingsih, Silvia
Jurnal Informatika Vol 2, No 2 (2001): NOVEMBER 2001
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.2.2.pp. 79-82

Abstract

Finding a path between cities is look like a simple thing but its also seems complicated because there are many costs which is influence the path finding. In Geographic Information System, an object from a map have information which is use to analysis many things. One of them is spatial data analysis, which is a modelling proses, manipulating and interpretation information about a feature geographic. This spatial data analysis is using grid, which is data model raster with two dimension which is group of pixels, where each cell containing a value, called weighted cell. Using euclidean algorithm which include weight of grid, without notice the direction of the path, can make the best effisien path with leact cost path analysis. Abstract in Bahasa Indonesia : Menentukan rute dari suatu kota ke kota lain, merupakan hal yang terlihat sederhana namun sering terasa rumit karena banyak faktor yang perlu diperhatikan dalam pemilihan rute. Dalam Sistem Informasi Geografik, suatu obyek pada peta mempunyai informasi yang dapat digunakan untuk melakukan banyak analisa. Salah satunya adalah analisa data spatial, yaitu proses pemodelan, pengolahan dan interpretasi informasi tentang suatu fitur geografik. Analisa data spatial tersebut dilakukan dengan menggunakan grid, yaitu model data raster dengan dua dimensi ruang yang terdiri dari kumpulan piksel, dimana tiap sel menyimpan sebuah nilai. Pemberian nilai tiap piksel untuk analisa disebut bobot untuk tiap sel. Dengan menggunakan algoritma euclidean yang memperhatikan bobot tiap grid, tanpa memperhatikan arah rute, dapat dihasilkan satu rute efisien yang terbaik dengan mencari rute yang mempunyai bobot akumulatif terkecil. Kata kunci: rute, sistem informasi geografik, analisa data spatial, algoritma euclidean.
APLIKASI GENERATOR AKORD DENGAN MENGGUNAKAN FONT NOTANGKA.TTF DAN MENGADAPTASI LOGIKA DIRECT PRODUCT PADA NOTASI MUSIKAL ANGKA Sediyono, Eko; Susanto, Yessica M.; Herman W., Theopillus
Jurnal Informatika Vol 10, No 1 (2009): MAY 2009
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.10.1.32-37

Abstract

Information technology has brought a big influence in other fields of science, especially in music. One part of the musical arrangement process is chord defining. Direct product is one of vector multiplication types. Although its using in vector, but in music, it can be used for searching all possibilities of chord arrangement. This chord generator will use NotAngka2.ttf as a basic for input writing. Because of the unexistence of application for writing song in number notation with NotAngka2 font type and generating some chord arrangements for the song, so this topic become a focus for application designing and implementing. Abstract in Bahasa Indonesia: Paper ini membahas perancangan aplikasi pembangkit akord dari not angka yang ditulis dengan editor teks dengan font NotAngka2.ttf. Langkah-langkah yang digunakan untuk membangkitkan akord menggunakan teknik kompilasi. Tahap pertama adalah lexical analysis yang menyaring string dan membentuk token. Tahap ke dua adalah syntax analysis dimana input yang masuk diteliti struktur gramarnya. Selanjutnya dengan menggunakan logika perkalian langsung (direct product logic), maka dapat dibentuk akord yang sesuai dengan lagu masukannya. Aplikasi yang dibangun masih dalam tahap awal, sehingga inputnya masih terbatas pada lagu yang sangat sederhana, yang dibatasi pada patokan nada dasar, ketukan, jenis akord, serta tangga nada yang digunakan Kata kunci: akord, direct product, syntax analysis, lexical analysis
DETEKSI LANDMARK CITRA WAJAH DENGAN EXTRAKSI FITUR GABOR ANALISA FUZZY Lim, Resmana
Jurnal Informatika Vol 4, No 1 (2003): MAY 2003
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.4.1.pp. 1-7

Abstract

This paper proposes a method that automatically finds human faces as well as its landmark points in color images based on a fuzzy analysis. The proposed approach first uses color information to detect face candidate regions and then uses a fuzzy analysis of the color, shape, symmetry and interior facial features. A deformable Gabor wavelet graph matching is used to locate the facial landmark points describing the face. The latter allows for size and orientation variation since the search for landmark points allows for affine transformations as well as local deformations of the Gabor wavelet graph. The search is performed using a genetic algorithm that is essential because it effectively searches the solution space. Results based on the proposed method are included to verify the effectiveness of the proposed approach. Abstract in Bahasa Indonesia : Paper ini mengusulkan sebuah metode deteksi wajah beserta dengan titik landmarknya pada citra berwarna menggunakan analisa fuzzy. Proses awal menggunakan informasi warna kulit untuk menseleksi calon-calon obyek lantas dilanjukan dengan analisa fuzzy terhadap warna, bentuk, simetri dan fitur/landmark wajah. Proses lokalisasi landmark wajah menggunakan Gabor wavelet graph matching dengan memaksimalkan kemiripan antara landmark wajah model dengan obyek inputan. Proses maksimalisasi kemiripan ini menggunakan algoritma genetika. Hasil-hasil percobaan ditampilkan untuk memberikan gambaran keberhasilan dari metode yang diusulkan. Kata kunci: lokalisasi landmark wajah, analisa fuzzy, graph matching, algoritma genetika, Gabor wavelet.
IMPLEMENTASI SISTEM OTENTIKASI PADA PENGGUNA JARINGAN HOTSPOT DI UNIVERSITAS KANJURUHAN MALANG GUNA MENINGKATKAN KEAMANAN JARINGAN KOMPUTER Ardian, Yusriel
Jurnal Informatika Vol 11, No 1 (2012): MAY 2012
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.11.1.34-41

Abstract

The number of client server applications using both desktop and WEB Application makes every user must have a lot of user id and password that must be memorized, because each application must require authentication in order to utilize the application for security reasons. Besides the development of network media is also growing use of both wired and wireless. From the above explanation RADIUS technology is desperately needed in the case described above, since the RADIUS method allows a user simply has a userID for access to multiple applications, both desktop and WEB application. RADIUS can also integrated method of wired and wireless media.
ALGORITMA LABELING CITRA BINER DENGAN PERFORMANSI OPTIMAL PROCESSOR-TIME Mozef, Eril
Jurnal Informatika Vol 5, No 2 (2004): NOVEMBER 2004
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.5.2.pp. 67-77

Abstract

In the literature, some labeling algorithms of nxn binary image, which are generally claimed as optimal, are only optimal with regards to the algorithmic aspect but not to the architectural aspect. Aside from this, the complexities obtained are not pure because the constant still depends on the value of n. This paper presents a labeling algorithm, which reaches purely Processor-Time optimal performance. This means that the optimal performance is not only reached considering its algorithm but also its architecture and "pure" means that the complexity obtained does not depend on the value of n. The algorithm complexity obtained is O(cn) using O(n) number of processors. In this paper the justification of complexity obtained is given and the performance comparison with other existing algorithms is discussed. Abstract in Bahasa Indonesia : Beberapa algoritma labeling untuk citra biner nxn yang diklaim optimal dalam literatur pada umumnya hanya optimal ditinjau dari aspek algoritmanya saja namun tidak optimal ditinjau dari dari aspek arsitektural. Disamping itu, kompleksitas-kompleksitas yang dihasilkan tersebut tidak murni karena masih mengandung konstanta yang tergantung harga n. Pada paper ini diperkenalkan suatu algoritma labeling dengan performansi optimal Processor-Time murni. Ini berarti optimal tidak hanya dicapai dari sisi algoritma namun juga dari sisi arsitektur dan murni karena kompleksitas yang didapat tidak mengandung konstanta yang tergantung harga n. Kompleksitas algoritma yang didapat tersebut adalah O(cn) dengan menggunakan O(n) prosesor. Pada paper ini diberikan pembuktian terhadap kompleksitas yang didapatkan dan perbandingan performansinya dengan beberapa algoritma yang ada. Kata kunci: Pengolahan citra, Labeling, Citra biner, Performansi optimal Processor-Time.
DATA MODEL CUSTOMIZATION FOR YII BASED ERP APPLICATION Leander, Andre; Wibowo, Adi; Dewi, Lily Puspa
Jurnal Informatika Vol 12, No 2 (2014): NOVEMBER 2014
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.12.2.63-69

Abstract

As UD. Logam Utama’s business grow, trigger the need of fast and accurate information in order to improve performance, efficiency, control and company’s values. The company needs a system that can integrate each functional area. ERP has centralized database and able to be configured, according to company’s business processes.First phase of application development is analysis and design the company’s business processes. The design phase produce a number of models that will be used to created application.The final result of application development is an ERP application that can be configured with the company’s business process. The ERP application consist of warehouse or production module, purchasing module, sales module, and accounting module.
ARSITEKTURAL DAN PEMROSESAN JARINGAN MENGGUNAKAN AGEN CERDAS MOBILE Yulianto J.P.M., Sri; Rostianingsih, Silvia
Jurnal Informatika Vol 6, No 1 (2005): MAY 2005
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.6.1.pp. 59-64

Abstract

The purpose of this research is to learn architecture and process-networking system in distributed computational using mobile intelligent agent. This technology attract people in order to develop system potential on distributed system, intelligent agent, intelligent distributed and e-commerce. In network processing, this method is used to reduce the network resource needed, asynchronous execution and effectively automatic system. This network protocol is one of network resources, which determines the structure of mobile agent hierarchy in migration agent process, as transmission data need. In wireless technology based the agent is used to control mobility in communication line. Mobile intelligent agent used to solve the data communication problem such as in system boundary limitedness and the speed of processing data. Abstract in Bahasa Indonesia : Penelitian ini bertujuan untuk mempelajari pengkajian arsitektural dan sistem pemrosesan jaringan dalam sistem komputasional terdistribusi menggunakan agen cerdas mobile. Teknologi ini menarik perhatian dari berbagai kalangan karena potensial dalam pengembangan system pada mesin terdistribusi, mesin cerdas cerdas terdistribusi dan e - commerce. Pada pemrosesan dalam jaringan, metode ini dapat mereduksi penggunaan sumberdaya jaringan, eksekusi secara asinkron dan automatisasi system secara efektif. Protokol jaringan merupakan salah satu sumberdaya jaringan yang menentukan struktur hierarki agen mobile khususnya dalam proses migrasi agen sesuai kebutuhan transmisi data. Pada jaringan berbasis wireless teknologi agen digunakan untuk pengendalian mobilitas pengguna dalam dinamika jalur komunikasi. Sistem agen cerdas mobile dapat menyelesaikan permasalahan yang menjadi kendala dalam komunikasi data seperti keterbatasan jangkauan sistem dan kecepatan pemrosesan data sistem. Kata kunci: agen cerdas mobile, sistem pemrosesan jaringan.
THE CPA QUALIFICATION METHOD BASED ON THE GAUSSIAN CURVE FITTING Adithia, M.T.
Jurnal Informatika Vol 13, No 2 (2015): NOVEMBER 2015
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.13.2.56-62

Abstract

The Correlation Power Analysis (CPA) attack is an attack on cryptographic devices, especially smart cards. The results of the attack are correlation traces. Based on the correlation traces, an evaluation is done to observe whether significant peaks appear in the traces or not. The evaluation is done manually, by experts. If significant peaks appear then the smart card is not considered secure since it is assumed that the secret key is revealed. We develop a method that objectively detects peaks and decides which peak is significant. We conclude that using the Gaussian curve fitting method, the subjective qualification of the peak significance can be objectified. Thus, better decisions can be taken by security experts. We also conclude that the Gaussian curve fitting method is able to show the influence of peak sizes, especially the width and height, to a significance of a particular peak.
PENERAPAN METODE FAST MARCHING PADA PERHITUNGAN GEODESIC DISTANCE PERMUKAAN OBYEK TRIANGULAR MESH Soelaiman, Rully; Tjandra, Eddy; Setiawan, I Made Agus
Jurnal Informatika Vol 7, No 1 (2006): MAY 2006
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/informatika.7.1.pp. 38-46

Abstract

In this paper, we will describe an algorithm for geodesic distance calculation that applied at the surface of triangular mesh object, to analyze its efficiency and accuracy. We applied the Fast Marching Method on Triangulated Domain (FMM On TD) with O(n lg n) time complexity, where n is the number of point/triangle vertex that represent the surface. The main task of this algorithm is to do the front propagation step from the starting point to all possible direction to obtained the final point. Every step of this algorithm, will calculate the distance from the current point to the starting point. After the calculation of the geodesic distance finished, the next process is to build the geodesic path. The main task of this step is to do the back propagation step at the object surface from the final point to the starting point. Based on the experimental result, the accuracy of the FMM on TD algorithm is more than 95%. This accuracy depend on the number of the triangles that represent the surface. The accuracy of the geodesic path and the computational times are depends on the number of the triangles that used to represent the surface Abstract in Bahasa Indonesia : Dalam makalah ini akan dibahas penerapan algoritma perhitungan geodesic distance pada permukaan obyek triangular mesh untuk dibuktikan tingkat keakuratan dan efisiensinya. Algoritma yang diterapkan adalah Fast Marching Method on Triangulated Domain (FMM on TD) yang berjalan dengan kompleksitas waktu O(n lg n), dimana n adalah jumlah titik pada permukaan. Inti dari algoritma ini adalah melakukan front propagation dari titik awal ke segala arah yang mungkin sampai diperoleh titik akhir. Setiap bergerak maju algoritma ini selalu menghitung nilai jarak suatu titik terhadap titik awal. Setelah proses perhitungan geodesic distance selesai, dilakukan proses pembuatan geodesic path. Inti dari proses ini adalah melakukan back propagation pada permukaan dari titik akhir sampai diperoleh titik awal. Berdasarkan uji coba, tingkat keakuratan algoritma FMM on TD adalah lebih dari 95%. Keakuratan ini dipengaruhi oleh jumlah segitiga pembentuk permukaan. Semakin banyak segitiga semakin akurat geodesic distance yang dihasilkan, tetapi waktu yang dibutuhkan untuk melakukan proses perhitungan menjadi semakin lama. Kata kunci: computational geometry, geodesic distance, geodesic path, triangular mesh, fast marching method on triangulated domain, front propagation, back propagation.

Page 18 of 19 | Total Record : 187

 15   16   17   18   19 

Filter by Year

1999 2017


Reset
Filter By Issues
All Issue Vol 14, No 1 (2017): MAY 2017 Vol 13, No 2 (2015): NOVEMBER 2015 Vol 13, No 1 (2015): MAY 2015 Vol 12, No 2 (2014): NOVEMBER 2014 Vol 12, No 1 (2014): MAY 2014 Vol 11, No 1 (2012): MAY 2012 Vol 10, No 2 (2009): NOVEMBER 2009 Vol 10, No 1 (2009): MAY 2009 Vol 9, No 2 (2008): NOVEMBER 2008 Vol 9, No 1 (2008): MAY 2008 Vol 8, No 2 (2007): NOVEMBER 2007 Vol 8, No 1 (2007): MAY 2007 Vol 7, No 2 (2006): NOVEMBER 2006 Vol 7, No 1 (2006): MAY 2006 Vol 6, No 2 (2005): NOVEMBER 2005 Vol 6, No 1 (2005): MAY 2005 Vol 5, No 2 (2004): NOVEMBER 2004 Vol 5, No 1 (2004): MAY 2004 Vol 4, No 2 (2003): NOVEMBER 2003 Vol 4, No 1 (2003): MAY 2003 Vol 3, No 2 (2002): NOVEMBER 2002 Vol 3, No 1 (2002): MAY 2002 Vol 2, No 2 (2001): NOVEMBER 2001 Vol 2, No 1 (2001): MAY 2001 Vol 1, No 1 (1999): MAY 1999 More Issue