• Journal of the Korean Society of Costume
• /
• v.52 no.1
• /
• pp.129-143
• /
• 2002

Patterns are something that comes out of necessity in human life, which is closely associated with it. Thus come the SFAA (Seoul Fashion Artists Association) collection which uses patterns varying in form, color, way of expression and material. For this research, I first categorized the patterns the SFAA designers used into: natural patterns, symmetric patterns, traditional patterns, stripe, plaid, dot and abstract patterns. As a result of the process. the designers most favored the natural patterns and symmetric patterns, and dot patterns were rarely used. The designer who most favored patterns in general was Sul Yun-hyoung, and the designer Kim Chul-ung rarely favored the surface effect. The seven kinds of patterns naturally differ according to the designer. as Park Hang-chi liked to use the plaid patterns along with yam dyeing material, whereas Jin Teok expressed stripe patterns using the yarn dyeing fabric. Natural patters were presented in a bizarre way with Lie Sang-bong. who took the motives appearing in Eastern ceramic and paintings into the clothes, using the print method. The symmetric patterns, which the SFAA designers most preferred. was used evenly among designers like Chang Kwang-hyo, Gee Choon-hee. Rubina, and Haneza. In contrast. Lie Sang-bong. who used abstract patterns that do not give out meaning of the actual form of the pattern. rarely used symmetric patterns. The dot patterns were most often used by Park Youn-soo. and traditional patterns were overwhelmingly chosen by Sul Yun-hyoung. Secondly. in expressing the colors, SFAA designers were much more likely to choose achromatic colors. not choosing to show off colors. This is especially apparent in works by Haneza and Lie Sang-bong. In the SFAA collections, numerous methods were used to create. For instance, Sul Yun-hyoung used the oriental embroidery method. and Rubina and Lie Sang-bong used many unique dying methods. In terms of materials, Sul Yun-hyoung preferred silk. due to her methods, and Lie Sang-bong was one of the designers that used a number of different materials such as vinyl. Jacques Mueclier of the Paris Clothes Association in France, who was invited to SFAA collection once, remarked. "While the choice of material and the actual sewing done were excellent, there lacked much difference among the designers, as most of them choose flowing silhouette In terms of composition," which is all too correct. In addition, there were cases in the collection where the inherent feelings of cultural artifacts was expressed without alteration. Summing up, the research aimed to analyze the surface expression methods, forms and color of SFAA designs. and I hope that it can open up ways for new projects in the future.he future.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.435-443
• /
• 2007

Computing the interior spectrum of large sparse generalized eigenvalue problems $Ax\;=\;{\lambda}Bx$, where A and b are large sparse and SPD(Symmetric Positive Definite), is often required in areas such as structural mechanics and quantum chemistry, to name a few. Recently, CG-type methods have been found useful and hence, very amenable to parallel computation for very large problems. Also, as in the case of linear systems proper choice of preconditioning is known to accelerate the rate of convergence. After the smallest eigenpair is found we use the orthogonal deflation technique to find the next m-1 eigenvalues, which is also suitable for parallelization. This offers advantages over Jacobi-Davidson methods with partial shifts, which requires re-computation of preconditioner matrx with new shifts. We consider as preconditioners Incomplete LU(ILU)(0) in two variants, ever-relaxation(SOR), and Point-symmetric SOR(SSOR). We set m to be 5. We conducted our experiments on matrices from discretizations of partial differential equations by finite difference method. The generated matrices has dimensions up to 4 million and total number of processors are 32. MPI(Message Passing Interface) library was used for interprocessor communications. Our results show that in general the Multi-Color ILU(0) gives the best performance.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.4
• /
• pp.267-275
• /
• 2011

This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.290-297
• /
• 1999

In interior point methods for linear programming, we must solve a linear system with a symmetric positive definite matrix at every iteration, and Cholesky factorization is generally used to solve it. Therefore, if Cholesky factorization is not done successfully, many iterations are needed to find the optimal solution or we can not find it. We studied methods for improving the numerical stability of Cholesky factorization and the accuracy of the solution of the linear system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.201-212
• /
• 2007

Genetic algorithms (GAs) are very useful methods for global search and have been applied to various optimization problems. They have two kinds of important search mechanisms, crossover and mutation. Because the performance of GAs depends on these operators, a large number of operators have been developed for improving the performance of GAs. Especially, many researchers have been more interested in a crossover operator than a mutation operator. The reason is that a crossover operator is a main search operator in GAs and it has a more effect on the search performance. So, we also focus on a crossover operator. In this paper we first investigate the drawback of various crossovers, especially subtour-based crossovers and then introduce a new crossover operator to avoid such drawback and to increase efficiency. Also we compare it with several crossover operators for symmetric traveling salesman problem (STSP) for showing the performance of the proposed crossover. Finally, we introduce an efficient simple hybrid genetic algorithm using the proposed operator and then the quality and efficiency of the obtained results are discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1606-1623
• /
• 2015

Optical switching will be applied in datacenter networks because electronic switching is costly and power-consuming. In this paper, considering the ring-based interconnection using optical switching in the core of a datacenter, we study the home circuit (HC) construction for the labeled optical burst switching with home circuit (LOBS-HC), a new paradigm trying to share wavelengths among the HCs from the same source. In particular, aiming to construct HCs dynamically and properly, a scheme named optimal path matching and symmetric HC matching (OPM-SHM) is proposed. The main idea of OPM-SHM is to dynamically construct HCs by sharing wavelength(s) not only among the same-source HCs but also with symmetric HCs which have different sources other than the original LOBS-HC features. The simulation results demonstrate that OPM-SHM achieves better performance than some other methods in terms of burst loss rate and wavelength utilization of physical links. More specially, it maintains good load balancing for the datacenter network using an LOBS-HC ring. In addition, due to the symmetric feature of SHM, the proposed scheme can decrease the upper bound of the average hop count of the routing paths to half of the ring size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5B
• /
• pp.377-384
• /
• 2012

RFID system is a technique to obtain information of tag using radio frequency. Specificity of RFID systems using radio frequency has many problems that is eavesdropping, location tracking, spoofing attack, replay attack, denial of service attack. So, RFID protocol should be used cryptographic methods and mutual authentication for security and privacy. In this paper, we explain the problem of past protocol and propose the nonfixed symmetric key-based RFID mutual authentication protocol using shift computation and random number. Proposed protocol is secure from various attacks. Because it use shift operation and non-fixed symmetric key.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.63-69
• /
• 2001

In this study, we shall be concerned with computing in parallel a few of the smallest eigenvalues and their corresponding eigenvectors of the eigenvalue problem, $Ax={\lambda}Bx$, where A is symmetric, and B is symmetric positive definite. Both A and B are large and sparse. Recently iterative algorithms based on the optimization of the Rayleigh quotient have been developed, and CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for small extreme eigenvalues. As in the case of a system of linear equations, successful application of the CG scheme to eigenproblems depends also upon the preconditioning techniques. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. The idea underlying the present work is a parallel computation of the Multi-Color Block SSOR preconditioning for the CG optimization of the Rayleigh quotient together with deflation techniques. Multi-Coloring is a simple technique to obatin the parallelism of order n, where n is the dimension of the matrix. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI(Message Passing Interface) library was adopted for the interprocessor communications. The test problems were drawn from the discretizations of partial differential equations by finite difference methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.6
• /
• pp.151-155
• /
• 2006

In 2005, Yong and Lee proposed a buyer-seller fingerprinting protocol using symmetric and commutative encryptions. They claimed that their protocol was practical and anonymous since they used symmetric and commutative encryptions. However, an attacker can get the content embedded with one or more honest buyers' fingerprints using man-in-the-middle attack. In this letter, we point out the weakness and propose methods for improving to their protocol.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.4B
• /
• pp.413-419
• /
• 2008

In this study, we develop analytical solutions for long waves propagating over several types of axis-symmetric topographies where the water depth varies in an arbitrary power of radial distance. The first type is a cylindrical island mounted on a shoal. The second type is a circular island. To get the solution, the methods of separation of variables, Taylor series expansion and Frobenius series are used. Developed analytical solutions are validated by comparing with previously developed analytical solutions. We also investigate various cases with different incident wave periods, radii of the shoal, and the powers of radial distance.