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 yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,226 Documents
 283   284   285   286   287 
Batch zero-steganographic model for graph transformation Gouxi Chen; Pengcheng Zhang; Meng Zhang; Yuliang Wu
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 4: August 2012
Publisher : Institute of Advanced Engineering and Science

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

Abstract

To further improve the security of digital image steganography, based on graph transformation diversity, proposing a zero-steganographic model .After divided into many blocks, the secret information is deduced by graphic transform algorithm, a cover image steganographic model for not carrying secret information is constructed. Firstly, selecting a batch of cover images, through a particular transformation algorithm for them, and then find out the correlation of pixels between secret images and the new images, finally return to its original for transmission. Extracting secret information only to need the key without carrier images, further improve the security of secret information. Experimental results and analysis show that this model confidential is strong, the security is good, applies to images concealed communication. DOI: http://dx.doi.org/10.11591/telkomnika.v10i4.863
Identification of Hammerstein Model Based on Quantum Genetic Algorithm Zhang Hai Li
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 12: December 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Nonlinear system identification is a main topic of modern identification. A new method for nonlinear system identification is presented by using Quantum Genetic Algorithm(QGA). The problems of nonlinear system identification are cast as function optimization overprameter space, and the Quantum Genetic Algorithm is adopted to solve the optimization problem. Simulation experiments show that: compared with the genetic algorithm, quantum genetic algorithm is an effective swarm intelligence algorithm, its salient features of the algorithm parameters, small population size, and the use of Quantum gate update populations, greatly improving the recognition in the optimization of speed and accuracy. Simulation results show the effectiveness of the proposed method. DOI: http://dx.doi.org/10.11591/telkomnika.v11i12.3008
A Multi-Threaded Fingerprint Direct-Access Strategy Using Local-Star-Structure-based Discriminator Features G. Indrawan; B. Sitohang; S. Akbar; A. S. Nugroho
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 5: May 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Taking advantage of multi-thread technology provided by multi-core in single processor, this paper describes multi-thread implementation on fingerprint direct-access strategy using local-star-topology-based discriminator features. Multi-thread was applied for data partitioning on hashing add-lookup process, and for work partitioning on similarity score computation. Efficiency of the implementation was achieved, as confirmed by the results of experiments. Using quad-thread of dual-core single processor on last three largest databases on experiment, multi-thread implementation can reduce searching time at relatively constant value around 300 ms compare to its single-thread implementation. This result achieved with relatively same accuracy trend and has significant improvement by considering millisecond order of searching process on large scale data. DOI : http://dx.doi.org/10.11591/telkomnika.v12i5.5208
Energy-saving Routing Algorithm Based on Cluster in WSN He Ninghui; Li Hongsheng; Gao Jing
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 2: February 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

This paper takes the improved threshold formula and cluster radios formulas to choose cluster-heads by considering energy-saving, based on typical clustering routing protocol and optimal cluster-head selection formula. In the forming stage of cluster, the proportionality principle is used to make the distribution of cluster even more reasonable and during the stable stage of cluster, the member nodes in cluster use TDMA to communicate with the cluster-head node, and cluster-head nodes communicate with base station BS via multi-hop interrupt communication manner. Then it proposed the realization of target tracking based on the energy- saving routing algorithm. Finally, it can be seen in the simulation results that on the behalf of the network lifetime and average energy consumption, energy-saving routing algorithm is more reasonable. DOI: http://dx.doi.org/10.11591/telkomnika.v11i2.2032
Audio Denoising Based on Short Time Fourier Transform J. S. Ashwin; N. Manoharan
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 1: January 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i1.pp89-92

Abstract

This paper presents a novel audio de-noising scheme in a given speech signal. The recovery of original from the communication channel without any noise is a difficult task. Many de-noising techniques have been proposed for the removal of noises from a digital signal. In this paper, an audio de-noising technique based on Short Time Fourier Transform (STFT) is implemented. The proposed architecture uses a novel approach to estimate environmental noise from speech adaptively. Here original speech signals are given as input signal. Using AWGN, noises are added to the signal. Then noised signals are de-noised using STFT techniques. Finally Signal to Noise Ratio (SNR), Peak Signal to Noise Ratio (PSNR) values for noised and de-noised signals are obtained.
Multiple error correction towards optimisation of energy in sensor network Samirah Razali; Kamaruddin Mamat; Nor Shahniza Kamal Bashah
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 3: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i3.pp1208-1220

Abstract

Hybrid ARQ (HARQ) is among the optimum error controls implemented in Wireless Sensor Network as it reduces the overhead from retransmission and error correcting codes. The advancement in WSN includes the usage of high number of nodes and the increase in traffic with large data transmitted among the nodes had concerned the need for a new approach in error control algorithm. This paper proposed the multiple error correction based on HARQ process to aid the changes in channel with proper error correction assignment towards optimising the performances of WSN in terms of bit error rates, remaining energy, and latency for different types of congestion and channel conditions. In this study, we have developed the channel adaptation algorithm that can adapt to sudden changes and demonstrated the optimal error correcting codes as well as adjustment on the transmit power for the given channel condition and congestion presented. From the result analysed, the optimisation between the remaining energy and Bit Error rates happened on the basis of adapting to these different channel condition and congestion to minimize redundancies appended. From the result obtained, we concluded that by using multiple error correction algorithm with the aid of adjustment on the transmit power, the remaining energy can be optimised together with Bit Error rates and the excessive redundancies can be reduced
The Hybrid Probabilistic Query Algorithms Based on Inconsistent Database Hongyu Gao
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 9: September 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i9.pp6921-6931

Abstract

Integrity constraint is important to make data certain in relation database. Though there is plenty of uncertain information that is valuable and need to be searched and to be used. Combined with probabilistic database theory and on the basis of summarizing former results, this paper gives a new query plan aiming at inconsistent database. It uses the constraint methods including union, product, subtraction, selection, projection and link to repair inconsistent data effectively. Its probabilistic calculation with four elements and probabilistic query rewriting can overcome shortcomings of inconsistent databases. The experiments show these methods can decrease conflict of data.
RBF Neural Networks Optimization Algorithm and Application on Tax Forecasting YU Zhijun
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 7: July 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Accurate tax revenue forecasting has become a most important management goal, however, tax revenue often presents nonlinear data patterns. Therefore, a rigid forecasting approach with strong general nonlinear mapping capabilities is essential. The genetic algorithm has been used to select the parameters automatically for support vector machine. Then a RBF neural network has been built based on support vector machine and genetic algorithm, which helps to form a forecasting model system of RBF neural network optimization algorithms. As a result, this algorithm can avoid not only the shortcomings of traditional algorithm which is easy to get local minimal value, but also a large number of experiments or experiences which are needed to pre-specify network structure. Case study on Chinese tax revenue during the last 30 years demonstrates that the network based on this algorithm is much more accurate than other prediction methods. DOI: http://dx.doi.org/10.11591/telkomnika.v11i7.2199
Comparing load balancing algorithms for web application in cloud environment Zakaria Benlalia; Karim Abouelmehdi; Abderrahim Beni-hssane; Abdellah Ezzati
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 2: February 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i2.pp1104-1108

Abstract

Cloud computing has emerged as a new paradigm for providing on-demand computing resources and outsourcing software and hardware infrastructures. Load balancing is one of the major concerns in cloud computing environment means how to distribute load efficiently among all the nodes. For solving such a problem, we need some load balancing algorithms, so in this paper we will compare the existing algorithms for web application.and based on results obtained we choose the best among them.
Research on Space Target Recognition Algorithm Based on Empirical Mode Decomposition Xia Tian; Hou Chengyu; Shen Yiying
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: January 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

The space target recognition algorithm, which is based on the time series of radar cross section (RCS), is proposed in this paper to solve the problems of space target recognition in the active radar system. In the algorithm, EMD method is applied for the first time to extract the eigen of RCS time series. The normalized instantaneous frequencies of high-frequency intrinsic mode functions obtained by EMD are used as the eigen values for the recognition, and an effective target recognition criterion is established. The effectiveness and the stability of the algorithm are verified by both simulation data and real data. In addition, the algorithm could reduce the estimation bias of RCS caused by inaccurate evaluation, and it is of great significance in promoting the target recognition ability of narrow-band radar in practice. DOI : http://dx.doi.org/10.11591/telkomnika.v12i1.4142

Page 285 of 923 | Total Record : 9226

 283   284   285   286   287 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 42, No 1: April 2026 Vol 41, No 3: March 2026 Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue