• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• 충청수학회지
• /
• 제15권2호
• /
• pp.47-56
• /
• 2003

This note is concerned with some properties of fixed points and periodic points. First, we have constructed a generalized continuous function to give a proof for the fact that, as the reverse of the Sharkovsky theorem[16], for a given positive integer n, there exists a continuous function with a period-n point but no period-m points wherem is a predecessor of n in the Sharkovsky ordering. Also we show that the composition of two transcendental meromorphic functions, one of which has at least three poles, has infinitely many fixed points.

• 한국정밀공학회지
• /
• 제21권4호
• /
• pp.140-147
• /
• 2004

In reverse engineering, the whole surfaces of the three-dimensional product are measured using 3D positional scanners. The raw triangle meshes constructed from a scanned point set are not well fitted for direct use in the downstream engineering or graphic activities. No object can be fully described by a single scan. Although multiple scans are usually taken and aligned to achieve a complete model, a set of scanned points does not entirely wrap the whole object. This is because some surfaces may be inaccessible to the scanner, so some portion of the scanned surface may be missing. This paper discusses the algorithms of a hole-filling that are crucial to refine the triangle meshes. In this paper, the holes are filled with flat triangles first by subdivision operation and then smoothed with neighboring triangles. This process continues until it converges to a certain user-defined iteration number. Examples are given and discussed to validate the system.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.81-96
• /
• 2006

We consider a rental company that dynamically manages Its capacity level through capacity addition and return While serving customer with its own capacity, the company expands its capacity by renting items from an outside source so that it can avoid lost opportunities of rental which occur when stock is not sufficient. If stock becomes sufficiently large enough to cope with demands, the company returns expanded capacity to the outside source. Formulating the model into a Markov decision problem, we identify an optimal capacity management Policy which states when the company should expand its capacity and when it should return expanded capacity after capacity addition. Since it is intractable to analytically find the optimal capacity management policy and the optimal size of capacity expansion, we present a numerical procedure that finds these optimal values based on the value iteration method. Numerical analysis is implemented and we observe monotonic properties of the optimal performance measures by system parameters, which are meaningful in developing effective heuristic policies.

• 한국정밀공학회지
• /
• 제30권6호
• /
• pp.601-606
• /
• 2013

3D scanning is a technique to measure the 3D shape information of the object. Shape information obtained by 3D scanning is expressed either as point cloud or as polygon mesh type data that can be widely used in various areas such as reverse engineering and quality inspection. 3D scanning should be performed as accurate as possible since the scanned data is highly required to detect the features on an object in order to scan the shape of the object more precisely. In this study, we propose the method on finding the location of feature more accurately, based on the extended Biplane SNAKE with global optimization. In each iteration, we project the feature lines obtained by the extended Biplane SNAKE into each image plane and move the feature lines to the features on each image. We have applied this approach to real models to verify the proposed optimization algorithm.

• 제어로봇시스템학회논문지
• /
• 제15권4호
• /
• pp.451-455
• /
• 2009

This paper provides a comparison of global path planning method in single string by using pulled and pushed SOFM (Self-Organizing Feature Map) which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial-weight-vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified SOFM method in this research uses a predetermined initial weight vectors of the one dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward or reverse the input vector, by rising a pulled- or a pushed-SOFM. According to simulation results one can conclude that the modified neural networks in single string are useful tool for the global path planning problem of a mobile robot. In comparison of the number of iteration for converging to the solution the pushed-SOFM is more useful than the pulled-SOFM in global path planning for mobile robot.