Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Perfecting a Video Game with Game Metrics Indonesian Journal of Electrical Engineering and Computer Science
Jie Liu
Unknown Affiliation
Computer Science & IT

Published : 4 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 4 Documents
Search

 1 
Novel DV-hop Method Based on Krill Swarm Algorithm Used for Wireless Sensor Network Localization Yang Sun; Shoulin Yin; Jie Liu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 4: December 2016
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v14i4.3985

Abstract

Wireless sensor network (WSN) is self-organizing network; it consists of a large number of sensor nodes with perception, calculation ability and communication ability. As we all know, the floor, walls or people moving has an effect on indoor localization, so it will result in multi-path phenomena and decrease signal strength, also the received signal strength indicator (RSSI) is unable to gain higher accuracy of positioning. When using multilateral measurement method to calculate the unknown node coordinates, it will generate big error in range-free distance vector-hop (DV-hop) localization algorithm of WSN. In order to improve the WSN positioning accuracy in indoor condition, more reasonable distribute network resources, in this paper, we firstly propose krill swarm algorithm used for WSN localization. First, we detailed analyze the multilateral measurement method in DV-hop localization algorithm. The position problem can be transformed into a global optimization problem. Then, we adequately utilize the advantage of calculating optimization problem. We apply the krill swarm algorithm into the stage of estimating unknown node coordinates in DV-hop algorithm to realize localization. Finally, the simulation experience results show that the localization with krill swarm algorithm has an obviously higher positioning precision and accuracy stability with different anchor node proportion and nodes. We also make comparison with DV-hop algorithm and the newest localization algorithm.
A New Semi-supervised Clustering Algorithm Based on Variational Bayesian and Its Application Shoulin Yin; Jie Liu; Lin Teng
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 3: September 2016
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v14i3.3805

Abstract

Biclustering algorithm is proposed for discovering matrix with biological significance in gene expression data matrix and it is used widely in machine learning which can cluster the row and column of matrix. In order to further improve the performance of biclustering algorithm, this paper proposes a semi-supervised clustering algorithm based on variational Bayesian. Firstly, it introduces supplementary information of row and column for biclustering process and represents corresponding joint distribution probability model. In addition, it estimates the parameter of joint distribution probability model based on variational Bayesian learning method. Finally, it estimates the performance of proposed algorithm through synthesized data and real gene expression data set. Experiments show that normalized mutual information of this paper’s new method is better than relevant biclustering algorithms for biclustering analysis.
Distributed Searchable Asymmetric Encryption Shoulin Yin; Lin Teng; Jie Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 4, No 3: December 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v4.i3.pp684-694

Abstract

Searchable asymmetric encryption (SAE) can also be called Public Key Encryption with Keyword Search (PEKS), which allows us to search the keyword on the data of having been encrypted. The essence of Asymmetric searchable encryption is that users exchange the data of encryption, one party sends a ciphertext with key encryption, the other party with another key receives the ciphertext. Encryption key is not the same as the decryption key, and cannot deduce another key from any one of the key, thus it greatly enhances the information protection, and can prevent leakage the user's search criteria—Search Pattern. Secure schemes of SAE are practical, sometimes, however the speed of encryption/decryption in Public-key encryption is slower than private key. In order to get higher efficiency and security in information retrieval, in this paper we introduce the concept of distributed SAE, which is useful for security and can enable search operations on encrypted data. Moreover, we give the proof of security.
An Improved Chaos Electromagnetism Mechanism Algorithm for Path Optimization Problem Shoulin Yin; Jie Liu; Lin Teng
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 2: August 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i2.pp475-480

Abstract

As we all know, traditional electromagnetism mechanism (EM) algorithm has the disadvantage with low solution precision, lack of mining ability and easily falling into precocity. This paper proposes a new chaos electromagnetism mechanism algorithm combining chaotic mapping with limited storage Quasi-Newton Method (EM-CMLSQN). Its main idea is that it adopts limit quasi-Newton operator to replace the local optimization operator in EM algorithm for local searching in the late of algorithm. In the process of algorithm, the chaos mapping is introduced into optimization processes, and it generates new individuals to jump out of local to maintain the population diversity according to characteristics of chaos mapping random traversal. Finally, the experiments show that the new algorithm can effectively jump out of local optimal solution through comparing three continuous space test functions. The new algorithm has obvious advantages in terms of convergence speed compared to traditional EM algorithm, in addition, it is more accuracy than particle swarm optimization (PSO) algorithm. We compare the new chaos electromagnetism mechanism algorithm with ant colony optimization (ACO) algorithm, PSO algorithm, the results represent that new scheme can obtain the optimal path in the path optimization process, which shows that the new method has better applicability in the discrete domain problem.
Co-Authors Lin Teng Shoulin Yin Shoulin Yin Yang Sun