cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Yuliah Qotimah
Contact Email
yuliah@lppm.itb.ac.id
Phone
+622286010080
Journal Mail Official
jictra@lppm.itb.ac.id
Editorial Address
LPPM - ITB Center for Research and Community Services (CRCS) Building Floor 6th Jl. Ganesha No. 10 Bandung 40132, Indonesia Telp. +62-22-86010080 Fax. +62-22-86010051
Location
Kota bandung,
Jawa barat
INDONESIA
Journal of ICT Research and Applications
Published by Institut Teknologi Bandung
ISSN : 23375787     EISSN : 23385499     DOI : https://doi.org/10.5614/itbj.ict.res.appl.
Core Subject : Science,
Computer Science & IT
Journal of ICT Research and Applications welcomes full research articles in the area of Information and Communication Technology from the following subject areas: Information Theory, Signal Processing, Electronics, Computer Network, Telecommunication, Wireless & Mobile Computing, Internet Technology, Multimedia, Software Engineering, Computer Science, Information System and Knowledge Management.
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 7 Documents
 1 
Search results for , issue "Vol. 10 No. 1 (2016)" : 7 Documents clear
Randomized Symmetric Crypto Spatial Fusion Steganographic System Viswanathan Perumal
Journal of ICT Research and Applications Vol. 10 No. 1 (2016)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.res.appl.2016.10.1.2

Abstract

The image fusion steganographic system embeds encrypted messages in decomposed multimedia carriers using a pseudorandom generator but it fails to evaluate the contents of the cover image. This results in the secret data being embedded in smooth regions, which leads to visible distortion that affects the imperceptibility and confidentiality. To solve this issue, as well as to improve the quality and robustness of the system, the Randomized Symmetric Crypto Spatial Fusion Steganography System is proposed in this study. It comprises three-subsystem bitwise encryption, spatial fusion, and bitwise embedding. First, bitwise encryption encrypts the message using bitwise operation to improve the confidentiality. Then, spatial fusion decomposes and evaluates the region of embedding on the basis of sharp intensity and capacity. This restricts the visibility of distortion and provides a high embedding capacity. Finally, the bitwise embedding system embeds the encrypted message through differencing the pixels in the region by 1, checking even or odd options and not equal to zero constraints. This reduces the modification rate to avoid distortion. The proposed heuristic algorithm is implemented in the blue channel, to which the human visual system is less sensitive. It was tested using standard IST natural images with steganalysis algorithms and resulted in better quality, imperceptibility, embedding capacity and invulnerability to various attacks compared to other steganographic systems.
Design of Triple-Band Bandpass Filter Using Cascade Tri-Section Stepped Impedance Resonators Gunawan Wibisono; Teguh Firmansyah; Tierta Syafraditya
Journal of ICT Research and Applications Vol. 10 No. 1 (2016)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.res.appl.2016.10.1.4

Abstract

In this research, a triple-band bandpass filter (BPF) using a cascade tri section step impedance resonator (TSSIR), which can be operated at 900 MHz, 1,800 MHz, and 2,600 MHz simultaneously, was designed, fabricated and evaluated. Advanced Design System (ADS) was used to design and simulate the proposed BPF. The proposed BPF using cascade TSSIR was fabricated on an FR4 substrate with dielectric permittivity, substrate thickness and loss tangent at 4.3, 1.6 mm and 0.0017, respectively. The performance parameters of the proposed BPF were characterized by insertion loss, return loss, voltage standing wave ratio (VSWR) and group delay. The performance results from the simulation were compared to those of the fabricated BPF. The results showed that the performances from both the simulated and the fabricated BPF satisfied the design specifications and were in close agreement with each other. Furthermore, the results indicated that the proposed BPF using cascade TSSIR performed better than a hairpin BPF with TSSIR.
VLSI Architecture for Configurable and Low-Complexity Design of Hard-Decision Viterbi Decoding Algorithm Rachmad Vidya Wicaksana Putra; Trio Adiono
Journal of ICT Research and Applications Vol. 10 No. 1 (2016)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.res.appl.2016.10.1.5

Abstract

Convolutional encoding and data decoding are fundamental processes in convolutional error correction. One of the most popular error correction methods in decoding is the Viterbi algorithm. It is extensively implemented in many digital communication applications. Its VLSI design challenges are about area, speed, power, complexity and configurability. In this research, we specifically propose a VLSI architecture for a configurable and low-complexity design of a hard-decision Viterbi decoding algorithm. The configurable and low-complexity design is achieved by designing a generic VLSI architecture, optimizing each processing element (PE) at the logical operation level and designing a conditional adapter. The proposed design can be configured for any predefined number of trace-backs, only by changing the trace-back parameter value. Its computational process only needs N + 2 clock cycles latency, with N is the number of trace-backs. Its configurability function has been proven for N = 8, N = 16, N = 32 and N = 64. Furthermore, the proposed design was synthesized and evaluated in Xilinx and Altera FPGA target boards for area consumption and speed performance.
Topic Modeling in Sentiment Analysis: A Systematic Review Toqir Ahmad Rana; Yu-N Cheah; Sukumar Letchmunan
Journal of ICT Research and Applications Vol. 10 No. 1 (2016)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.res.appl.2016.10.1.6

Abstract

With the expansion and acceptance of Word Wide Web, sentiment analysis has become progressively popular research area in information retrieval and web data analysis. Due to the huge amount of user-generated contents over blogs, forums, social media, etc., sentiment analysis has attracted researchers both in academia and industry, since it deals with the extraction of opinions and sentiments. In this paper, we have presented a review of topic modeling, especially LDA-based techniques, in sentiment analysis. We have presented a detailed analysis of diverse approaches and techniques, and compared the accuracy of different systems among them. The results of different approaches have been summarized, analyzed and presented in a sophisticated fashion. This is the really effort to explore different topic modeling techniques in the capacity of sentiment analysis and imparting a comprehensive comparison among them.
Dynamic Path Planning for Mobile Robots with Cellular Learning Automata Judhi Santoso; Bambang Riyanto; Widyawardhana Adiprawita
Journal of ICT Research and Applications Vol. 10 No. 1 (2016)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.res.appl.2016.10.1.1

Abstract

In this paper we propose a new approach to path planning for mobile robots with cellular automata and cellular learning automata. We divide the planning into two stages. In the first stage, global path planning is performed by cellular automata from an initial position to a goal position. In this stage, the minimum distance is computed. To compute the path, we use a particular two-dimensional cellular automata rule. The process of computation is performed using simple arithmetic operations, hence it can be done efficiently. In the second stage, local planning is used to update the global path. This stage is required to adapt to changes in a dynamic environment. This planning is implemented using cellular learning automata to optimize performance by collecting information from the environment. This approach yields a path that stays near to the obstacles and therefore the total time and distance to the goal can be optimized.
Voting-based Classification for E-mail Spam Detection Bashar Awad Al-Shboul; Heba Hakh; Hossam Faris; Ibrahim Aljarah; Hamad Alsawalqah
Journal of ICT Research and Applications Vol. 10 No. 1 (2016)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.res.appl.2016.10.1.3

Abstract

The problem of spam e-mail has gained a tremendous amount of attention. Although entities tend to use e-mail spam filter applications to filter out received spam e-mails, marketing companies still tend to send unsolicited e-mails in bulk and users still receive a reasonable amount of spam e-mail despite those filtering applications. This work proposes a new method for classifying e-mails into spam and non-spam. First, several e-mail content features are extracted and then those features are used for classifying each e-mail individually. The classification results of three different classifiers (i.e. Decision Trees, Random Forests and k-Nearest Neighbor) are combined in various voting schemes (i.e. majority vote, average probability, product of probabilities, minimum probability and maximum probability) for making the final decision. To validate our method, two different spam e-mail collections were used.
Cover JICTRA Vol. 10 No. 1, 2016 Journal of ICT Research and Applications
Journal of ICT Research and Applications Vol. 10 No. 1 (2016)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Page 1 of 1 | Total Record : 7

 1 

Filter by Year

2016 2016


Reset
Filter By Issues
All Issue Vol. 19 No. 2 (2025) Vol. 19 No. 1 (2025) Vol. 18 No. 2 (2024): (In Progress) Vol. 18 No. 1 (2024) Vol. 17 No. 3 (2023) Vol. 17 No. 2 (2023) Vol. 17 No. 1 (2023) Vol. 16 No. 3 (2022) Vol. 16 No. 2 (2022) Vol. 16 No. 1 (2022) Vol. 15 No. 3 (2021) Vol. 15 No. 2 (2021) Vol. 15 No. 1 (2021) Vol. 14 No. 3 (2021) Vol. 14 No. 2 (2020) Vol. 14 No. 1 (2020) Vol. 13 No. 3 (2019) Vol. 13 No. 2 (2019) Vol. 13 No. 1 (2019) Vol. 12 No. 3 (2018) Vol. 12 No. 2 (2018) Vol. 12 No. 1 (2018) Vol. 11 No. 3 (2017) Vol. 11 No. 2 (2017) Vol. 11 No. 1 (2017) Vol. 10 No. 3 (2016) Vol. 10 No. 2 (2016) Vol. 10 No. 1 (2016) Vol. 9 No. 3 (2015) Vol. 9 No. 2 (2015) Vol. 9 No. 1 (2015) Vol. 8 No. 3 (2015) Vol. 8 No. 2 (2014) Vol. 8 No. 1 (2014) Vol. 7 No. 3 (2013) Vol. 7 No. 2 (2013) Vol. 7 No. 1 (2013) Vol. 6 No. 3 (2012) Vol. 6 No. 2 (2012) Vol. 6 No. 1 (2012) Vol. 5 No. 3 (2011) Vol. 5 No. 2 (2011) Vol. 5 No. 1 (2011) Vol. 4 No. 2 (2010) Vol. 4 No. 1 (2010) Vol. 3 No. 2 (2009) Vol. 3 No. 1 (2009) Vol. 2 No. 2 (2008) Vol. 2 No. 1 (2008) Vol. 1 No. 2 (2007) Vol. 1 No. 1 (2007) More Issue