• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3397-3413
• /
• 2016

Considering that the layered cellular automata (LCA) are naturally fit for representing image data in various applications, a novel reverse iterative image encryption scheme based on LCA is proposed. Specifically, the plain image is set as the final configuration of an 8-layer CA, and some sequences derived from a random sequence are set as the pre-final configuration, which ensure that the same plain image will never be encrypted in the same way when encrypted many times. Then, this LCA is backward evolved by following some reversible two order rules, which are generated with the aid of a newly defined T-shaped neighborhood. The cipher image is obtained from the recovered initial configuration. Several analyses and experimental results show that the proposed scheme possesses a high security level and executive performance.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.681-691
• /
• 2010

A system of variational inclusions with (A, ${\eta}$, m)-accretive operators in real q-uniformly smooth Banach spaces is introduced. Using the resolvent operator technique associated with (A, ${\eta}$, m)-accretive operators, we prove the existence and uniqueness of solutions for this system of variational inclusions and propose a Mann type iterative algorithm for approximating the unique solution for the system of variational inclusions.

• East Asian mathematical journal
• /
• v.28 no.3
• /
• pp.265-280
• /
• 2012

In this paper, we introduce an iterative sequence by using a hybrid generalized $f$-projection algorithm for finding a common element of the set of fixed points of a relatively weak nonexpansive mapping an the set of solutions of a generalized variational inequality in a Banach space. Our results extend and improve the recent ones announced by Y. Liu [Strong convergence theorems for variational inequalities and relatively weak nonexpansive mappings, J. Glob. Optim. 46 (2010), 319-329], J. Fan, X. Liu and J. Li [Iterative schemes for approximating solutions of generalized variational inequalities in Banach spaces, Nonlinear Analysis 70 (2009), 3997-4007], and many others.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.140-150
• /
• 2012

In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.279-283
• /
• 2005

This paper deals with the design of a low-order H/sub ∞/ controller by using an iterative linear matrix inequality (LMI) method. The low-order H/sub ∞/ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, the recently developed penalty function method is applied. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. Numerical experiments showed the effectiveness of the proposed algorithm.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.12
• /
• pp.1262-1269
• /
• 2008

Though multilayered foam-panel structures have been widely used to reduce sound transmission in various fields, most of the previous works to design them were conducted by repeated analyses or experiments based on initially given configurations or sequences. Therefore, it was difficult to obtain an optimal sequence of multilayered foam-panel structure yielding superior sound isolation capability. In this work, we propose a new design method to sequence a multi-panel structure lined with a poroelastic material having maximized sound transmission loss. Being formulated as a one-dimensional topology optimization problem fur a given target frequency, the optimal sequencing of panel-poroelastic layers is systematically carried out in an iterative manner. In this method, a panel layer is expressed as a limiting case of a poroelastic layer to facilitate the optimization process. This means that main material properties of a poroelastic material are treated as interpolated functions of design variable. The designed sequences of panel-poroelastic multilayer were shown to be significantly affected by the target frequencies; more panels were obtained at higher target frequency. The sound transmission loss of the system was calculated by the transfer matrix derived from Biot's theory.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.609-612
• /
• 2001

An adaptive sub-optimal method using a preset threshold for combining partial transmit sequence (PTS) of an orthogonal frequency division multiplexing (OFDM) signal is presented. The results show that adaptive sub-optimal method reduces the 0.1% PAP by 3.4dB, while iterative flipping method reduces it by 3dB and PTS reduce it by 4.1dB. The complexity of adaptive sub-optimal method is 2.4% of that of PTS method for M=8.

• Research in Mathematical Education
• /
• v.8 no.4
• /
• pp.279-291
• /
• 2004

Mandelbrot sets and its generalizations have been extensively studied by using the Picard iterations. The purpose of this paper is to study superior Mandelbrot sets, a new class of Mandelbrot sets by introducing the Mann iterative procedure for polynomials Q$_{c}$(z) := z$^n$ + c. We generate some superior Mandelbrot sets for different values of n ($\geq$2) and these new figures are exciting and fascinating.g.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.375-388
• /
• 2013

In this paper, we introduce an iterative sequence for finding solution of a system of mixed equilibrium problems and the set of fixed points of a nonexpansive mapping in Hilbert spaces. Then, the weak and strong convergence theorems are proved under some parameters controlling conditions. Moreover, we apply our result to fixed point problems, system of equilibrium problems, general system of variational inequalities, mixed equilibrium problem, equilibrium problem and variational inequality.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.17-22
• /
• 2005

The generalized quasilinearization technique has been employed to obtain a sequence of approximate solutions converging monotonically and rapidly to a solution of the nonlinear Neumann boundary value problem.