Articles
<![CDATA[ANALISA KUALITAS LAYANAN SISTEM KOMUNIKASI TETRA PADA KERETA API INDONESIA ]]>
<![CDATA[Primananda, Rakhmadany]]>;
<![CDATA[Djanali, Supeno]]>;
<![CDATA[Shiddiqi, Ary Mazharuddin]]>
<![CDATA[ JUTI: Jurnal Ilmiah Teknologi Informasi Vol 12, No 2, Juli 2014 ]]>
Publisher : <![CDATA[Department of Informatics, Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (2500.304 KB)
|
DOI: 10.12962/j24068535.v12i2.a323
<![CDATA[Pada sistem komunikasi dan informasi yang ada pada Perusahaan Terbatas Kereta Api Indonesia (PT KAI) Persero masih belum terintegrasi semua untuk saat ini. Sistem komunikasinya masih menggunakan sistem komunikasi analog seperti Very High Frequency (VHF) dengan frekuensi 400 MHz dan microwave yang mempunyai frekuensi 2 GHz, dimana kedua frekuensi tersebut terjadi interferensi terhadap frekuensi komunikasi selular. Sistem komunikasi analog ini tidak memungkinkan untuk bisa terintegrasi dengan informasi yang diberikan, karena membutuhkan pengubahan secara digital. Pada penelitian ini dibahas mengenai topologi jaringan TETRA untuk area Daop 1 Jakarta dalam hal ini KRL Jabodetabek dan TETRA untuk area Daop 8 Surabaya dengan simulator OPNET modeler. Hasil uji coba QoS menunjukkan bahwa hasil pembagian trafik yang ada pada 4 slot TDMA masih kurang maksimal untuk mendekati 115,2 kbps dalam hal throughput karena penggunaan channel yang kurang. Untuk SNR sudah didapatkan hasil yang baik yaitu rata-rata di atas 30dB. Perbedaan topologi dan penempatan BTS pada komunikasi sangat berpengaruh terhadap hasil kualitas jaringan yang didapatkan.]]>
<![CDATA[OPTIMASI OLSR ROUTING PROTOCOL PADA JARINGAN WIRELESS MESH DENGAN ADAPTIVE REFRESHING TIME INTERVAL DAN ENHANCE MULTI POINT RELAY SELECTING ALGORITHM ]]>
<![CDATA[Mapa, Faosan]]>;
<![CDATA[Djanali, Supeno]]>;
<![CDATA[Shiddiqi, Ary Mazharuddin]]>
<![CDATA[ JUTI: Jurnal Ilmiah Teknologi Informasi Vol 12, No 1, Januari 2014 ]]>
Publisher : <![CDATA[Department of Informatics, Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (615.487 KB)
|
DOI: 10.12962/j24068535.v12i1.a46
<![CDATA[Wireless Mesh Network (WMN) adalah suatu konektivitas jaringan yang self-organized, self-configured dan multi-hop. Tujuan dari WMN adalah menawarkan pengguna suatu bentuk jaringan nirkabel yang dapat dengan mudah berkomunikasi dengan jaringan konvensional dengan kecepatan tinggi dan dengan cakupan yang lebih luas serta biaya awal yang minimal. Diperlukan suatu desain protokol routing yang efisien untuk WMN yang secara adaptif dapat mendukung mesh routers dan mesh clients. Dalam tulisan ini, diusulkan untuk mengoptimalkan protokol OLSR, yang merupakan protokol routing proaktif. Digunakan heuristik yang meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki metode MPR selecting algorithm. Suatu analisa dalam meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki algoritma pemilihan MPR menunjukkan kinerja yang signifikan dalam hal throughput jika dibandingkan dengan protokol OLSR yang asli. Akan tetapi, terdapat kenaikan dalam hal delay. Pada simulasi yang dilakukan dapat disimpulkan bahwa OLSR dapat dioptimalkan dengan memodifikasi pemilihan node MPR berdasarkan cost effective dan penyesuaian waktu interval refreshing hello message sesuai dengan keadaan jaringan.]]>
<![CDATA[INCREASING THE ROBUSTNESS OF CLASSIFICATION ALGORITHMS TO QUANTIFY LEAKS THROUGH OPTIMIZATION ]]>
<![CDATA[Shiddiqi, Ary Mazharuddin]]>
<![CDATA[ JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 1, January 2020 ]]>
Publisher : <![CDATA[Department of Informatics, Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (911.082 KB)
|
DOI: 10.12962/j24068535.v18i1.a841
<![CDATA[Leaks in water pipeline networks have cost billions of dollars each year. Robust leak quantification (to detect and to localize) methods are needed to minimize the lost. We quantify leaks by classifying their locations using machine learning algorithms, namely Support Vector Machine and C4.5. The algorithms are chosen due to their high performance in classification. We simulate leaks at different positions at different sizes and use the data to train the algorithms. We tune the algorithm by optimizing the algorithms' parameters in the training process. Then, we tested the algorithms' models against real observation data. We also experimented with noisy data, due to sensor inaccuracies, that often happen in real situations. Lastly, we compared the two algorithms to investigate how accurate and robust they localize leaks with noisy data. We found that C4.5 is more robust against noisy data than SVM.]]>
<![CDATA[LOCATION BASED AGENDA NOTIFIER ON ANDROIDBASED MOBILE PHONE ]]>
<![CDATA[Wahyu Adi Prakosa Mazharuddin Shiddiqi, Ary]]>;
<![CDATA[Ayu Sinthia A., Putu]]>;
<![CDATA[Titi Ciptaningtyas, Henning]]>
<![CDATA[ Proceedings of KNASTIK 2012 ]]>
Publisher : <![CDATA[Duta Wacana Christian University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[People usually have their agenda noted on their mobile phones as it is able toremind the owner about the agenda. However, the ordinary agenda can onlyprovide information of the agenda detail without location map. This research aimsto create an application to provide detailed information as well as locationinformation of an agenda using Google Maps. In addition, this application is alsocapable of providing position information to the current user and shortest route tothe location of an event noted on the mobile phone agenda. Experiment results showthat the technique is able to provide information on the agenda with sufficientinformation about the location in term of map view and shortest route to arrive atthe event. This application has also been successfully implemented on manydifferent versions of Android and can also be run with either various types ofexisting telecommunications provider.]]>
<![CDATA[VIDEO STREAMING TERKOMPRESI BERBASIS UPNP MENGGUNAKAN METODE KUANTISASI VEKTOR DENGAN ALGORITMA FAIR SHARE AMOUNT ]]>
<![CDATA[Shiddiqi, Ary Mazharuddin]]>;
<![CDATA[Purwananto, Yudhi]]>;
<![CDATA[Yanto, Dedy]]>
<![CDATA[ Proceedings of KNASTIK 2009 ]]>
Publisher : <![CDATA[Duta Wacana Christian University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[Salah satu contoh keunggulan teknologi yang ada saat ini yaitu streaming file. Definisi dari streaming file adalahteknik untuk mengirim file dari satu device ke device lain yang berjalan secara terus menurus sehingga user di device tujuanbisa menjalankan file yang dikirim dengan tidak menunggu semua file dari tempat asal selesai dikirimkan.Proses streaming membutuhkan bandwith yang besar, karena data audio dan video biasanya memiliki ukuran yangbesar. Dengan kondisi bandwidth yang terbatas, proses streaming sulit diimplementasikan. Oleh karena itu dibutuhkan solusiyang bisa melakukan streaming pada bandwidth yang terbatas. Salah satu solusi yang memungkinkan yaitu denganmenggunakan metode kompresi ke dalam data yang akan distreaming. Kompresi dilakukan menggunakan metode kuantisasivektor dengan menggunakan algoritma Fair Share Amount (FSA). Streaming juga mengimplementasikan teknologi UPnP(Universal Plug And Play) sehingga proses streaming bisa diautomatisasi tanpa perlu mengetahui address pada device -device yang terhubung. Source streaming disebut dengan device sedangkan tujuan streaming disebut dengan control point.Berdasarkan hasil uji coba menunjukan bahwa dengan menggunakan arsitektur UPnP, aplikasi video streamingterkompresi menggunakan metode quantisasi vektor dengan algoritma FSA bisa diterapkan dengan baik serta prosentasekompresi yang dihasilkan dengan metode ini mencapai 75,8 % sampai 85 % dari file aslinya.]]>
<![CDATA[GCRFP - PAGE REPLACEMENT FOR SOLID STATE DRIVE USING GHOST-CACHE ]]>
<![CDATA[Suadi, Wahyu]]>;
<![CDATA[Djanali, Supeno]]>;
<![CDATA[Wibisono, Waskitho]]>;
<![CDATA[Anggoro, Radityo]]>;
<![CDATA[Shiddiqi, Ary Mazharuddin]]>
<![CDATA[ JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020 ]]>
Publisher : <![CDATA[Department of Informatics, Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.12962/j24068535.v18i2.a986
<![CDATA[State Drive (SSD) is an alternative to data storage that is popular today, widely used as a media cache to speed up data access to the hard disk (HDD). This paper proposes page replacement technique on SSD cache that used frequency and recency parameter, alternately. The algorithm is selected adaptively based on trace input. This method helps to overcome changes in access patterns while minimizing the number of write processes to SSD. The proposed algorithm can choose a replacement technique that suits the user access pattern so that it can bring a better hit rate. The proposed algorithm is also integrated with the ghost-cache mechanism so that the reduction in the number of writing processes to SSD is significant. The experiment runs using a real dataset, describing trace of data read, and data write taken from real usage. The trial shows that the proposed algorithm can give good results compared to other similar algorithms.]]>
<![CDATA[APPLIED MACHINE LEARNING IN LOAD BALANCING ]]>
<![CDATA[Junaidi, Junaidi]]>;
<![CDATA[Wibowo, Prasetyo]]>;
<![CDATA[Yuniasri, Dini]]>;
<![CDATA[Damayanti, Putri]]>;
<![CDATA[Shiddiqi, Ary Mazharuddin]]>;
<![CDATA[Pratomo, Baskoro Adi]]>
<![CDATA[ JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020 ]]>
Publisher : <![CDATA[Department of Informatics, Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.12962/j24068535.v18i2.a940
<![CDATA[A common way to maintain the quality of service on systems that are growing rapidly is by increasing server specifications or by adding servers. The utility of servers can be balanced with the presence of a load balancer to manage server loads. In this paper, we propose a machine learning algorithm that utilizes server resources CPU and memory to forecast the future of resources server loads. We identify the timespan of forecasting should be long enough to avoid dispatcher's lack of information server distribution at runtime. Additionally, server profile pulling, forecasting server resources, and dispatching should be asynchronous with the request listener of the load balancer to minimize response delay. For production use, we recommend that the load balancer should have friendly user interface to make it easier to be configured, such as adding resources of servers as parameter criteria. We also recommended from beginning to start to save the log data server resources because the more data to process, the more accurate prediction of server load will be.]]>
<![CDATA[EMERGENCY PROCESSES HANDLING IN URBAN AREA USING MODIFIED DIJKSTRA METHOD ]]>
<![CDATA[Wiratama, Prima]]>;
<![CDATA[Shiddiqi, Ary Mazharuddin]]>
<![CDATA[ JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 19, No. 2, Juli 2021 ]]>
Publisher : <![CDATA[Department of Informatics, Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.12962/j24068535.v19i2.a1047
<![CDATA[Emergency Aid has a very vital role in saving the patient's life. The emergency process involves two stages, namely the pre-hospital and the hospital stage. Striving for the entire emergency process is to have the fastest response time. The initial part of emergency treatment (pre-hospital) is determining the shortest and fastest route to the hospital. In addition, the availability of the targeted hospital must also be considered. We modified Dijkstra's Algorithm to produce the shortest route and the fastest time by considering the availability of the targeted hospital to support the handling of the emergency process. The modification made to the Dijkstra algorithm replaces the weight of Dijkstra's distance with a quantity representing the congestion rate and distance. Besides, the event time is estimated to determine the status of the intended hospital. As a result, Dijkstra's modification method can produce a more efficient and faster route.]]>
<![CDATA[A Video Streaming Application Using Mobile Media Application Programming Interface ]]>
<![CDATA[Ary Mazharuddin Shiddiqi]]>;
<![CDATA[Henry Pratama]]>;
<![CDATA[Henning Titi Ciptaningtyas]]>
<![CDATA[ TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 8, No 3: December 2010 ]]>
Publisher : <![CDATA[Universitas Ahmad Dahlan ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.12928/telkomnika.v8i3.631
<![CDATA[Recently, the development of mobile phone technology is growing rapidly. These developments led to the emerging of a multimedia mobile phone that supports Wireless Local Area Network (WLAN). However, the use of WLAN technology on mobile phones to access the streaming video is very rarely employed, while the current S60 Symbian operating system as a multimedia mobile phone is very reliable in handling a video. This study presents the making of a video streaming application in mobile phone via a WLAN connection using JSR 135 technology or the Mobile Media API (MMAPI). MMAPI is used to control the process of video streaming and its features. The application uses the two protocols; RTSP and HTTP. Experiment results show that the use of MMAPI on Symbian 60 based mobile phones to do video streaming is feasible and has a good reliability as 0% packet loss on connection. In addition, the times required to play multimedia files are not affected by the size of video streaming files.]]>
<![CDATA[PENGEMBANGAN APLIKASI BANTU BERBASIS WEB SEBAGAI PENUNJANG BISNIS MULTI LEVEL MARKETING PULSA ELEKTRIK ]]>
<![CDATA[Victor Hariadi]]>;
<![CDATA[Ary Mazharuddin Shiddiqi]]>
<![CDATA[ Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2010 ]]>
Publisher : <![CDATA[Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[ Bisnis pulsa elektrik berkembang pesat. Bisnis ini dapat berkembang dengan baik seiring denganpertumbuhan jumlah pengguna telepon seluler di Indonesia. Perkembangan model bisnis pulsa memasuki erasistem multi level marketing (MLM) dimana setiap pebisnis dimungkinkan membangun jejaring untukmemperluas bisnisnya. Beragam bentuk sistem penjualan bertingkat diterapkan untuk bisnis pulsa elektrik ini.Beragam aplikasi juga dikembangkan untuk membantu mempermudah proses bisnis ini. Namun aplikasi yangada belum dapat memberikan keleluasaan lebih bagi pelaku bisnis ini (baik upline maupun downline). Semuabentuk transaksi hanya dapat dilakukan melalui perangkat handphone saja.Dalam penelitian ini dikembangkan sebuah aplikasi berbasis web yang selain dapat digunakan untuk melakukansemua jenis transaksi penunjang bisnis MLM pulsa elektrik, juga dikembangkan fitur-fitur istimewa lain sepertivisualisasi tree dan fitur penunjang untuk proses otomasi pembentukan struktur MLM.Kata Kunci: Bisnis MLM pulsa elektrik, Aplikasi Berbasis Web, Visualisasi Tree, fitur penunjang untuk prosesotomasi pembentukan strktur MLM.]]>
