• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5673-5691
• /
• 2019

Information centric mobile network can significantly improve the data retrieving efficiency by caching contents at mobile edge. However, the cache pollution attack can affect the data obtaining process severely by requiring unpopular contents deliberately. To tackle the problem, we design an algorithm of mitigating cache pollution attacks in information centric mobile network. Particularly, the content popularity distribution statistic is proposed to detect abnormal behavior. Then a probabilistic caching strategy based on abnormal behavior is applied to dynamically maintain the steady-state distribution for content visiting probability and achieve the purpose of defense. The experimental results show that the proposed scheme can achieve higher request hit ratio and smaller latency for false locality content pollution attack than the CacheShield approach and the baseline approach where no mitigation approach is applied.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3591-3606
• /
• 2014

In this paper, a robust watermarking scheme is proposed that uses the scale-invariant feature transform (SIFT) algorithm in the discrete wavelet transform (DWT) domain. First, the SIFT feature areas are extracted from the original image. Then, one level DWT is applied on the selected SIFT feature areas. The watermark is embedded by modifying the fractional portion of the horizontal or vertical, high-frequency DWT coefficients. In the watermark extracting phase, the embedded watermark can be directly extracted from the watermarked image without requiring the original cover image. The experimental results showed that the proposed scheme obtains the robustness to both signal processing and geometric attacks. Also, the proposed scheme is superior to some previous schemes in terms of watermark robustness and the visual quality of the watermarked image.

• Smart Structures and Systems
• /
• v.25 no.4
• /
• pp.401-408
• /
• 2020

This paper deals with the problem of global stabilization for a class of nonlinear control systems. An effective approach is proposed for controlling the system interaction of structures through a combination of parallel distributed compensation (PDC) intelligent controllers and fuzzy observers. An efficient approximate inference algorithm using expectation propagation and a Bayesian additive model is developed which allows us to predict the total number of control systems, thereby contributing to a more adaptive trajectory for the closed-loop system and that of its corresponding model. The closed-loop fuzzy system can be made as close as desired, so that the behavior of the closed-loop system can be rigorously predicted by establishing that of the closed-loop fuzzy system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4487-4511
• /
• 2018

A fast image encryption system based on substitution and diffusion was proposed, which includes one covering process, one substitution process and two diffusion processes. At first, Chen's chaotic system together with an external 256-bit long secret key was used to generate the key streams for image encryption, in which the initial values of Chen's chaotic system were regarded as the public key. Then the plain image was masked by the covering process. After that the resulting image was substituted with the disturbed S-Box of AES. Finally, the substituted image was diffused twice with the add-modulo operations as the core to obtain the cipher image. Simulation analysis and comparison results with AES and some existing image cryptosystems show that the proposed image cryptosystem possesses the merits of fast encryption/decryption speed, good statistical characteristics, strong sensitivity and etc., and can be used as a candidate system of network security communication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1236-1248
• /
• 1991

A new fast algorithm for computing the discrete cosine transform(DCT) Is developed decomposing N-point DCT into an N /2-point DCT and two N /4 point transforms(transpose of an N /4-point DCT. TN/t'and)It has an important characteristic that in this method, the roundoff noise power for a fixed point arithmetic can be reduced significantly with respect to the wellknown fast algorithms of Lee and Chen. since most coefficients for multiplication are distributed at the nodes close to the output and far from the input in the signal flow graph In addition, it also shows three other versions of factorization of DCT matrix with the same number of operations but with the different distributions of multiplication coefficients.

• Earthquakes and Structures
• /
• v.21 no.6
• /
• pp.577-585
• /
• 2021

In this research, a neural network (NN) method was developed, which combines H-infinity and fuzzy control for the purpose of stabilization and stability analysis of nonlinear systems. The H-infinity criterion is derived from the Lyapunov fuzzy method, and it is defined as a fuzzy combination of quadratic Lyapunov functions. Based on the stability criterion, the nonlinear system is guaranteed to be stable, so it is transformed to be a linear matrix inequality (LMI) problem. Since the demo active vibration control system to the tuning of the algorithm sequence developed a controller in a manner, it could effectively improve the control performance, by reducing the wind's excitation configuration in response to increase in the cost efficiency, and the control actuator.

• Steel and Composite Structures
• /
• v.47 no.4
• /
• pp.513-521
• /
• 2023

The goal of this work is to create a new and improved GWO (Grey Wolf Optimizer), the so-called Robot GWO (RGWO), for dynamic and static target tracking involving multiple robots in unknown environmental conditions. From applying ourselves with the Gray Wolf Optimization Algorithm (GWO) and how it works, as the name suggests, it is a nature-inspired metaheuristic based on the behavior of wolf packs. Like other nature-inspired metaheuristics such as genetic algorithms and firefly algorithms, we explore the search space to find the optimal solution. The results also show that the improved optimal control method can provide superior power characteristics even when operating conditions and design parameters are changed.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.527-539
• /
• 2023

In the positioning algorithm of two-dimensional planar sensor array, the estimation error of time difference-ofarrival (TDOA) algorithm is difficult to avoid. Thus, how to achieve accurate positioning is a key problem of the positioning technology based on planar array. In this paper, a method of sensor reliability discrimination is proposed, which is the foundation for selecting positioning sensors with small error and excellent performance, simplifying algorithm, and improving positioning accuracy. Then, a positioning model is established. The estimation characteristics of the least square method are fully utilized to calculate and fuse the positioning results, and the non-uniform weighting method is used to correct the weighting factors. It effectively handles the decreased positioning accuracy due to measurement errors, and ensures that the algorithm performance is improved significantly. Finally, the characteristics of the improved algorithm are compared with those of other algorithms. The experiment data demonstrate that the algorithm is better than the standard least square method and can improve the positioning accuracy effectively, which is suitable for vibration detection with large noise interference.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.721-726
• /
• 2012

In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4835-4855
• /
• 2018

In this paper, we study the sparse signal recovery that uses information of both support and amplitude of the sparse signal. A convergent iterative algorithm for sparse signal recovery is developed using Majorization-Minimization-based Non-convex Optimization (MM-NcO). Furthermore, it is shown that, typically, the sparse signals that are recovered using the proposed iterative algorithm are not globally optimal and the performance of the iterative algorithm depends on the initial point. Therefore, a modified MM-NcO-based iterative algorithm is developed that uses prior information of both support and amplitude of the sparse signal to enhance recovery performance. Finally, the modified MM-NcO-based iterative algorithm is used to estimate the time-varying sparse wireless channels with temporal correlation. The numerical results show that the new algorithm performs better than related algorithms.