• Transactions of Materials Processing
• /
• v.9 no.6
• /
• pp.653-662
• /
• 2000

Wrinkling is one of the major defects in sheet metal products together with tearing, springback and other geometric and surface defects. The initiation and growth of wrinkles are influenced by many factors such as stress ratios, mechanical properties of the sheet material, geometry of the workpiece, contact condition, etc. It is difficult to analyze the wrinkling initiation and growth considering all the factors because the effects of the factors are very complex and the wrinkling behavior may show a wide scatter of data even for small deviations of factors. The finite element analyses of the wrinkling initiation and growth in the sheet metal forming process provide the detailed information about the wrinkling behavior of sheet metal. The direct analyses of the wrinkling initiation and growth, however, bring about a little difficulty in complex industrial problems because it needs large memory size and long computation time. In the present study, therefore, a global-local analysis technique is introduced for the computational efficiency. Through the analysis of wrinkling in the door inner stamping process, the efficiency of the global-local analysis technique is investigated.

• Journal of Sensor Science and Technology
• /
• v.7 no.2
• /
• pp.124-130
• /
• 1998

High-speed 3D vision systems are essential for autonomous robot or vehicle control applications. In our study, a stereo vision process has been developed. It consists of three steps : extraction of edges in right and left images, matching corresponding edges and calculation of the 3D map. This process is implemented in a VME 150/40 Imaging Technology vision system. It is a modular system composed by a display, an acquisition, a four Mbytes image frame memory, and three computational cards. Programmable accelerator computational modules are running at 40 MHz and are based on TMS320C31 DSP with a $64{\times}32$ bit instruction cache and two $1024{\times}32$ bit internal RAMs. Each is equipped with 512 Kbytes static RAM, 4 Mbytes image memory, 1 Mbytes flash EEPROM and a serial port. Data transfers and communications between modules are provided by three 8 bit global video bus, and three local configurable pipeline 8 bit video bus. The VME bus is dedicated to system management. Tasks between DSPs are distributed as follows: two DSPs are used to edges detection, one for the right image and the other for the left one. The last processor computes the matching process and the 3D calculation. With $512{\times}512$ pixels images, this sensor generates dense 3D maps at a rate of about 1 Hz depending of the scene complexity. Results can surely be improved by using a special suited multiprocessors cards.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

• Journal of the Economic Geographical Society of Korea
• /
• v.21 no.4
• /
• pp.393-408
• /
• 2018

This study aims to raise our understanding of how memory of a social group is transnationally appropriated and utilized by other subjects. A collective sense of justice for comfort women has been handed to many Koreans either in Korea or in overseas countries since the early 1990s. In the U.S., the first comfort women monument was established in Palisades Park, New Jersey by Korean-Americans and local politicians as they wanted to strengthen the common sense of Korean ethnicity with the symbolic power of the memoryscape. Exploring the diffusion of comfort women memorials in the U.S., this study examines the complexity and multilayered structure of memory politics and its transnational mobility, which are connected to Korean-Americans' struggle for belonging.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1998.04a
• /
• pp.273-279
• /
• 1998

An immune system has powerful abilities such as memory, recognition and learning to respond to invading antigens, and is applied to many engineering algorithm recently. In this paper, the combined optimization algorithm is proposed for multi-optimization problem by introducing the capability of the immune system that controls the proliferation of clones to the genetic algorithm. The optimizing ability of the proposed optimization algorithm is identified by using two multi-peak functions which have many local optimums and optimization of the unbalance response function for rotor model.

• International Journal of Contents
• /
• v.3 no.3
• /
• pp.38-42
• /
• 2007

In this paper, we propose a new storage system architecture called as U-Storage (ubiquitous storage system). U-Storage allows a user to access an on-line storage with any type of information devices that are able to connect to internet. The on-line storage is virtualized to the user's information devices as a local hard disk or a memory card by our U-Storage. With devices supporting U-Storage, users can read and write their data anytime and anywhere without downloading and uploading operation.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.1
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.7
• /
• pp.1103-1109
• /
• 2003

An adaptive bone remodeling is simulated by using the cellular automata (CA) method. It is assumed that bone tissue consist of bone marrow, osteoclast, osteoblast cell or osteoprogenitor cell. Two types of local rule are adopted; those are the metabolism rule and adaptive bone formation rule. The metabolism rule is based on the interactions of cells and the bone formation rule is based on the adaptation against the mechanical stimulus. The history of load and memory of mechanical stimulus are also considered in the local rules. As a result, the pattern of distribution of the bone tissue is dynamically adequate and it is similar to intact cancellous bone.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.3
• /
• pp.13-18
• /
• 1984

This paper suggests an algorithm which can perform microoperations (MO'S) in parauel by considering concurrency of MO'S and resource allocation in horizontal microprogams. The algorithm can be obtained the result which reduces execution time and the space of control memory in microprogrammed digital systems by minimizing the total number of microinctructions by combining MO'5, which can be performed in paiallel by assigning a weight to each MO in the SLM (straight line microprogram), into a microinstruction.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.135-138
• /
• 1996

In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.